%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP107-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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:36:11 EDT 2022
% Result : Unsatisfiable 0.48s 0.67s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 46 ( 39 unt; 0 nHn; 10 RR)
% Number of literals : 62 ( 61 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 85 ( 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/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(4,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,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(8,plain,
double_divide(X,inverse(double_divide(double_divide(double_divide(inverse(X),Y),inverse(double_divide(inverse(Z),Y))),inverse(double_divide(inverse(U),inverse(Z)))))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,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(41,plain,
double_divide(X,inverse(double_divide(Y,inverse(double_divide(inverse(Z),inverse(double_divide(inverse(X),inverse(Y)))))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,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(76,plain,
double_divide(X,inverse(double_divide(inverse(X),inverse(Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[8,74,theory(equality)]) ).
cnf(90,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(93,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(a2,inverse(double_divide(X,inverse(X))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('PARAMODULATE',[status(thm)],[4,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(95,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(inverse(a2)) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[93,94,theory(equality)]) ).
cnf(97,plain,
double_divide(double_divide(X,inverse(inverse(Y))),inverse(inverse(X))) = Y,
inference('REWRITE',[status(thm)],[90,94,theory(equality)]) ).
cnf(99,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[54,94,theory(equality)]) ).
cnf(112,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[97,99,theory(equality)]) ).
cnf(114,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[95,99,theory(equality)]) ).
cnf(115,plain,
double_divide(double_divide(X,Y),Y) = X,
inference('PARAMODULATE',[status(thm)],[74,99,theory(equality)]) ).
cnf(116,plain,
double_divide(inverse(X),X) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[75,99,theory(equality)]) ).
cnf(118,plain,
double_divide(double_divide(X,inverse(X)),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[38,99,theory(equality)]) ).
cnf(120,plain,
double_divide(inverse(X),inverse(double_divide(inverse(Y),X))) = Y,
inference('REWRITE',[status(thm)],[55,118,theory(equality)]) ).
cnf(126,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[115,112,theory(equality)]) ).
cnf(130,plain,
double_divide(inverse(X),X) = double_divide(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[116,116,theory(equality)]) ).
cnf(133,plain,
double_divide(X,Y) = inverse(double_divide(inverse(Y),inverse(X))),
inference('PARAMODULATE',[status(thm)],[112,76,theory(equality)]) ).
cnf(159,plain,
double_divide(X,inverse(double_divide(Y,inverse(double_divide(inverse(Z),double_divide(Y,X)))))) = Z,
inference('REWRITE',[status(thm)],[41,133,theory(equality)]) ).
cnf(163,plain,
double_divide(inverse(X),inverse(double_divide(Y,X))) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[120,99,theory(equality)]) ).
cnf(164,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[112,163,theory(equality)]) ).
cnf(172,plain,
inverse(double_divide(X,Y)) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[126,164,theory(equality)]),164,theory(equality)]) ).
cnf(173,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)) ),
inference('REWRITE',[status(thm)],[114,172,theory(equality)]) ).
cnf(178,plain,
double_divide(X,inverse(Y)) = inverse(double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[164,99,theory(equality)]) ).
cnf(195,plain,
double_divide(X,double_divide(inverse(Y),double_divide(inverse(Z),double_divide(Y,X)))) = Z,
inference('REWRITE',[status(thm)],[159,99,164,178,theory(equality)]) ).
cnf(202,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(double_divide(c3,b3),inverse(a3)) ),
inference('REWRITE',[status(thm)],[173,99,178,theory(equality)]) ).
cnf(203,plain,
double_divide(inverse(X),Y) = inverse(double_divide(X,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[164,99,theory(equality)]) ).
cnf(206,plain,
double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('REWRITE',[status(thm)],[202,130,203,theory(equality)]) ).
cnf(233,plain,
double_divide(X,Y) = double_divide(inverse(Z),double_divide(inverse(X),double_divide(Z,Y))),
inference('PARAMODULATE',[status(thm)],[112,195,theory(equality)]) ).
cnf(241,plain,
double_divide(inverse(c3),double_divide(a3,b3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('PARAMODULATE',[status(thm)],[206,126,theory(equality)]) ).
cnf(308,plain,
double_divide(double_divide(X,Y),inverse(Z)) = double_divide(inverse(X),double_divide(Z,Y)),
inference('PARAMODULATE',[status(thm)],[112,233,theory(equality)]) ).
cnf(309,plain,
$false,
inference('REWRITE',[status(thm)],[241,308,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP107-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 04:23:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T04:23:24
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-14T04:23:24
% 0.48/0.67
% 0.48/0.67
% 0.48/0.67 #||
% 0.48/0.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.67 % SZS output start Refutation
% See solution above
% 0.48/0.67 ||#
% 0.48/0.67
% 0.48/0.67 ; Summary of computation:
% 0.48/0.67 ; 1320 formulas have been input or derived (from 41 formulas).
% 0.48/0.67 ; 309 (23%) were retained. Of these,
% 0.48/0.67 ; 186 (60%) were simplified or subsumed later,
% 0.48/0.67 ; 123 (40%) are still being kept.
% 0.48/0.67 ;
% 0.48/0.67 ; Run time in seconds excluding printing time:
% 0.48/0.67 ; 0.002 1% Read assertion file (1 call)
% 0.48/0.67 ; 0.000 0% Assert (3 calls)
% 0.48/0.67 ; 0.041 20% Process new row (1,204 calls)
% 0.48/0.67 ; 0.001 0% Resolution (80 calls)
% 0.48/0.67 ; 0.023 11% Paramodulation (40 calls)
% 0.48/0.67 ; 0.000 0% Condensing (6 calls)
% 0.48/0.67 ; 0.000 0% Forward subsumption (6 calls)
% 0.48/0.67 ; 0.001 0% Backward subsumption (6 calls)
% 0.48/0.67 ; 0.000 0% Clause clause subsumption (1 call)
% 0.48/0.67 ; 0.031 15% Forward simplification (908 calls)
% 0.48/0.67 ; 0.043 21% Backward simplification (308 calls)
% 0.48/0.67 ; 0.037 18% Ordering (6,158 calls)
% 0.48/0.67 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.67 ; 0.000 0% Purity testing (1 call)
% 0.48/0.67 ; 0.026 13% Other
% 0.48/0.67 ; 0.205 Total
% 0.48/0.67 ; 0.210 Real time
% 0.48/0.67 ;
% 0.48/0.67 ; Term-hash-array has 1,513 terms in all.
% 0.48/0.67 ; Feature-vector-row-index has 0 entries (1 at peak, 6 added, 6 deleted).
% 0.48/0.67 ; Feature-vector-row-index has 1 node (36 at peak, 175 added, 174 deleted).
% 0.48/0.67 ; Retrieved 0 possibly forward subsuming rows in 6 calls.
% 0.48/0.67 ; Retrieved 1 possibly backward subsumed row in 6 calls.
% 0.48/0.67 ; Path-index has 427 entries (572 at peak, 1,841 added, 1,414 deleted).
% 0.48/0.67 ; Path-index has 3,457 nodes (3,495 at peak, 5,314 added, 1,857 deleted).
% 0.48/0.67 ; Trie-index has 427 entries (572 at peak, 1,841 added, 1,414 deleted).
% 0.48/0.67 ; Trie-index has 1,913 nodes (3,634 at peak, 9,689 added, 7,776 deleted).
% 0.48/0.67 ; Retrieved 5,696 generalization terms in 6,252 calls.
% 0.48/0.67 ; Retrieved 2,740 instance terms in 395 calls.
% 0.48/0.67 ; Retrieved 5,730 unifiable terms in 338 calls.
% 0.48/0.67 ;
% 0.48/0.67 ; The agenda of backward simplifiable rows to process has 5 entries:
% 0.48/0.67 ; 5 with value 0
% 0.48/0.67 ; The agenda of rows to process has 53 entries:
% 0.48/0.67 ; 2 with value 23 5 with value 28 4 with value 31
% 0.48/0.67 ; 15 with value 24 2 with value 29 4 with value 32
% 0.48/0.67 ; 1 with value 25 7 with value 30 2 with value 33
% 0.48/0.67 ; 11 with value 27
% 0.48/0.67 ; The agenda of rows to give has 101 entries:
% 0.48/0.67 ; 1 with value (4 21) 14 with value (4 28) 1 with value (4 36)
% 0.48/0.67 ; 7 with value (4 23) 27 with value (4 29) 1 with value (4 38)
% 0.48/0.67 ; 5 with value (4 24) 1 with value (4 30) 1 with value (4 39)
% 0.48/0.67 ; 6 with value (4 25) 3 with value (4 31) 1 with value (4 40)
% 0.48/0.67 ; 12 with value (4 26) 2 with value (4 34) 1 with value (4 41)
% 0.48/0.67 ; 15 with value (4 27) 2 with value (4 35) 1 with value (4 42)
% 0.48/0.67 Evaluation took:
% 0.48/0.67 0.21 seconds of real time
% 0.48/0.67 0.175829 seconds of user run time
% 0.48/0.67 0.034791 seconds of system run time
% 0.48/0.67 [Run times include 0.008 seconds GC run time.]
% 0.48/0.67 0 calls to %EVAL
% 0.48/0.67 0 page faults and
% 0.48/0.67 17,620,024 bytes consed.
% 0.48/0.67 :PROOF-FOUND
% 0.48/0.67 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T04:23:25
% 0.48/0.67 :PROOF-FOUND
% 0.48/0.67 *
%------------------------------------------------------------------------------