TSTP Solution File: GRP497-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP497-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 11:39:09 EDT 2022
% Result : Unsatisfiable 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(identity,double_divide(X,double_divide(Y,identity))),double_divide(double_divide(Y,double_divide(Z,X)),identity)) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = double_divide(double_divide(Y,X),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = double_divide(X,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = double_divide(X,inverse(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(6,plain,
multiply(X,Y) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
inverse(inverse(a2)) != a2,
inference('REWRITE',[status(thm)],[prove_these_axioms_2,inverse,6,theory(equality)]) ).
cnf(8,plain,
double_divide(double_divide(identity,double_divide(X,inverse(Y))),inverse(double_divide(Y,double_divide(Z,X)))) = Z,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,8,theory(equality)]) ).
cnf(10,plain,
double_divide(identity,inverse(double_divide(X,double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),9,inverse,theory(equality)]) ).
cnf(11,plain,
double_divide(double_divide(identity,double_divide(identity,inverse(X))),inverse(double_divide(X,inverse(Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(16,plain,
double_divide(identity,inverse(double_divide(identity,inverse(X)))) = X,
inference('PARAMODULATE',[status(thm)],[10,inverse,theory(equality)]) ).
cnf(17,plain,
double_divide(identity,inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(24,plain,
double_divide(identity,inverse(X)) = inverse(inverse(X)),
inference('PARAMODULATE',[status(thm)],[16,17,theory(equality)]) ).
cnf(27,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[17,24,theory(equality)]) ).
cnf(28,plain,
double_divide(inverse(inverse(inverse(X))),inverse(double_divide(X,inverse(Y)))) = Y,
inference('REWRITE',[status(thm)],[11,24,theory(equality)]) ).
cnf(30,plain,
inverse(inverse(double_divide(X,double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[10,24,theory(equality)]) ).
cnf(46,plain,
inverse(inverse(X)) = double_divide(Y,double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[27,30,theory(equality)]) ).
cnf(52,plain,
double_divide(inverse(inverse(inverse(X))),inverse(inverse(X))) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,9,theory(equality)]),inverse,theory(equality)]) ).
cnf(54,plain,
double_divide(inverse(X),X) = identity,
inference('PARAMODULATE',[status(thm)],[52,27,theory(equality)]) ).
cnf(55,plain,
inverse(inverse(inverse(X))) = inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[46,54,theory(equality)]),inverse,theory(equality)]) ).
cnf(58,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[27,55,theory(equality)]) ).
cnf(62,plain,
$false,
inference('REWRITE',[status(thm)],[7,58,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP497-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 08:01:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 *
% 0.19/0.48 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T08:01:29
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-14T08:01:29
% 0.19/0.50
% 0.19/0.53 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.19/0.53
% 0.19/0.53 #||
% 0.19/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.53 % SZS output start Refutation
% See solution above
% 0.19/0.53 ||#
% 0.19/0.53
% 0.19/0.53 ; Summary of computation:
% 0.19/0.53 ; 170 formulas have been input or derived (from 20 formulas).
% 0.19/0.53 ; 62 (36%) were retained. Of these,
% 0.19/0.53 ; 44 (71%) were simplified or subsumed later,
% 0.19/0.53 ; 18 (29%) are still being kept.
% 0.19/0.53 ;
% 0.19/0.53 ; Run time in seconds excluding printing time:
% 0.19/0.53 ; 0.002 4% Read assertion file (1 call)
% 0.19/0.53 ; 0.000 0% Assert (5 calls)
% 0.19/0.53 ; 0.010 21% Process new row (162 calls)
% 0.19/0.53 ; 0.001 2% Resolution (38 calls)
% 0.19/0.53 ; 0.004 9% Paramodulation (19 calls)
% 0.19/0.53 ; 0.004 9% Forward simplification (134 calls)
% 0.19/0.53 ; 0.002 4% Backward simplification (62 calls)
% 0.19/0.53 ; 0.000 0% Ordering (278 calls)
% 0.19/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.53 ; 0.000 0% Purity testing (1 call)
% 0.19/0.53 ; 0.024 51% Other
% 0.19/0.53 ; 0.047 Total
% 0.19/0.53 ; 0.050 Real time
% 0.19/0.53 ;
% 0.19/0.53 ; Term-hash-array has 199 terms in all.
% 0.19/0.53 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.53 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.53 ; Path-index has 74 entries (101 at peak, 254 added, 180 deleted).
% 0.19/0.53 ; Path-index has 405 nodes (447 at peak, 620 added, 215 deleted).
% 0.19/0.53 ; Trie-index has 74 entries (101 at peak, 254 added, 180 deleted).
% 0.19/0.53 ; Trie-index has 278 nodes (407 at peak, 1,013 added, 735 deleted).
% 0.19/0.53 ; Retrieved 229 generalization terms in 757 calls.
% 0.19/0.53 ; Retrieved 122 instance terms in 62 calls.
% 0.19/0.53 ; Retrieved 292 unifiable terms in 129 calls.
% 0.19/0.53 ;
% 0.19/0.53 ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.19/0.53 ; 4 with value 0
% 0.19/0.53 ; The agenda of rows to process has 4 entries:
% 0.19/0.53 ; 1 with value 17 1 with value 22 2 with value 24
% 0.19/0.53 ; The agenda of rows to give has 10 entries:
% 0.19/0.53 ; 1 with value (4 10) 1 with value (4 18) 1 with value (4 28)
% 0.19/0.53 ; 1 with value (4 12) 1 with value (4 22) 1 with value (4 29)
% 0.19/0.53 ; 1 with value (4 14) 3 with value (4 23)
% 0.19/0.53 Evaluation took:
% 0.19/0.53 0.05 seconds of real time
% 0.19/0.53 0.044946 seconds of user run time
% 0.19/0.53 0.005269 seconds of system run time
% 0.19/0.53 0 calls to %EVAL
% 0.19/0.53 0 page faults and
% 0.19/0.53 3,832,968 bytes consed.
% 0.19/0.53 :PROOF-FOUND
% 0.19/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T08:01:29
% 0.19/0.53 :PROOF-FOUND
% 0.19/0.53 *
%------------------------------------------------------------------------------