%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP092-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n012.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:07 EDT 2022
% Result : Unsatisfiable 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 35 ( 30 unt; 0 nHn; 10 RR)
% Number of literals : 43 ( 42 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,Y),divide(divide(X,Z),Y)) = Z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(divide(Z,Z),Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(divide(Y,Y),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,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/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(6,plain,
inverse(X) = divide(identity,X),
inference('REWRITE',[status(thm)],[inverse,identity,theory(equality)]) ).
cnf(7,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(8,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)],[prove_these_axioms,6,identity,7,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,6,theory(equality)]) ).
cnf(10,plain,
divide(divide(X,Y),inverse(Y)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,identity,theory(equality)]),6,theory(equality)]) ).
cnf(11,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,identity,theory(equality)]),6,theory(equality)]) ).
cnf(15,plain,
divide(divide(divide(X,Y),Z),divide(U,Z)) = divide(divide(X,U),Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(17,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]),6,theory(equality)]) ).
cnf(18,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)],[8,17,theory(equality)]) ).
cnf(19,plain,
divide(divide(X,identity),identity) = X,
inference('PARAMODULATE',[status(thm)],[10,9,theory(equality)]) ).
cnf(25,plain,
divide(X,divide(divide(divide(X,identity),Y),identity)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,19,theory(equality)]) ).
cnf(26,plain,
inverse(divide(inverse(X),identity)) = X,
inference('PARAMODULATE',[status(thm)],[11,6,theory(equality)]) ).
cnf(27,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[17,11,theory(equality)]) ).
cnf(28,plain,
inverse(X) = divide(inverse(X),identity),
inference('PARAMODULATE',[status(thm)],[17,26,theory(equality)]) ).
cnf(29,plain,
X = divide(X,identity),
inference('PARAMODULATE',[status(thm)],[28,17,theory(equality)]) ).
cnf(30,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[25,29,theory(equality)]) ).
cnf(32,plain,
divide(divide(X,Y),divide(Z,Y)) = divide(X,Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,30,theory(equality)]) ).
cnf(33,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[15,32,theory(equality)]) ).
cnf(35,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[27,30,theory(equality)]) ).
cnf(36,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)],[18,35,theory(equality)]) ).
cnf(38,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[10,27,theory(equality)]) ).
cnf(39,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,6,theory(equality)]),6,theory(equality)]) ).
cnf(40,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[36,39,theory(equality)]) ).
cnf(49,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,39,theory(equality)]),35,theory(equality)]) ).
cnf(50,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[40,49,theory(equality)]) ).
cnf(53,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,33,theory(equality)]),35,theory(equality)]) ).
cnf(55,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(c3,divide(inverse(a3),b3)),
inference('REWRITE',[status(thm)],[50,39,53,theory(equality)]) ).
cnf(56,plain,
divide(divide(c3,inverse(a3)),inverse(b3)) != divide(c3,divide(inverse(a3),b3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[55,33,theory(equality)]),33,49,theory(equality)]) ).
cnf(57,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[38,35,theory(equality)]) ).
cnf(58,plain,
$false,
inference('REWRITE',[status(thm)],[56,53,57,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP092-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n012.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 : Tue Jun 14 05:37:40 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T05:37:40
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-14T05:37:40
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 #||
% 0.20/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.54 ||#
% 0.20/0.54
% 0.20/0.54 ; Summary of computation:
% 0.20/0.54 ; 264 formulas have been input or derived (from 26 formulas).
% 0.20/0.54 ; 58 (22%) were retained. Of these,
% 0.20/0.54 ; 33 (57%) were simplified or subsumed later,
% 0.20/0.54 ; 25 (43%) are still being kept.
% 0.20/0.54 ;
% 0.20/0.54 ; Run time in seconds excluding printing time:
% 0.20/0.54 ; 0.002 4% Read assertion file (1 call)
% 0.20/0.54 ; 0.000 0% Assert (5 calls)
% 0.20/0.54 ; 0.008 14% Process new row (253 calls)
% 0.20/0.54 ; 0.000 0% Resolution (50 calls)
% 0.20/0.54 ; 0.006 11% Paramodulation (25 calls)
% 0.20/0.54 ; 0.000 0% Condensing (7 calls)
% 0.20/0.54 ; 0.000 0% Forward subsumption (7 calls)
% 0.20/0.54 ; 0.001 2% Backward subsumption (5 calls)
% 0.20/0.54 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.20/0.54 ; 0.006 11% Forward simplification (231 calls)
% 0.20/0.54 ; 0.005 9% Backward simplification (58 calls)
% 0.20/0.54 ; 0.004 7% Ordering (604 calls)
% 0.20/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.54 ; 0.000 0% Purity testing (1 call)
% 0.20/0.54 ; 0.024 43% Other
% 0.20/0.54 ; 0.056 Total
% 0.20/0.54 ; 0.061 Real time
% 0.20/0.54 ;
% 0.20/0.54 ; Term-hash-array has 182 terms in all.
% 0.20/0.54 ; Feature-vector-row-index has 0 entries (1 at peak, 5 added, 5 deleted).
% 0.20/0.54 ; Feature-vector-row-index has 1 node (36 at peak, 131 added, 130 deleted).
% 0.20/0.54 ; Retrieved 2 possibly forward subsuming rows in 7 calls.
% 0.20/0.54 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 0.20/0.54 ; Path-index has 75 entries (96 at peak, 271 added, 196 deleted).
% 0.20/0.54 ; Path-index has 189 nodes (252 at peak, 489 added, 300 deleted).
% 0.20/0.54 ; Trie-index has 75 entries (96 at peak, 271 added, 196 deleted).
% 0.20/0.54 ; Trie-index has 222 nodes (288 at peak, 789 added, 567 deleted).
% 0.20/0.54 ; Retrieved 884 generalization terms in 1,061 calls.
% 0.20/0.54 ; Retrieved 190 instance terms in 60 calls.
% 0.20/0.54 ; Retrieved 596 unifiable terms in 203 calls.
% 0.20/0.54 ;
% 0.20/0.54 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.20/0.54 ; 1 with value 0
% 0.20/0.54 ; The agenda of rows to process has 3 entries:
% 0.20/0.54 ; 1 with value 20 2 with value 22
% 0.20/0.54 ; The agenda of rows to give has 12 entries:
% 0.20/0.54 ; 1 with value (4 17) 1 with value (4 19) 3 with value (4 21)
% 0.20/0.54 ; 2 with value (4 18) 5 with value (4 20)
% 0.20/0.54 Evaluation took:
% 0.20/0.54 0.062 seconds of real time
% 0.20/0.54 0.052994 seconds of user run time
% 0.20/0.54 0.008909 seconds of system run time
% 0.20/0.54 0 calls to %EVAL
% 0.20/0.54 0 page faults and
% 0.20/0.54 5,515,328 bytes consed.
% 0.20/0.54 :PROOF-FOUND
% 0.20/0.54 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T05:37:40
% 0.20/0.54 :PROOF-FOUND
% 0.20/0.54 *
%------------------------------------------------------------------------------