%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP088-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:06 EDT 2022
% Result : Unsatisfiable 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 37 ( 32 unt; 0 nHn; 9 RR)
% Number of literals : 47 ( 46 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 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 : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,divide(Y,divide(Z,divide(X,Y)))) = Z,
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))
| multiply(a4,b4) != multiply(b4,a4) ),
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))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,inverse,5,theory(equality)]) ).
cnf(7,plain,
inverse(X) = divide(inverse(divide(Y,Y)),X),
inference('PARAMODULATE',[status(thm)],[inverse,inverse,theory(equality)]) ).
cnf(8,plain,
divide(X,divide(divide(Y,divide(Z,X)),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(9,plain,
inverse(divide(X,divide(Y,inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]),inverse,theory(equality)]) ).
cnf(10,plain,
divide(X,divide(Y,inverse(divide(X,Y)))) = divide(Z,Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(19,plain,
inverse(inverse(divide(X,inverse(divide(Y,Y))))) = X,
inference('PARAMODULATE',[status(thm)],[9,inverse,theory(equality)]) ).
cnf(22,plain,
inverse(X) = divide(inverse(Y),divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[9,8,theory(equality)]) ).
cnf(23,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(24,plain,
divide(X,X) = divide(Y,Y),
inference('REWRITE',[status(thm)],[10,23,theory(equality)]) ).
cnf(25,plain,
( inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[6,24,theory(equality)]) ).
cnf(27,plain,
divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).
cnf(31,plain,
inverse(divide(divide(X,divide(Y,divide(Z,Z))),X)) = Y,
inference('PARAMODULATE',[status(thm)],[inverse,8,theory(equality)]) ).
cnf(34,plain,
inverse(divide(divide(X,divide(Y,inverse(divide(Z,Z)))),X)) = Y,
inference('PARAMODULATE',[status(thm)],[7,8,theory(equality)]) ).
cnf(40,plain,
divide(X,divide(Y,divide(Z,Z))) = divide(X,Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]) ).
cnf(41,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[31,40,theory(equality)]) ).
cnf(42,plain,
divide(X,inverse(divide(Y,Y))) = X,
inference('REWRITE',[status(thm)],[34,41,theory(equality)]) ).
cnf(43,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[19,42,theory(equality)]) ).
cnf(45,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[25,43,theory(equality)]) ).
cnf(46,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]),40,theory(equality)]) ).
cnf(53,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[46,22,theory(equality)]) ).
cnf(54,plain,
inverse(X) = divide(inverse(divide(X,Y)),Y),
inference('PARAMODULATE',[status(thm)],[22,46,theory(equality)]) ).
cnf(55,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[46,23,theory(equality)]) ).
cnf(56,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[45,55,theory(equality)]) ).
cnf(57,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('REWRITE',[status(thm)],[54,55,theory(equality)]) ).
cnf(62,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[53,43,theory(equality)]) ).
cnf(63,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[56,62,theory(equality)]) ).
cnf(64,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[53,43,theory(equality)]) ).
cnf(65,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[63,64,theory(equality)]) ).
cnf(66,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[53,55,theory(equality)]) ).
cnf(67,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[65,66,theory(equality)]) ).
cnf(72,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,57,theory(equality)]),66,theory(equality)]) ).
cnf(73,plain,
$false,
inference('REWRITE',[status(thm)],[67,64,72,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP088-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 03:25:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 *
% 0.21/0.49 *
% 0.21/0.49 #<PACKAGE "SNARK-USER">
% 0.21/0.49 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T03:25:54
% 0.21/0.50 ; 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-14T03:25:54
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 #||
% 0.21/0.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.55 % SZS output start Refutation
% See solution above
% 0.21/0.56 ||#
% 0.21/0.56
% 0.21/0.56 ; Summary of computation:
% 0.21/0.56 ; 283 formulas have been input or derived (from 24 formulas).
% 0.21/0.56 ; 73 (26%) were retained. Of these,
% 0.21/0.56 ; 53 (73%) were simplified or subsumed later,
% 0.21/0.56 ; 20 (27%) are still being kept.
% 0.21/0.56 ;
% 0.21/0.56 ; Run time in seconds excluding printing time:
% 0.21/0.56 ; 0.002 3% Read assertion file (1 call)
% 0.21/0.56 ; 0.000 0% Assert (4 calls)
% 0.21/0.56 ; 0.010 17% Process new row (270 calls)
% 0.21/0.56 ; 0.000 0% Resolution (46 calls)
% 0.21/0.56 ; 0.006 10% Paramodulation (23 calls)
% 0.21/0.56 ; 0.000 0% Condensing (5 calls)
% 0.21/0.56 ; 0.001 2% Forward subsumption (5 calls)
% 0.21/0.56 ; 0.000 0% Backward subsumption (5 calls)
% 0.21/0.56 ; 0.008 14% Forward simplification (258 calls)
% 0.21/0.56 ; 0.005 9% Backward simplification (73 calls)
% 0.21/0.56 ; 0.003 5% Ordering (550 calls)
% 0.21/0.56 ; 0.000 0% Sortal reasoning (32 calls)
% 0.21/0.56 ; 0.000 0% Purity testing (1 call)
% 0.21/0.56 ; 0.023 40% Other
% 0.21/0.56 ; 0.058 Total
% 0.21/0.56 ; 0.064 Real time
% 0.21/0.56 ;
% 0.21/0.56 ; Term-hash-array has 232 terms in all.
% 0.21/0.56 ; Feature-vector-row-index has 0 entries (1 at peak, 5 added, 5 deleted).
% 0.21/0.56 ; Feature-vector-row-index has 1 node (36 at peak, 140 added, 139 deleted).
% 0.21/0.56 ; Retrieved 0 possibly forward subsuming rows in 5 calls.
% 0.21/0.56 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 0.21/0.56 ; Path-index has 58 entries (141 at peak, 339 added, 281 deleted).
% 0.21/0.56 ; Path-index has 318 nodes (471 at peak, 722 added, 404 deleted).
% 0.21/0.56 ; Trie-index has 58 entries (141 at peak, 339 added, 281 deleted).
% 0.21/0.56 ; Trie-index has 153 nodes (480 at peak, 961 added, 808 deleted).
% 0.21/0.56 ; Retrieved 486 generalization terms in 1,172 calls.
% 0.21/0.56 ; Retrieved 269 instance terms in 72 calls.
% 0.21/0.56 ; Retrieved 791 unifiable terms in 201 calls.
% 0.21/0.56 ;
% 0.21/0.56 ; The agenda of rows to process has 5 entries:
% 0.21/0.56 ; 1 with value 19 2 with value 21 2 with value 22
% 0.21/0.56 ; The agenda of rows to give has 9 entries:
% 0.21/0.56 ; 2 with value (4 16) 2 with value (4 18) 1 with value (4 20)
% 0.21/0.56 ; 1 with value (4 17) 3 with value (4 19)
% 0.21/0.56 Evaluation took:
% 0.21/0.56 0.064 seconds of real time
% 0.21/0.56 0.056085 seconds of user run time
% 0.21/0.56 0.007955 seconds of system run time
% 0.21/0.56 0 calls to %EVAL
% 0.21/0.56 0 page faults and
% 0.21/0.56 6,039,344 bytes consed.
% 0.21/0.56 :PROOF-FOUND
% 0.21/0.56 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T03:25:54
% 0.21/0.56 :PROOF-FOUND
% 0.21/0.56 *
%------------------------------------------------------------------------------