%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP563-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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:26 EDT 2022
% Result : Unsatisfiable 0.15s 0.45s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 7 RR)
% Number of literals : 29 ( 28 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X,inverse(Y)),Z),divide(X,Z)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,multiply,theory(equality)]) ).
cnf(5,plain,
divide(X,divide(divide(Y,inverse(X)),divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
divide(divide(divide(divide(divide(X,inverse(Y)),Z),inverse(U)),divide(X,Z)),Y) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(9,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(18,plain,
divide(X,divide(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,9,theory(equality)]) ).
cnf(19,plain,
divide(X,divide(inverse(Y),inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[9,9,theory(equality)]) ).
cnf(20,plain,
divide(divide(X,Y),divide(divide(inverse(Z),inverse(X)),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,9,theory(equality)]) ).
cnf(27,plain,
divide(divide(X,X),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[9,18,theory(equality)]) ).
cnf(30,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,27,theory(equality)]),27,theory(equality)]) ).
cnf(31,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,27,theory(equality)]),30,theory(equality)]) ).
cnf(36,plain,
divide(divide(X,X),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[30,27,theory(equality)]) ).
cnf(39,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[27,36,theory(equality)]) ).
cnf(51,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[9,39,theory(equality)]) ).
cnf(55,plain,
divide(X,Y) = divide(inverse(Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[30,19,theory(equality)]) ).
cnf(58,plain,
divide(divide(X,Y),divide(divide(X,Z),Y)) = Z,
inference('REWRITE',[status(thm)],[20,55,theory(equality)]) ).
cnf(62,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[51,30,theory(equality)]) ).
cnf(63,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[4,62,theory(equality)]) ).
cnf(65,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[31,51,theory(equality)]) ).
cnf(66,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[63,65,theory(equality)]) ).
cnf(69,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[55,39,theory(equality)]) ).
cnf(70,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[66,69,theory(equality)]) ).
cnf(71,plain,
divide(X,divide(Y,Z)) = divide(divide(Z,Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[55,62,theory(equality)]) ).
cnf(86,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[70,71,theory(equality)]) ).
cnf(88,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('PARAMODULATE',[status(thm)],[30,58,theory(equality)]) ).
cnf(113,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[62,88,theory(equality)]),62,theory(equality)]) ).
cnf(118,plain,
$false,
inference('REWRITE',[status(thm)],[86,65,113,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP563-1 : TPTP v8.1.0. Released v2.6.0.
% 0.05/0.10 % Command : run-snark %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon Jun 13 17:25:57 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.38 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39 *
% 0.15/0.39 *
% 0.15/0.40 #<PACKAGE "SNARK-USER">
% 0.15/0.40 *
% 0.15/0.40 SNARK-TPTP-OPTIONS
% 0.15/0.40 *
% 0.15/0.40 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.40 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.40 (USE-FACTORING :POS)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.40 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.40 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.40 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.40 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.40 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.40 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.40 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.40 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.40 *
% 0.15/0.40 "."
% 0.15/0.40 *
% 0.15/0.40 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T17:25:57
% 0.15/0.40 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-13T17:25:57
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45 #||
% 0.15/0.45 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.45 % SZS output start Refutation
% See solution above
% 0.15/0.46 ||#
% 0.15/0.46
% 0.15/0.46 ; Summary of computation:
% 0.15/0.46 ; 488 formulas have been input or derived (from 28 formulas).
% 0.15/0.46 ; 118 (24%) were retained. Of these,
% 0.15/0.46 ; 84 (71%) were simplified or subsumed later,
% 0.15/0.46 ; 34 (29%) are still being kept.
% 0.15/0.46 ;
% 0.15/0.46 ; Run time in seconds excluding printing time:
% 0.15/0.46 ; 0.001 2% Read assertion file (1 call)
% 0.15/0.46 ; 0.000 0% Assert (3 calls)
% 0.15/0.46 ; 0.012 21% Process new row (442 calls)
% 0.15/0.46 ; 0.001 2% Resolution (54 calls)
% 0.15/0.46 ; 0.002 4% Paramodulation (27 calls)
% 0.15/0.46 ; 0.010 18% Forward simplification (395 calls)
% 0.15/0.46 ; 0.011 20% Backward simplification (117 calls)
% 0.15/0.46 ; 0.004 7% Ordering (1,279 calls)
% 0.15/0.46 ; 0.000 0% Sortal reasoning (32 calls)
% 0.15/0.46 ; 0.000 0% Purity testing (1 call)
% 0.15/0.46 ; 0.015 27% Other
% 0.15/0.46 ; 0.056 Total
% 0.15/0.46 ; 0.059 Real time
% 0.15/0.46 ;
% 0.15/0.46 ; Term-hash-array has 495 terms in all.
% 0.15/0.46 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.15/0.46 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.15/0.46 ; Path-index has 121 entries (180 at peak, 556 added, 435 deleted).
% 0.15/0.46 ; Path-index has 622 nodes (729 at peak, 1,116 added, 494 deleted).
% 0.15/0.46 ; Trie-index has 121 entries (180 at peak, 556 added, 435 deleted).
% 0.15/0.46 ; Trie-index has 435 nodes (852 at peak, 2,206 added, 1,771 deleted).
% 0.15/0.46 ; Retrieved 2,084 generalization terms in 2,344 calls.
% 0.15/0.46 ; Retrieved 854 instance terms in 122 calls.
% 0.15/0.46 ; Retrieved 2,128 unifiable terms in 196 calls.
% 0.15/0.46 ;
% 0.15/0.46 ; The agenda of rows to process has 35 entries:
% 0.15/0.46 ; 9 with value 23 8 with value 25 4 with value 28
% 0.15/0.46 ; 10 with value 24 4 with value 26
% 0.15/0.46 ; The agenda of rows to give has 20 entries:
% 0.15/0.46 ; 2 with value (4 20) 1 with value (4 24) 1 with value (4 28)
% 0.15/0.46 ; 2 with value (4 21) 1 with value (4 25) 1 with value (4 31)
% 0.15/0.46 ; 4 with value (4 22) 2 with value (4 26) 1 with value (4 33)
% 0.15/0.46 ; 3 with value (4 23) 2 with value (4 27)
% 0.15/0.46 Evaluation took:
% 0.15/0.46 0.059 seconds of real time
% 0.15/0.46 0.049566 seconds of user run time
% 0.15/0.46 0.009119 seconds of system run time
% 0.15/0.46 0 calls to %EVAL
% 0.15/0.46 0 page faults and
% 0.15/0.46 6,665,936 bytes consed.
% 0.15/0.46 :PROOF-FOUND
% 0.15/0.46 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T17:25:57
% 0.15/0.46 :PROOF-FOUND
% 0.15/0.46 *
%------------------------------------------------------------------------------