TSTP Solution File: GRP539-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP539-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:20 EDT 2022
% Result : Unsatisfiable 0.38s 0.54s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 9 RR)
% Number of literals : 34 ( 33 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,Y),divide(divide(X,Z),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(identity,axiom,
identity = divide(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
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,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,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(X,identity),identity) = X,
inference('PARAMODULATE',[status(thm)],[10,9,theory(equality)]) ).
cnf(24,plain,
divide(X,divide(divide(divide(X,identity),Y),identity)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,18,theory(equality)]) ).
cnf(25,plain,
inverse(divide(inverse(X),identity)) = X,
inference('PARAMODULATE',[status(thm)],[11,6,theory(equality)]) ).
cnf(26,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[17,11,theory(equality)]) ).
cnf(27,plain,
inverse(X) = divide(inverse(X),identity),
inference('PARAMODULATE',[status(thm)],[17,25,theory(equality)]) ).
cnf(28,plain,
X = divide(X,identity),
inference('PARAMODULATE',[status(thm)],[27,17,theory(equality)]) ).
cnf(29,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[24,28,theory(equality)]) ).
cnf(31,plain,
divide(divide(X,Y),divide(Z,Y)) = divide(X,Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,29,theory(equality)]) ).
cnf(32,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[15,31,theory(equality)]) ).
cnf(34,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[26,29,theory(equality)]) ).
cnf(35,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[8,34,theory(equality)]) ).
cnf(37,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[10,26,theory(equality)]) ).
cnf(38,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[32,6,theory(equality)]),6,theory(equality)]) ).
cnf(39,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[35,38,theory(equality)]) ).
cnf(48,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,38,theory(equality)]),34,theory(equality)]) ).
cnf(49,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[39,48,theory(equality)]) ).
cnf(52,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,32,theory(equality)]),34,theory(equality)]) ).
cnf(54,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(c3,divide(inverse(a3),b3)),
inference('REWRITE',[status(thm)],[49,38,52,theory(equality)]) ).
cnf(55,plain,
divide(divide(c3,inverse(a3)),inverse(b3)) != divide(c3,divide(inverse(a3),b3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,32,theory(equality)]),32,48,theory(equality)]) ).
cnf(56,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[37,34,theory(equality)]) ).
cnf(57,plain,
$false,
inference('REWRITE',[status(thm)],[55,52,56,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP539-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n003.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 : Mon Jun 13 20:52:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.49 #<PACKAGE "SNARK-USER">
% 0.21/0.49 *
% 0.21/0.49 SNARK-TPTP-OPTIONS
% 0.21/0.49 *
% 0.21/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49 (USE-FACTORING :POS)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:52:40
% 0.21/0.49 ; 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-13T20:52:40
% 0.38/0.54
% 0.38/0.54
% 0.38/0.54 #||
% 0.38/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.54 % SZS output start Refutation
% See solution above
% 0.38/0.54 ||#
% 0.38/0.54
% 0.38/0.54 ; Summary of computation:
% 0.38/0.54 ; 263 formulas have been input or derived (from 25 formulas).
% 0.38/0.54 ; 57 (22%) were retained. Of these,
% 0.38/0.54 ; 32 (56%) were simplified or subsumed later,
% 0.38/0.54 ; 25 (44%) are still being kept.
% 0.38/0.54 ;
% 0.38/0.54 ; Run time in seconds excluding printing time:
% 0.38/0.54 ; 0.002 4% Read assertion file (1 call)
% 0.38/0.54 ; 0.000 0% Assert (5 calls)
% 0.38/0.54 ; 0.004 8% Process new row (253 calls)
% 0.38/0.54 ; 0.000 0% Resolution (48 calls)
% 0.38/0.54 ; 0.008 15% Paramodulation (24 calls)
% 0.38/0.54 ; 0.008 15% Forward simplification (230 calls)
% 0.38/0.54 ; 0.005 10% Backward simplification (57 calls)
% 0.38/0.54 ; 0.003 6% Ordering (592 calls)
% 0.38/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.38/0.54 ; 0.000 0% Purity testing (1 call)
% 0.38/0.54 ; 0.022 42% Other
% 0.38/0.54 ; 0.052 Total
% 0.38/0.54 ; 0.056 Real time
% 0.38/0.54 ;
% 0.38/0.54 ; Term-hash-array has 162 terms in all.
% 0.38/0.54 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.38/0.54 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.38/0.54 ; Path-index has 71 entries (89 at peak, 206 added, 135 deleted).
% 0.38/0.54 ; Path-index has 181 nodes (232 at peak, 373 added, 192 deleted).
% 0.38/0.54 ; Trie-index has 71 entries (89 at peak, 206 added, 135 deleted).
% 0.38/0.54 ; Trie-index has 218 nodes (276 at peak, 636 added, 418 deleted).
% 0.38/0.54 ; Retrieved 858 generalization terms in 1,010 calls.
% 0.38/0.54 ; Retrieved 196 instance terms in 64 calls.
% 0.38/0.54 ; Retrieved 541 unifiable terms in 163 calls.
% 0.38/0.54 ;
% 0.38/0.54 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.38/0.54 ; 1 with value 0
% 0.38/0.54 ; The agenda of rows to process has 3 entries:
% 0.38/0.54 ; 1 with value 20 2 with value 22
% 0.38/0.54 ; The agenda of rows to give has 12 entries:
% 0.38/0.54 ; 1 with value (4 17) 1 with value (4 19) 3 with value (4 21)
% 0.38/0.54 ; 2 with value (4 18) 5 with value (4 20)
% 0.38/0.54 Evaluation took:
% 0.38/0.54 0.057 seconds of real time
% 0.38/0.54 0.050735 seconds of user run time
% 0.38/0.54 0.006155 seconds of system run time
% 0.38/0.54 0 calls to %EVAL
% 0.38/0.54 0 page faults and
% 0.38/0.54 4,851,392 bytes consed.
% 0.38/0.54 :PROOF-FOUND
% 0.38/0.54 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:52:40
% 0.38/0.54 :PROOF-FOUND
% 0.38/0.54 *
%------------------------------------------------------------------------------