%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP543-1 : TPTP v8.1.0. Released v2.6.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:39:21 EDT 2022
% Result : Unsatisfiable 0.35s 0.53s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 7 RR)
% Number of literals : 28 ( 27 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(divide(divide(X,Y),Z),X)),Z) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(identity,Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(identity,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = divide(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(6,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,6,theory(equality)]) ).
cnf(8,plain,
divide(inverse(divide(divide(divide(X,Y),Z),X)),Z) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(inverse(X)),divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(11,plain,
divide(inverse(divide(inverse(X),Y)),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(14,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,9,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(15,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[10,14,theory(equality)]) ).
cnf(18,plain,
divide(inverse(divide(X,Y)),divide(divide(Y,Z),X)) = Z,
inference('PARAMODULATE',[status(thm)],[8,15,theory(equality)]) ).
cnf(21,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[11,15,theory(equality)]) ).
cnf(25,plain,
divide(X,Y) = divide(inverse(Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[21,14,theory(equality)]) ).
cnf(27,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[25,14,theory(equality)]) ).
cnf(28,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(divide(c3,inverse(b3)),inverse(a3)),
inference('REWRITE',[status(thm)],[7,27,theory(equality)]) ).
cnf(30,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,identity,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(32,plain,
divide(inverse(divide(X,Y)),Z) = divide(divide(Y,Z),X),
inference('PARAMODULATE',[status(thm)],[15,18,theory(equality)]) ).
cnf(33,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[28,25,32,theory(equality)]) ).
cnf(35,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[14,30,theory(equality)]) ).
cnf(37,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[35,15,theory(equality)]) ).
cnf(38,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[32,37,theory(equality)]) ).
cnf(40,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[27,37,theory(equality)]) ).
cnf(41,plain,
divide(c3,divide(inverse(a3),b3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[33,40,theory(equality)]) ).
cnf(49,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,38,theory(equality)]),37,theory(equality)]) ).
cnf(50,plain,
$false,
inference('REWRITE',[status(thm)],[41,49,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP543-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n010.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 16:51:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T16:51:24
% 0.20/0.47 ; 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-13T16:51:24
% 0.35/0.53
% 0.35/0.53
% 0.35/0.53 #||
% 0.35/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.53 % SZS output start Refutation
% See solution above
% 0.35/0.53 ||#
% 0.35/0.53
% 0.35/0.53 ; Summary of computation:
% 0.35/0.53 ; 360 formulas have been input or derived (from 27 formulas).
% 0.35/0.53 ; 50 (14%) were retained. Of these,
% 0.35/0.53 ; 26 (52%) were simplified or subsumed later,
% 0.35/0.53 ; 24 (48%) are still being kept.
% 0.35/0.53 ;
% 0.35/0.53 ; Run time in seconds excluding printing time:
% 0.35/0.53 ; 0.002 4% Read assertion file (1 call)
% 0.35/0.53 ; 0.000 0% Assert (5 calls)
% 0.35/0.53 ; 0.003 6% Process new row (332 calls)
% 0.35/0.53 ; 0.000 0% Resolution (52 calls)
% 0.35/0.53 ; 0.007 13% Paramodulation (26 calls)
% 0.35/0.53 ; 0.006 11% Forward simplification (272 calls)
% 0.35/0.53 ; 0.003 6% Backward simplification (50 calls)
% 0.35/0.53 ; 0.006 11% Ordering (824 calls)
% 0.35/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.35/0.53 ; 0.000 0% Purity testing (1 call)
% 0.35/0.53 ; 0.027 50% Other
% 0.35/0.53 ; 0.054 Total
% 0.35/0.53 ; 0.058 Real time
% 0.35/0.53 ;
% 0.35/0.53 ; Term-hash-array has 148 terms in all.
% 0.35/0.53 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.35/0.53 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.35/0.53 ; Path-index has 65 entries (74 at peak, 183 added, 118 deleted).
% 0.35/0.53 ; Path-index has 232 nodes (252 at peak, 431 added, 199 deleted).
% 0.35/0.53 ; Trie-index has 65 entries (74 at peak, 183 added, 118 deleted).
% 0.35/0.53 ; Trie-index has 189 nodes (217 at peak, 620 added, 431 deleted).
% 0.35/0.53 ; Retrieved 1,059 generalization terms in 1,360 calls.
% 0.35/0.53 ; Retrieved 162 instance terms in 60 calls.
% 0.35/0.53 ; Retrieved 578 unifiable terms in 180 calls.
% 0.35/0.53 ;
% 0.35/0.53 ; The agenda of rows to process has 18 entries:
% 0.35/0.53 ; 10 with value 22 6 with value 23 2 with value 24
% 0.35/0.53 ; The agenda of rows to give has 10 entries:
% 0.35/0.53 ; 1 with value (4 17) 2 with value (4 20) 1 with value (4 22)
% 0.35/0.53 ; 1 with value (4 18) 5 with value (4 21)
% 0.35/0.53 Evaluation took:
% 0.35/0.53 0.058 seconds of real time
% 0.35/0.53 0.046819 seconds of user run time
% 0.35/0.53 0.011148 seconds of system run time
% 0.35/0.53 0 calls to %EVAL
% 0.35/0.53 0 page faults and
% 0.35/0.53 4,487,992 bytes consed.
% 0.35/0.53 :PROOF-FOUND
% 0.35/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T16:51:25
% 0.35/0.53 :PROOF-FOUND
% 0.35/0.53 *
%------------------------------------------------------------------------------