TSTP Solution File: GRP597-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP597-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n012.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:35 EDT 2022
% Result : Unsatisfiable 0.37s 0.60s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 4 RR)
% Number of literals : 28 ( 27 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(inverse(Z),Y))))) = Z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference('REWRITE',[status(thm)],[prove_these_axioms_1,multiply,theory(equality)]) ).
cnf(5,plain,
double_divide(double_divide(double_divide(inverse(X),Y),inverse(double_divide(inverse(Z),Y))),inverse(Z)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
double_divide(X,inverse(double_divide(double_divide(Y,Z),inverse(double_divide(inverse(U),inverse(double_divide(Y,inverse(double_divide(inverse(X),Z))))))))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(21,plain,
double_divide(X,inverse(double_divide(inverse(Y),inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(38,plain,
double_divide(double_divide(X,inverse(X)),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(39,plain,
double_divide(double_divide(inverse(X),inverse(inverse(Y))),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[21,21,theory(equality)]) ).
cnf(54,plain,
double_divide(inverse(X),inverse(double_divide(Y,inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[21,38,theory(equality)]) ).
cnf(55,plain,
double_divide(double_divide(double_divide(X,inverse(X)),Y),inverse(double_divide(inverse(Z),Y))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,38,theory(equality)]) ).
cnf(61,plain,
double_divide(X,inverse(Y)) = double_divide(inverse(Y),inverse(inverse(X))),
inference('PARAMODULATE',[status(thm)],[5,39,theory(equality)]) ).
cnf(74,plain,
double_divide(double_divide(X,inverse(Y)),inverse(Y)) = X,
inference('REWRITE',[status(thm)],[39,61,theory(equality)]) ).
cnf(75,plain,
double_divide(X,inverse(X)) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[74,38,theory(equality)]) ).
cnf(89,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(X,inverse(X))),
inference('PARAMODULATE',[status(thm)],[4,75,theory(equality)]) ).
cnf(91,plain,
double_divide(double_divide(X,inverse(inverse(Y))),inverse(double_divide(X,inverse(double_divide(Z,inverse(Z)))))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,75,theory(equality)]) ).
cnf(94,plain,
double_divide(X,inverse(double_divide(Y,inverse(Y)))) = inverse(X),
inference('PARAMODULATE',[status(thm)],[74,54,theory(equality)]) ).
cnf(96,plain,
double_divide(double_divide(X,inverse(inverse(Y))),inverse(inverse(X))) = Y,
inference('REWRITE',[status(thm)],[91,94,theory(equality)]) ).
cnf(98,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[54,94,theory(equality)]) ).
cnf(111,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[96,98,theory(equality)]) ).
cnf(114,plain,
double_divide(inverse(X),X) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[75,98,theory(equality)]) ).
cnf(116,plain,
double_divide(double_divide(X,inverse(X)),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[38,98,theory(equality)]) ).
cnf(118,plain,
double_divide(inverse(X),inverse(double_divide(inverse(Y),X))) = Y,
inference('REWRITE',[status(thm)],[55,116,theory(equality)]) ).
cnf(128,plain,
double_divide(inverse(X),X) = double_divide(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[114,114,theory(equality)]) ).
cnf(161,plain,
double_divide(inverse(X),inverse(double_divide(Y,X))) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[118,98,theory(equality)]) ).
cnf(162,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[111,161,theory(equality)]) ).
cnf(199,plain,
double_divide(inverse(X),Y) = inverse(double_divide(X,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[162,98,theory(equality)]) ).
cnf(202,plain,
$false,
inference('REWRITE',[status(thm)],[89,128,199,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP597-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 04:14:41 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T04:14:41
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-13T04:14:41
% 0.37/0.60
% 0.37/0.60
% 0.37/0.60 #||
% 0.37/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.60 % SZS output start Refutation
% See solution above
% 0.37/0.61 ||#
% 0.37/0.61
% 0.37/0.61 ; Summary of computation:
% 0.37/0.61 ; 516 formulas have been input or derived (from 28 formulas).
% 0.37/0.61 ; 202 (39%) were retained. Of these,
% 0.37/0.61 ; 143 (71%) were simplified or subsumed later,
% 0.37/0.61 ; 59 (29%) are still being kept.
% 0.37/0.61 ;
% 0.37/0.61 ; Run time in seconds excluding printing time:
% 0.37/0.61 ; 0.001 1% Read assertion file (1 call)
% 0.37/0.61 ; 0.000 0% Assert (3 calls)
% 0.37/0.61 ; 0.031 27% Process new row (493 calls)
% 0.37/0.61 ; 0.000 0% Resolution (54 calls)
% 0.37/0.61 ; 0.015 13% Paramodulation (27 calls)
% 0.37/0.61 ; 0.015 13% Forward simplification (422 calls)
% 0.37/0.61 ; 0.024 21% Backward simplification (201 calls)
% 0.37/0.61 ; 0.004 3% Ordering (1,060 calls)
% 0.37/0.61 ; 0.001 1% Sortal reasoning (32 calls)
% 0.37/0.61 ; 0.000 0% Purity testing (1 call)
% 0.37/0.61 ; 0.024 21% Other
% 0.37/0.61 ; 0.115 Total
% 0.37/0.61 ; 0.117 Real time
% 0.37/0.61 ;
% 0.37/0.61 ; Term-hash-array has 1,205 terms in all.
% 0.37/0.61 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.37/0.61 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.37/0.61 ; Path-index has 313 entries (545 at peak, 1,372 added, 1,059 deleted).
% 0.37/0.61 ; Path-index has 3,260 nodes (3,260 at peak, 4,503 added, 1,243 deleted).
% 0.37/0.61 ; Trie-index has 313 entries (545 at peak, 1,372 added, 1,059 deleted).
% 0.37/0.61 ; Trie-index has 1,707 nodes (3,553 at peak, 7,837 added, 6,130 deleted).
% 0.37/0.61 ; Retrieved 1,640 generalization terms in 2,733 calls.
% 0.37/0.61 ; Retrieved 1,352 instance terms in 204 calls.
% 0.37/0.61 ; Retrieved 3,714 unifiable terms in 207 calls.
% 0.37/0.61 ;
% 0.37/0.61 ; The agenda of rows to process has 2 entries:
% 0.37/0.61 ; 2 with value 22
% 0.37/0.61 ; The agenda of rows to give has 45 entries:
% 0.37/0.61 ; 1 with value (4 19) 1 with value (4 28) 1 with value (4 36)
% 0.37/0.61 ; 2 with value (4 20) 2 with value (4 29) 2 with value (4 37)
% 0.37/0.61 ; 3 with value (4 21) 2 with value (4 30) 1 with value (4 38)
% 0.37/0.61 ; 1 with value (4 22) 4 with value (4 31) 1 with value (4 39)
% 0.37/0.61 ; 1 with value (4 23) 2 with value (4 32) 1 with value (4 40)
% 0.37/0.61 ; 4 with value (4 24) 1 with value (4 33) 1 with value (4 41)
% 0.37/0.61 ; 1 with value (4 25) 2 with value (4 34) 2 with value (4 42)
% 0.37/0.61 ; 3 with value (4 26) 2 with value (4 35) 1 with value (4 43)
% 0.37/0.61 ; 3 with value (4 27)
% 0.37/0.61 Evaluation took:
% 0.37/0.61 0.118 seconds of real time
% 0.37/0.61 0.100739 seconds of user run time
% 0.37/0.61 0.017092 seconds of system run time
% 0.37/0.61 0 calls to %EVAL
% 0.37/0.61 0 page faults and
% 0.37/0.61 10,027,216 bytes consed.
% 0.37/0.61 :PROOF-FOUND
% 0.37/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T04:14:41
% 0.37/0.61 :PROOF-FOUND
% 0.37/0.61 *
%------------------------------------------------------------------------------