%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP066-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 26 equ; 7 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,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(identity,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(identity,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = divide(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(6,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
( 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,identity,6,theory(equality)]) ).
cnf(8,plain,
divide(inverse(divide(X,divide(Y,divide(inverse(X),Z)))),Z) = Y,
inference('REWRITE',[status(thm)],[single_axiom,identity,inverse,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(divide(X,identity)),Y) = divide(inverse(X),Y),
inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]) ).
cnf(11,plain,
divide(inverse(divide(X,divide(Y,identity))),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]) ).
cnf(13,plain,
divide(inverse(inverse(divide(X,inverse(Y)))),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(19,plain,
inverse(X) = inverse(divide(X,identity)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,10,theory(equality)]),8,theory(equality)]) ).
cnf(21,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),inverse,19,9,theory(equality)]) ).
cnf(23,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[13,21,theory(equality)]) ).
cnf(24,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[7,21,theory(equality)]) ).
cnf(25,plain,
divide(X,identity) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,inverse,theory(equality)]),9,21,19,theory(equality)]) ).
cnf(27,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[11,25,theory(equality)]) ).
cnf(30,plain,
divide(inverse(divide(X,Y)),Z) = divide(Y,inverse(divide(inverse(X),Z))),
inference('PARAMODULATE',[status(thm)],[8,23,theory(equality)]) ).
cnf(31,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[23,27,theory(equality)]) ).
cnf(33,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[24,31,theory(equality)]) ).
cnf(35,plain,
divide(divide(X,Y),Z) = divide(X,divide(Z,inverse(Y))),
inference('REWRITE',[status(thm)],[30,31,theory(equality)]) ).
cnf(40,plain,
divide(divide(X,inverse(Y)),Z) = divide(X,divide(Z,Y)),
inference('PARAMODULATE',[status(thm)],[35,21,theory(equality)]) ).
cnf(41,plain,
$false,
inference('REWRITE',[status(thm)],[33,40,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP066-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.14/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 04:49:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T04:49:44
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-13T04:49:44
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 #||
% 0.21/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.52 % SZS output start Refutation
% See solution above
% 0.21/0.53 ||#
% 0.21/0.53
% 0.21/0.53 ; Summary of computation:
% 0.21/0.53 ; 159 formulas have been input or derived (from 20 formulas).
% 0.21/0.53 ; 41 (26%) were retained. Of these,
% 0.21/0.53 ; 24 (59%) were simplified or subsumed later,
% 0.21/0.53 ; 17 (41%) are still being kept.
% 0.21/0.53 ;
% 0.21/0.53 ; Run time in seconds excluding printing time:
% 0.21/0.53 ; 0.002 5% Read assertion file (1 call)
% 0.21/0.53 ; 0.000 0% Assert (5 calls)
% 0.21/0.53 ; 0.004 9% Process new row (137 calls)
% 0.21/0.53 ; 0.002 5% Resolution (38 calls)
% 0.21/0.53 ; 0.005 12% Paramodulation (19 calls)
% 0.21/0.53 ; 0.000 0% Condensing (2 calls)
% 0.21/0.53 ; 0.000 0% Forward subsumption (2 calls)
% 0.21/0.53 ; 0.000 0% Backward subsumption (2 calls)
% 0.21/0.53 ; 0.004 9% Forward simplification (123 calls)
% 0.21/0.53 ; 0.003 7% Backward simplification (41 calls)
% 0.21/0.53 ; 0.000 0% Ordering (311 calls)
% 0.21/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.21/0.53 ; 0.000 0% Purity testing (1 call)
% 0.21/0.53 ; 0.023 53% Other
% 0.21/0.53 ; 0.043 Total
% 0.21/0.53 ; 0.047 Real time
% 0.21/0.53 ;
% 0.21/0.53 ; Term-hash-array has 157 terms in all.
% 0.21/0.53 ; Feature-vector-row-index has 0 entries (1 at peak, 2 added, 2 deleted).
% 0.21/0.53 ; Feature-vector-row-index has 1 node (26 at peak, 46 added, 45 deleted).
% 0.21/0.53 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.21/0.53 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.21/0.53 ; Path-index has 57 entries (79 at peak, 195 added, 138 deleted).
% 0.21/0.53 ; Path-index has 334 nodes (378 at peak, 576 added, 242 deleted).
% 0.21/0.53 ; Trie-index has 57 entries (79 at peak, 195 added, 138 deleted).
% 0.21/0.53 ; Trie-index has 192 nodes (321 at peak, 726 added, 534 deleted).
% 0.21/0.53 ; Retrieved 325 generalization terms in 534 calls.
% 0.21/0.53 ; Retrieved 90 instance terms in 44 calls.
% 0.21/0.53 ; Retrieved 332 unifiable terms in 138 calls.
% 0.21/0.53 ;
% 0.21/0.53 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.21/0.53 ; 1 with value 0
% 0.21/0.53 ; The agenda of rows to process has 21 entries:
% 0.21/0.53 ; 4 with value 20 2 with value 23 4 with value 25
% 0.21/0.53 ; 3 with value 21 3 with value 24 1 with value 26
% 0.21/0.53 ; 4 with value 22
% 0.21/0.53 ; The agenda of rows to give has 6 entries:
% 0.21/0.53 ; 2 with value (4 18) 1 with value (4 21) 2 with value (4 24)
% 0.21/0.53 ; 1 with value (4 19)
% 0.21/0.53 Evaluation took:
% 0.21/0.53 0.048 seconds of real time
% 0.21/0.53 0.043691 seconds of user run time
% 0.21/0.53 0.003847 seconds of system run time
% 0.21/0.53 0 calls to %EVAL
% 0.21/0.53 0 page faults and
% 0.21/0.53 3,950,904 bytes consed.
% 0.21/0.53 :PROOF-FOUND
% 0.21/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T04:49:44
% 0.21/0.53 :PROOF-FOUND
% 0.21/0.53 *
%------------------------------------------------------------------------------