TSTP Solution File: GRP559-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP559-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n003.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:25 EDT 2022
% Result : Unsatisfiable 0.41s 0.60s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 7 RR)
% Number of literals : 39 ( 38 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,inverse(divide(divide(Y,Z),divide(X,Z)))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
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(4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,multiply,theory(equality)]) ).
cnf(5,plain,
divide(X,inverse(divide(Y,divide(X,inverse(divide(divide(Y,Z),divide(U,Z))))))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(X,inverse(divide(Y,Y))) = X,
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(13,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]) ).
cnf(16,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]) ).
cnf(18,plain,
divide(divide(X,Y),inverse(divide(Z,divide(Z,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[5,13,theory(equality)]) ).
cnf(27,plain,
X = inverse(divide(divide(Y,Y),X)),
inference('PARAMODULATE',[status(thm)],[7,16,theory(equality)]) ).
cnf(28,plain,
divide(inverse(X),inverse(Y)) = inverse(divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[13,16,theory(equality)]) ).
cnf(31,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[16,28,theory(equality)]) ).
cnf(36,plain,
inverse(divide(X,Y)) = inverse(divide(divide(X,Z),divide(Y,Z))),
inference('PARAMODULATE',[status(thm)],[31,single_axiom,theory(equality)]) ).
cnf(42,plain,
divide(X,divide(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[7,27,theory(equality)]) ).
cnf(45,plain,
divide(divide(X,X),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[13,42,theory(equality)]) ).
cnf(47,plain,
inverse(divide(X,divide(Y,inverse(X)))) = Y,
inference('PARAMODULATE',[status(thm)],[13,28,theory(equality)]) ).
cnf(58,plain,
divide(divide(X,X),Y) = divide(divide(Z,Y),Z),
inference('PARAMODULATE',[status(thm)],[45,31,theory(equality)]) ).
cnf(69,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('PARAMODULATE',[status(thm)],[13,47,theory(equality)]) ).
cnf(70,plain,
divide(divide(X,X),Y) = divide(Z,divide(Y,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[45,47,theory(equality)]) ).
cnf(73,plain,
divide(inverse(X),Y) = inverse(divide(X,divide(Z,divide(Y,inverse(Z))))),
inference('PARAMODULATE',[status(thm)],[28,47,theory(equality)]) ).
cnf(79,plain,
X = divide(Y,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[45,18,theory(equality)]) ).
cnf(80,plain,
divide(divide(X,Y),inverse(Y)) = X,
inference('REWRITE',[status(thm)],[18,79,theory(equality)]) ).
cnf(81,plain,
inverse(inverse(X)) = X,
inference('PARAMODULATE',[status(thm)],[31,80,theory(equality)]) ).
cnf(82,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,80,theory(equality)]),28,theory(equality)]) ).
cnf(83,plain,
divide(inverse(X),Y) = divide(divide(Z,divide(Y,inverse(Z))),X),
inference('REWRITE',[status(thm)],[73,82,theory(equality)]) ).
cnf(89,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[4,82,theory(equality)]) ).
cnf(100,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[28,82,theory(equality)]) ).
cnf(101,plain,
divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
inference('REWRITE',[status(thm)],[36,82,theory(equality)]) ).
cnf(103,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[80,69,theory(equality)]) ).
cnf(104,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[89,103,theory(equality)]) ).
cnf(105,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[69,81,theory(equality)]) ).
cnf(106,plain,
divide(divide(X,X),Y) = inverse(Y),
inference('REWRITE',[status(thm)],[58,105,theory(equality)]) ).
cnf(107,plain,
inverse(X) = divide(Y,divide(X,inverse(Y))),
inference('REWRITE',[status(thm)],[70,106,theory(equality)]) ).
cnf(108,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('REWRITE',[status(thm)],[83,107,theory(equality)]) ).
cnf(109,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[104,108,theory(equality)]) ).
cnf(112,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[100,82,theory(equality)]) ).
cnf(113,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[109,112,theory(equality)]) ).
cnf(124,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[101,105,theory(equality)]),112,theory(equality)]) ).
cnf(125,plain,
$false,
inference('REWRITE',[status(thm)],[113,108,124,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP559-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 14 03:42:55 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.49 *
% 0.21/0.49 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 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/sandbox/benchmark/theBenchmark.p 2022-06-14T03:42:55
% 0.21/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n003.cluster.edu at 2022-06-14T03:42:55
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 #||
% 0.41/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.60 % SZS output start Refutation
% See solution above
% 0.41/0.60 ||#
% 0.41/0.60
% 0.41/0.60 ; Summary of computation:
% 0.41/0.60 ; 729 formulas have been input or derived (from 36 formulas).
% 0.41/0.60 ; 125 (17%) were retained. Of these,
% 0.41/0.60 ; 102 (82%) were simplified or subsumed later,
% 0.41/0.60 ; 23 (18%) are still being kept.
% 0.41/0.60 ;
% 0.41/0.60 ; Run time in seconds excluding printing time:
% 0.41/0.60 ; 0.001 1% Read assertion file (1 call)
% 0.41/0.60 ; 0.000 0% Assert (3 calls)
% 0.41/0.60 ; 0.016 18% Process new row (693 calls)
% 0.41/0.60 ; 0.004 4% Resolution (70 calls)
% 0.41/0.60 ; 0.016 18% Paramodulation (35 calls)
% 0.41/0.60 ; 0.014 15% Forward simplification (618 calls)
% 0.41/0.60 ; 0.010 11% Backward simplification (124 calls)
% 0.41/0.60 ; 0.004 4% Ordering (1,353 calls)
% 0.41/0.60 ; 0.000 0% Sortal reasoning (32 calls)
% 0.41/0.60 ; 0.000 0% Purity testing (1 call)
% 0.41/0.60 ; 0.026 29% Other
% 0.41/0.60 ; 0.091 Total
% 0.41/0.60 ; 0.099 Real time
% 0.41/0.60 ;
% 0.41/0.60 ; Term-hash-array has 452 terms in all.
% 0.41/0.60 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.41/0.60 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.41/0.60 ; Path-index has 71 entries (232 at peak, 521 added, 450 deleted).
% 0.41/0.60 ; Path-index has 770 nodes (865 at peak, 1,292 added, 522 deleted).
% 0.41/0.60 ; Trie-index has 71 entries (232 at peak, 521 added, 450 deleted).
% 0.41/0.60 ; Trie-index has 180 nodes (722 at peak, 1,526 added, 1,346 deleted).
% 0.41/0.60 ; Retrieved 1,378 generalization terms in 2,673 calls.
% 0.41/0.60 ; Retrieved 582 instance terms in 145 calls.
% 0.41/0.60 ; Retrieved 2,005 unifiable terms in 250 calls.
% 0.41/0.60 ;
% 0.41/0.60 ; The agenda of rows to process has 1 entry:
% 0.41/0.60 ; 1 with value 24
% 0.41/0.60 ; The agenda of rows to give has 13 entries:
% 0.41/0.60 ; 2 with value (4 19) 2 with value (4 21) 2 with value (4 25)
% 0.41/0.60 ; 1 with value (4 20) 6 with value (4 23)
% 0.41/0.60 Evaluation took:
% 0.41/0.60 0.1 seconds of real time
% 0.41/0.60 0.083988 seconds of user run time
% 0.41/0.60 0.013246 seconds of system run time
% 0.41/0.60 0 calls to %EVAL
% 0.41/0.60 0 page faults and
% 0.41/0.60 7,476,528 bytes consed.
% 0.41/0.60 :PROOF-FOUND
% 0.41/0.60 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T03:42:55
% 0.41/0.60 :PROOF-FOUND
% 0.41/0.60 *
%------------------------------------------------------------------------------