%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP065-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:35:59 EDT 2022
% Result : Unsatisfiable 0.37s 0.62s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of clauses : 49 ( 46 unt; 0 nHn; 5 RR)
% Number of literals : 54 ( 53 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X,X),divide(X,divide(Y,divide(divide(divide(X,X),X),Z)))),Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(divide(Z,Z),Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(divide(Y,Y),X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
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)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(5,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(6,plain,
( divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1))
| inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,inverse,5,theory(equality)]) ).
cnf(7,plain,
divide(inverse(divide(X,divide(Y,divide(inverse(X),Z)))),Z) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(8,plain,
inverse(X) = divide(inverse(divide(Y,Y)),X),
inference('PARAMODULATE',[status(thm)],[inverse,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(inverse(divide(X,inverse(Y)))),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,inverse,theory(equality)]),8,theory(equality)]) ).
cnf(12,plain,
divide(inverse(divide(X,Y)),Z) = inverse(divide(U,divide(Y,divide(inverse(U),divide(inverse(X),Z))))),
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(13,plain,
inverse(X) = divide(inverse(inverse(divide(Y,Y))),X),
inference('PARAMODULATE',[status(thm)],[inverse,8,theory(equality)]) ).
cnf(14,plain,
inverse(X) = divide(inverse(inverse(inverse(divide(Y,Y)))),X),
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(18,plain,
divide(inverse(inverse(X)),Y) = inverse(inverse(divide(X,inverse(inverse(Y))))),
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(19,plain,
inverse(inverse(divide(divide(X,inverse(Y)),inverse(inverse(Y))))) = X,
inference('REWRITE',[status(thm)],[10,18,theory(equality)]) ).
cnf(28,plain,
inverse(inverse(divide(divide(X,Y),inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[19,19,theory(equality)]) ).
cnf(29,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('PARAMODULATE',[status(thm)],[28,inverse,theory(equality)]) ).
cnf(34,plain,
inverse(inverse(divide(X,inverse(Y)))) = inverse(divide(Z,divide(X,divide(inverse(Z),Y)))),
inference('PARAMODULATE',[status(thm)],[28,7,theory(equality)]) ).
cnf(35,plain,
divide(inverse(divide(X,Y)),Z) = inverse(inverse(divide(Y,inverse(divide(inverse(X),Z))))),
inference('REWRITE',[status(thm)],[12,34,theory(equality)]) ).
cnf(37,plain,
inverse(inverse(X)) = divide(divide(X,Y),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[29,28,theory(equality)]) ).
cnf(40,plain,
inverse(inverse(divide(X,Y))) = divide(inverse(inverse(X)),inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[37,37,theory(equality)]) ).
cnf(42,plain,
inverse(inverse(X)) = divide(divide(X,inverse(inverse(inverse(Y)))),Y),
inference('PARAMODULATE',[status(thm)],[37,29,theory(equality)]) ).
cnf(43,plain,
divide(X,X) = divide(inverse(Y),inverse(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,13,theory(equality)]),29,theory(equality)]) ).
cnf(44,plain,
( inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference('REWRITE',[status(thm)],[6,43,theory(equality)]) ).
cnf(46,plain,
divide(X,X) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[43,43,theory(equality)]) ).
cnf(47,plain,
inverse(divide(X,X)) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[inverse,46,theory(equality)]) ).
cnf(58,plain,
inverse(inverse(divide(inverse(inverse(X)),Y))) = divide(X,inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[29,18,theory(equality)]) ).
cnf(111,plain,
divide(inverse(divide(X,divide(Y,Y))),Z) = divide(inverse(X),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,inverse,theory(equality)]),29,theory(equality)]) ).
cnf(113,plain,
divide(inverse(divide(X,Y)),inverse(X)) = inverse(inverse(divide(Y,divide(Z,Z)))),
inference('PARAMODULATE',[status(thm)],[35,47,theory(equality)]) ).
cnf(115,plain,
divide(inverse(divide(inverse(inverse(inverse(X))),Y)),Z) = inverse(inverse(divide(Y,inverse(divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[35,29,theory(equality)]) ).
cnf(119,plain,
divide(inverse(divide(X,inverse(inverse(inverse(divide(Y,Y)))))),Z) = divide(inverse(X),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,14,theory(equality)]),29,theory(equality)]) ).
cnf(122,plain,
divide(inverse(divide(X,Y)),inverse(X)) = inverse(inverse(divide(Y,inverse(inverse(divide(Z,Z)))))),
inference('PARAMODULATE',[status(thm)],[35,47,theory(equality)]) ).
cnf(134,plain,
divide(inverse(inverse(X)),inverse(divide(Y,inverse(divide(inverse(Z),U))))) = inverse(inverse(divide(X,inverse(divide(inverse(divide(Z,Y)),U))))),
inference('PARAMODULATE',[status(thm)],[18,35,theory(equality)]) ).
cnf(144,plain,
inverse(inverse(X)) = divide(divide(X,inverse(inverse(divide(inverse(divide(Y,Z)),U)))),inverse(divide(Z,inverse(divide(inverse(Y),U))))),
inference('PARAMODULATE',[status(thm)],[42,35,theory(equality)]) ).
cnf(158,plain,
inverse(inverse(inverse(divide(X,divide(Y,Y))))) = inverse(inverse(inverse(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,111,theory(equality)]),37,theory(equality)]) ).
cnf(173,plain,
divide(inverse(inverse(inverse(X))),Y) = divide(inverse(X),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[111,42,theory(equality)]),119,theory(equality)]) ).
cnf(181,plain,
divide(inverse(divide(inverse(X),Y)),Z) = inverse(inverse(divide(Y,inverse(divide(X,Z))))),
inference('REWRITE',[status(thm)],[115,173,theory(equality)]) ).
cnf(183,plain,
inverse(inverse(divide(inverse(X),Y))) = divide(inverse(X),inverse(inverse(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[58,111,theory(equality)]),173,158,theory(equality)]) ).
cnf(192,plain,
inverse(inverse(divide(X,Y))) = inverse(inverse(divide(inverse(inverse(X)),Y))),
inference('REWRITE',[status(thm)],[40,183,theory(equality)]) ).
cnf(208,plain,
inverse(inverse(divide(X,Y))) = divide(X,inverse(inverse(Y))),
inference('REWRITE',[status(thm)],[58,192,theory(equality)]) ).
cnf(209,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[144,29,37,134,208,theory(equality)]) ).
cnf(211,plain,
divide(inverse(divide(X,Y)),inverse(X)) = divide(Y,divide(Z,Z)),
inference('REWRITE',[status(thm)],[113,209,theory(equality)]) ).
cnf(214,plain,
divide(inverse(divide(inverse(X),Y)),Z) = divide(Y,inverse(divide(X,Z))),
inference('REWRITE',[status(thm)],[181,209,theory(equality)]) ).
cnf(220,plain,
divide(inverse(divide(X,Y)),Z) = divide(Y,inverse(divide(inverse(X),Z))),
inference('REWRITE',[status(thm)],[35,209,theory(equality)]) ).
cnf(231,plain,
inverse(divide(X,divide(Y,Y))) = inverse(X),
inference('REWRITE',[status(thm)],[158,209,theory(equality)]) ).
cnf(232,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(inverse(divide(inverse(b3),a3)),inverse(c3)),
inference('REWRITE',[status(thm)],[44,214,209,theory(equality)]) ).
cnf(233,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[122,209,231,208,theory(equality)]) ).
cnf(234,plain,
X = divide(X,divide(Y,Y)),
inference('REWRITE',[status(thm)],[211,233,theory(equality)]) ).
cnf(242,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[220,234,theory(equality)]),209,234,theory(equality)]) ).
cnf(258,plain,
$false,
inference('REWRITE',[status(thm)],[232,242,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP065-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n027.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 : Mon Jun 13 22:23:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 *
% 0.18/0.47 *
% 0.18/0.47 #<PACKAGE "SNARK-USER">
% 0.18/0.47 *
% 0.18/0.47 SNARK-TPTP-OPTIONS
% 0.18/0.47 *
% 0.18/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.47 (USE-FACTORING :POS)
% 0.18/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47 *
% 0.18/0.47 "."
% 0.18/0.47 *
% 0.18/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:23:48
% 0.18/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-13T22:23:48
% 0.37/0.62
% 0.37/0.62
% 0.37/0.62 #||
% 0.37/0.62 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.62 % SZS output start Refutation
% See solution above
% 0.46/0.64 ||#
% 0.46/0.64
% 0.46/0.64 ; Summary of computation:
% 0.46/0.64 ; 1132 formulas have been input or derived (from 34 formulas).
% 0.46/0.64 ; 258 (23%) were retained. Of these,
% 0.46/0.64 ; 235 (91%) were simplified or subsumed later,
% 0.46/0.64 ; 23 ( 9%) are still being kept.
% 0.46/0.64 ;
% 0.46/0.64 ; Run time in seconds excluding printing time:
% 0.46/0.64 ; 0.001 1% Read assertion file (1 call)
% 0.46/0.64 ; 0.000 0% Assert (4 calls)
% 0.46/0.64 ; 0.015 10% Process new row (1,081 calls)
% 0.46/0.64 ; 0.001 1% Resolution (66 calls)
% 0.46/0.64 ; 0.017 11% Paramodulation (33 calls)
% 0.46/0.64 ; 0.000 0% Condensing (3 calls)
% 0.46/0.64 ; 0.000 0% Forward subsumption (3 calls)
% 0.46/0.64 ; 0.000 0% Backward subsumption (3 calls)
% 0.46/0.64 ; 0.039 26% Forward simplification (1,041 calls)
% 0.46/0.64 ; 0.022 15% Backward simplification (258 calls)
% 0.46/0.64 ; 0.026 17% Ordering (3,767 calls)
% 0.46/0.64 ; 0.001 1% Sortal reasoning (32 calls)
% 0.46/0.64 ; 0.000 0% Purity testing (1 call)
% 0.46/0.64 ; 0.029 19% Other
% 0.46/0.64 ; 0.151 Total
% 0.46/0.64 ; 0.162 Real time
% 0.46/0.64 ;
% 0.46/0.64 ; Term-hash-array has 804 terms in all.
% 0.46/0.64 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.46/0.64 ; Feature-vector-row-index has 1 node (30 at peak, 76 added, 75 deleted).
% 0.46/0.64 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.46/0.64 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.46/0.64 ; Path-index has 98 entries (542 at peak, 969 added, 871 deleted).
% 0.46/0.64 ; Path-index has 1,074 nodes (1,474 at peak, 1,929 added, 855 deleted).
% 0.46/0.64 ; Trie-index has 98 entries (542 at peak, 969 added, 871 deleted).
% 0.46/0.64 ; Trie-index has 307 nodes (2,422 at peak, 4,047 added, 3,740 deleted).
% 0.46/0.64 ; Retrieved 3,879 generalization terms in 9,199 calls.
% 0.46/0.64 ; Retrieved 1,061 instance terms in 441 calls.
% 0.46/0.64 ; Retrieved 1,508 unifiable terms in 273 calls.
% 0.46/0.64 ;
% 0.46/0.64 ; The agenda of rows to process has 31 entries:
% 0.46/0.64 ; 2 with value 27 9 with value 30 2 with value 32
% 0.46/0.64 ; 10 with value 28 2 with value 31 4 with value 33
% 0.46/0.64 ; 2 with value 29
% 0.46/0.64 ; The agenda of rows to give has 16 entries:
% 0.46/0.64 ; 1 with value (4 17) 1 with value (4 22) 2 with value (4 26)
% 0.46/0.64 ; 2 with value (4 20) 3 with value (4 23) 3 with value (4 27)
% 0.46/0.64 ; 1 with value (4 21) 2 with value (4 24) 1 with value (4 28)
% 0.46/0.64 Evaluation took:
% 0.46/0.64 0.162 seconds of real time
% 0.46/0.64 0.143072 seconds of user run time
% 0.46/0.64 0.018979 seconds of system run time
% 0.46/0.64 [Run times include 0.006 seconds GC run time.]
% 0.46/0.64 0 calls to %EVAL
% 0.46/0.64 0 page faults and
% 0.46/0.64 13,445,240 bytes consed.
% 0.46/0.64 :PROOF-FOUND
% 0.46/0.64 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:23:48
% 0.46/0.64 :PROOF-FOUND
% 0.46/0.64 *
%------------------------------------------------------------------------------