TSTP Solution File: GRP453-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP453-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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:38:56 EDT 2022
% Result : Unsatisfiable 0.48s 0.66s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 4 RR)
% Number of literals : 48 ( 47 equ; 3 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 : 106 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X,X),divide(X,divide(Y,divide(divide(divide(X,X),X),Z)))),Z) = Y,
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_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(5,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(6,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,5,theory(equality)]) ).
cnf(7,plain,
divide(inverse(divide(X,divide(Y,divide(inverse(X),Z)))),Z) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(8,plain,
inverse(X) = divide(inverse(divide(Y,Y)),X),
inference('PARAMODULATE',[status(thm)],[inverse,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(inverse(divide(X,inverse(Y)))),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,inverse,theory(equality)]),8,theory(equality)]) ).
cnf(12,plain,
divide(inverse(divide(X,Y)),Z) = inverse(divide(U,divide(Y,divide(inverse(U),divide(inverse(X),Z))))),
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(13,plain,
inverse(X) = divide(inverse(inverse(divide(Y,Y))),X),
inference('PARAMODULATE',[status(thm)],[inverse,8,theory(equality)]) ).
cnf(14,plain,
inverse(X) = divide(inverse(inverse(inverse(divide(Y,Y)))),X),
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(18,plain,
divide(inverse(inverse(X)),Y) = inverse(inverse(divide(X,inverse(inverse(Y))))),
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(19,plain,
inverse(inverse(divide(divide(X,inverse(Y)),inverse(inverse(Y))))) = X,
inference('REWRITE',[status(thm)],[10,18,theory(equality)]) ).
cnf(28,plain,
inverse(inverse(divide(divide(X,Y),inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[19,19,theory(equality)]) ).
cnf(29,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('PARAMODULATE',[status(thm)],[28,inverse,theory(equality)]) ).
cnf(34,plain,
inverse(inverse(divide(X,inverse(Y)))) = inverse(divide(Z,divide(X,divide(inverse(Z),Y)))),
inference('PARAMODULATE',[status(thm)],[28,7,theory(equality)]) ).
cnf(35,plain,
divide(inverse(divide(X,Y)),Z) = inverse(inverse(divide(Y,inverse(divide(inverse(X),Z))))),
inference('REWRITE',[status(thm)],[12,34,theory(equality)]) ).
cnf(37,plain,
inverse(inverse(X)) = divide(divide(X,Y),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[29,28,theory(equality)]) ).
cnf(40,plain,
inverse(inverse(divide(X,Y))) = divide(inverse(inverse(X)),inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[37,37,theory(equality)]) ).
cnf(42,plain,
inverse(inverse(X)) = divide(divide(X,inverse(inverse(inverse(Y)))),Y),
inference('PARAMODULATE',[status(thm)],[37,29,theory(equality)]) ).
cnf(43,plain,
divide(X,X) = divide(inverse(Y),inverse(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,13,theory(equality)]),29,theory(equality)]) ).
cnf(45,plain,
divide(X,X) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[43,43,theory(equality)]) ).
cnf(46,plain,
inverse(divide(X,X)) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[inverse,45,theory(equality)]) ).
cnf(57,plain,
inverse(inverse(divide(inverse(inverse(X)),Y))) = divide(X,inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[29,18,theory(equality)]) ).
cnf(110,plain,
divide(inverse(divide(X,divide(Y,Y))),Z) = divide(inverse(X),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,inverse,theory(equality)]),29,theory(equality)]) ).
cnf(112,plain,
divide(inverse(divide(X,Y)),inverse(X)) = inverse(inverse(divide(Y,divide(Z,Z)))),
inference('PARAMODULATE',[status(thm)],[35,46,theory(equality)]) ).
cnf(114,plain,
divide(inverse(divide(inverse(inverse(inverse(X))),Y)),Z) = inverse(inverse(divide(Y,inverse(divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[35,29,theory(equality)]) ).
cnf(118,plain,
divide(inverse(divide(X,inverse(inverse(inverse(divide(Y,Y)))))),Z) = divide(inverse(X),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,14,theory(equality)]),29,theory(equality)]) ).
cnf(121,plain,
divide(inverse(divide(X,Y)),inverse(X)) = inverse(inverse(divide(Y,inverse(inverse(divide(Z,Z)))))),
inference('PARAMODULATE',[status(thm)],[35,46,theory(equality)]) ).
cnf(133,plain,
divide(inverse(inverse(X)),inverse(divide(Y,inverse(divide(inverse(Z),U))))) = inverse(inverse(divide(X,inverse(divide(inverse(divide(Z,Y)),U))))),
inference('PARAMODULATE',[status(thm)],[18,35,theory(equality)]) ).
cnf(143,plain,
inverse(inverse(X)) = divide(divide(X,inverse(inverse(divide(inverse(divide(Y,Z)),U)))),inverse(divide(Z,inverse(divide(inverse(Y),U))))),
inference('PARAMODULATE',[status(thm)],[42,35,theory(equality)]) ).
cnf(157,plain,
inverse(inverse(inverse(divide(X,divide(Y,Y))))) = inverse(inverse(inverse(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,110,theory(equality)]),37,theory(equality)]) ).
cnf(172,plain,
divide(inverse(inverse(inverse(X))),Y) = divide(inverse(X),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[110,42,theory(equality)]),118,theory(equality)]) ).
cnf(180,plain,
divide(inverse(divide(inverse(X),Y)),Z) = inverse(inverse(divide(Y,inverse(divide(X,Z))))),
inference('REWRITE',[status(thm)],[114,172,theory(equality)]) ).
cnf(182,plain,
inverse(inverse(divide(inverse(X),Y))) = divide(inverse(X),inverse(inverse(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[57,110,theory(equality)]),172,157,theory(equality)]) ).
cnf(191,plain,
inverse(inverse(divide(X,Y))) = inverse(inverse(divide(inverse(inverse(X)),Y))),
inference('REWRITE',[status(thm)],[40,182,theory(equality)]) ).
cnf(207,plain,
inverse(inverse(divide(X,Y))) = divide(X,inverse(inverse(Y))),
inference('REWRITE',[status(thm)],[57,191,theory(equality)]) ).
cnf(208,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[143,29,37,133,207,theory(equality)]) ).
cnf(210,plain,
divide(inverse(divide(X,Y)),inverse(X)) = divide(Y,divide(Z,Z)),
inference('REWRITE',[status(thm)],[112,208,theory(equality)]) ).
cnf(213,plain,
divide(inverse(divide(inverse(X),Y)),Z) = divide(Y,inverse(divide(X,Z))),
inference('REWRITE',[status(thm)],[180,208,theory(equality)]) ).
cnf(214,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(inverse(divide(inverse(b3),a3)),inverse(c3)),
inference('REWRITE',[status(thm)],[6,213,theory(equality)]) ).
cnf(220,plain,
divide(inverse(divide(X,Y)),Z) = divide(Y,inverse(divide(inverse(X),Z))),
inference('REWRITE',[status(thm)],[35,208,theory(equality)]) ).
cnf(231,plain,
inverse(divide(X,divide(Y,Y))) = inverse(X),
inference('REWRITE',[status(thm)],[157,208,theory(equality)]) ).
cnf(232,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[121,208,231,207,theory(equality)]) ).
cnf(233,plain,
X = divide(X,divide(Y,Y)),
inference('REWRITE',[status(thm)],[210,232,theory(equality)]) ).
cnf(241,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[220,233,theory(equality)]),208,233,theory(equality)]) ).
cnf(257,plain,
$false,
inference('REWRITE',[status(thm)],[214,241,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP453-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 05:22:33 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.23/0.49 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.50 *
% 0.23/0.50 *
% 0.23/0.51 #<PACKAGE "SNARK-USER">
% 0.23/0.51 *
% 0.23/0.51 SNARK-TPTP-OPTIONS
% 0.23/0.51 *
% 0.23/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.23/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.23/0.51 (USE-FACTORING :POS)
% 0.23/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.23/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.23/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.23/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.23/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.23/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.23/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.23/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.23/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.23/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.23/0.51 *
% 0.23/0.51 "."
% 0.23/0.51 *
% 0.23/0.51 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T05:22:34
% 0.23/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-13T05:22:34
% 0.48/0.66
% 0.48/0.66
% 0.48/0.66 #||
% 0.48/0.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.66 % SZS output start Refutation
% See solution above
% 0.48/0.67 ||#
% 0.48/0.67
% 0.48/0.67 ; Summary of computation:
% 0.48/0.67 ; 1131 formulas have been input or derived (from 33 formulas).
% 0.48/0.67 ; 257 (23%) were retained. Of these,
% 0.48/0.67 ; 234 (91%) were simplified or subsumed later,
% 0.48/0.67 ; 23 ( 9%) are still being kept.
% 0.48/0.67 ;
% 0.48/0.67 ; Run time in seconds excluding printing time:
% 0.48/0.67 ; 0.001 1% Read assertion file (1 call)
% 0.48/0.67 ; 0.001 1% Assert (4 calls)
% 0.48/0.67 ; 0.025 16% Process new row (1,080 calls)
% 0.48/0.67 ; 0.001 1% Resolution (64 calls)
% 0.48/0.67 ; 0.018 12% Paramodulation (32 calls)
% 0.48/0.67 ; 0.033 22% Forward simplification (1,040 calls)
% 0.48/0.67 ; 0.022 14% Backward simplification (257 calls)
% 0.48/0.67 ; 0.024 16% Ordering (3,765 calls)
% 0.48/0.67 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.67 ; 0.000 0% Purity testing (1 call)
% 0.48/0.67 ; 0.027 18% Other
% 0.48/0.67 ; 0.152 Total
% 0.48/0.67 ; 0.163 Real time
% 0.48/0.67 ;
% 0.48/0.67 ; Term-hash-array has 789 terms in all.
% 0.48/0.67 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.48/0.67 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.48/0.67 ; Path-index has 96 entries (537 at peak, 928 added, 832 deleted).
% 0.48/0.67 ; Path-index has 1,068 nodes (1,464 at peak, 1,856 added, 788 deleted).
% 0.48/0.67 ; Trie-index has 96 entries (537 at peak, 928 added, 832 deleted).
% 0.48/0.67 ; Trie-index has 305 nodes (2,416 at peak, 3,951 added, 3,646 deleted).
% 0.48/0.67 ; Retrieved 3,869 generalization terms in 9,173 calls.
% 0.48/0.67 ; Retrieved 1,064 instance terms in 443 calls.
% 0.48/0.67 ; Retrieved 1,490 unifiable terms in 248 calls.
% 0.48/0.67 ;
% 0.48/0.67 ; The agenda of rows to process has 31 entries:
% 0.48/0.67 ; 2 with value 27 9 with value 30 2 with value 32
% 0.48/0.67 ; 10 with value 28 2 with value 31 4 with value 33
% 0.48/0.67 ; 2 with value 29
% 0.48/0.67 ; The agenda of rows to give has 16 entries:
% 0.48/0.67 ; 1 with value (4 17) 1 with value (4 22) 2 with value (4 26)
% 0.48/0.67 ; 2 with value (4 20) 3 with value (4 23) 3 with value (4 27)
% 0.48/0.67 ; 1 with value (4 21) 2 with value (4 24) 1 with value (4 28)
% 0.48/0.67 Evaluation took:
% 0.48/0.67 0.163 seconds of real time
% 0.48/0.67 0.142457 seconds of user run time
% 0.48/0.67 0.019902 seconds of system run time
% 0.48/0.67 [Run times include 0.005 seconds GC run time.]
% 0.48/0.67 0 calls to %EVAL
% 0.48/0.67 0 page faults and
% 0.48/0.67 13,006,960 bytes consed.
% 0.48/0.67 :PROOF-FOUND
% 0.48/0.67 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T05:22:34
% 0.48/0.67 :PROOF-FOUND
% 0.48/0.67 *
%------------------------------------------------------------------------------