TSTP Solution File: GRP535-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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:19 EDT 2022
% Result : Unsatisfiable 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 7 RR)
% Number of literals : 29 ( 28 equ; 6 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 : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,divide(divide(X,Y),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_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,
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(10,plain,
divide(divide(X,identity),Y) = divide(X,Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,identity,theory(equality)]) ).
cnf(11,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,identity,theory(equality)]),6,theory(equality)]) ).
cnf(16,plain,
divide(divide(X,divide(X,Y)),identity) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,10,theory(equality)]) ).
cnf(17,plain,
divide(X,Y) = divide(divide(Z,divide(Z,X)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,single_axiom,theory(equality)]),10,theory(equality)]) ).
cnf(18,plain,
divide(X,identity) = X,
inference('REWRITE',[status(thm)],[16,17,theory(equality)]) ).
cnf(19,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,18,theory(equality)]),18,theory(equality)]) ).
cnf(20,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),6,theory(equality)]) ).
cnf(21,plain,
divide(divide(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,11,theory(equality)]) ).
cnf(25,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[11,20,theory(equality)]) ).
cnf(26,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,19,theory(equality)]) ).
cnf(28,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[25,19,theory(equality)]) ).
cnf(29,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[8,28,theory(equality)]) ).
cnf(31,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[21,25,theory(equality)]) ).
cnf(36,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[31,20,theory(equality)]) ).
cnf(37,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[29,36,theory(equality)]) ).
cnf(38,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[31,20,theory(equality)]) ).
cnf(39,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[37,38,theory(equality)]) ).
cnf(40,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[31,28,theory(equality)]) ).
cnf(41,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[39,40,theory(equality)]) ).
cnf(44,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,26,theory(equality)]),28,theory(equality)]) ).
cnf(45,plain,
$false,
inference('REWRITE',[status(thm)],[41,38,44,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 00:42:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:42:09
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-14T00:42:09
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 #||
% 0.19/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 % SZS output start Refutation
% See solution above
% 0.19/0.51 ||#
% 0.19/0.51
% 0.19/0.51 ; Summary of computation:
% 0.19/0.51 ; 262 formulas have been input or derived (from 23 formulas).
% 0.19/0.51 ; 45 (17%) were retained. Of these,
% 0.19/0.51 ; 22 (49%) were simplified or subsumed later,
% 0.19/0.51 ; 23 (51%) are still being kept.
% 0.19/0.51 ;
% 0.19/0.51 ; Run time in seconds excluding printing time:
% 0.19/0.51 ; 0.001 2% Read assertion file (1 call)
% 0.19/0.51 ; 0.000 0% Assert (5 calls)
% 0.19/0.51 ; 0.006 13% Process new row (237 calls)
% 0.19/0.51 ; 0.001 2% Resolution (44 calls)
% 0.19/0.51 ; 0.006 13% Paramodulation (22 calls)
% 0.19/0.51 ; 0.007 15% Forward simplification (223 calls)
% 0.19/0.51 ; 0.003 6% Backward simplification (45 calls)
% 0.19/0.52 ; 0.000 0% Ordering (556 calls)
% 0.19/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.52 ; 0.000 0% Purity testing (1 call)
% 0.19/0.52 ; 0.023 49% Other
% 0.19/0.52 ; 0.047 Total
% 0.19/0.52 ; 0.051 Real time
% 0.19/0.52 ;
% 0.19/0.52 ; Term-hash-array has 129 terms in all.
% 0.19/0.52 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.52 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.52 ; Path-index has 66 entries (80 at peak, 172 added, 106 deleted).
% 0.19/0.52 ; Path-index has 192 nodes (227 at peak, 356 added, 164 deleted).
% 0.19/0.52 ; Trie-index has 66 entries (80 at peak, 172 added, 106 deleted).
% 0.19/0.52 ; Trie-index has 214 nodes (264 at peak, 524 added, 310 deleted).
% 0.19/0.52 ; Retrieved 777 generalization terms in 1,008 calls.
% 0.19/0.52 ; Retrieved 158 instance terms in 49 calls.
% 0.19/0.52 ; Retrieved 568 unifiable terms in 145 calls.
% 0.19/0.52 ;
% 0.19/0.52 ; The agenda of rows to process has 23 entries:
% 0.19/0.52 ; 5 with value 21 12 with value 23 4 with value 24
% 0.19/0.52 ; 2 with value 22
% 0.19/0.52 ; The agenda of rows to give has 9 entries:
% 0.19/0.52 ; 1 with value (4 18) 3 with value (4 20) 1 with value (4 22)
% 0.19/0.52 ; 3 with value (4 19) 1 with value (4 21)
% 0.19/0.52 Evaluation took:
% 0.19/0.52 0.051 seconds of real time
% 0.19/0.52 0.040628 seconds of user run time
% 0.19/0.52 0.010179 seconds of system run time
% 0.19/0.52 0 calls to %EVAL
% 0.19/0.52 0 page faults and
% 0.19/0.52 4,270,240 bytes consed.
% 0.19/0.52 :PROOF-FOUND
% 0.19/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:42:09
% 0.19/0.52 :PROOF-FOUND
% 0.19/0.52 *
%------------------------------------------------------------------------------