TSTP Solution File: GRP555-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP555-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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:24 EDT 2022
% Result : Unsatisfiable 0.46s 0.62s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 5 RR)
% Number of literals : 44 ( 43 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 119 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,inverse(divide(Y,divide(X,Z)))),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(divide(X,inverse(Y)),Z) = divide(U,inverse(divide(Y,divide(U,divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(divide(divide(X,inverse(Y)),Z),divide(X,Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(8,plain,
divide(X,inverse(divide(divide(Y,divide(Z,U)),divide(X,divide(Z,U))))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(21,plain,
divide(X,divide(divide(Y,inverse(X)),divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(33,plain,
divide(divide(X,divide(Y,divide(Y,inverse(Z)))),X) = Z,
inference('PARAMODULATE',[status(thm)],[21,single_axiom,theory(equality)]) ).
cnf(35,plain,
divide(divide(divide(X,inverse(Y)),inverse(Z)),divide(X,inverse(U))) = divide(Y,inverse(divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[5,21,theory(equality)]) ).
cnf(46,plain,
divide(divide(X,inverse(Y)),Z) = divide(divide(X,Z),divide(U,divide(U,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[single_axiom,33,theory(equality)]) ).
cnf(57,plain,
divide(divide(divide(X,divide(Y,divide(Y,inverse(Z)))),inverse(U)),X) = divide(V,inverse(divide(U,divide(V,Z)))),
inference('PARAMODULATE',[status(thm)],[5,33,theory(equality)]) ).
cnf(61,plain,
divide(X,inverse(divide(divide(Y,Z),divide(X,Z)))) = Y,
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(63,plain,
divide(X,inverse(Y)) = divide(X,divide(Z,divide(Z,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[61,33,theory(equality)]) ).
cnf(72,plain,
divide(divide(X,inverse(Y)),Z) = divide(divide(X,Z),inverse(Y)),
inference('REWRITE',[status(thm)],[46,63,theory(equality)]) ).
cnf(75,plain,
divide(divide(X,Y),inverse(divide(Z,divide(X,Y)))) = Z,
inference('REWRITE',[status(thm)],[single_axiom,72,theory(equality)]) ).
cnf(80,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('REWRITE',[status(thm)],[33,63,theory(equality)]) ).
cnf(83,plain,
divide(divide(divide(X,inverse(Y)),inverse(Z)),X) = divide(U,inverse(divide(Z,divide(U,Y)))),
inference('REWRITE',[status(thm)],[57,63,theory(equality)]) ).
cnf(91,plain,
divide(X,Y) = divide(Z,inverse(divide(divide(divide(X,U),divide(V,U)),divide(Z,divide(V,Y))))),
inference('PARAMODULATE',[status(thm)],[5,61,theory(equality)]) ).
cnf(92,plain,
divide(X,inverse(divide(Y,Y))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[61,21,theory(equality)]),35,5,theory(equality)]) ).
cnf(99,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[75,75,theory(equality)]) ).
cnf(100,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[99,99,theory(equality)]) ).
cnf(101,plain,
divide(divide(X,Y),divide(Z,Y)) = divide(X,Z),
inference('PARAMODULATE',[status(thm)],[7,99,theory(equality)]) ).
cnf(102,plain,
divide(X,Y) = divide(Z,inverse(divide(divide(X,U),divide(Z,divide(U,Y))))),
inference('REWRITE',[status(thm)],[91,101,theory(equality)]) ).
cnf(114,plain,
divide(inverse(X),inverse(Y)) = inverse(divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[99,100,theory(equality)]) ).
cnf(116,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[100,114,theory(equality)]) ).
cnf(120,plain,
divide(divide(X,Y),Z) = divide(U,inverse(divide(divide(divide(V,Y),V),divide(U,divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[5,116,theory(equality)]) ).
cnf(131,plain,
divide(X,inverse(Y)) = divide(Z,inverse(divide(Y,divide(Z,X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,92,theory(equality)]),92,theory(equality)]) ).
cnf(136,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[120,116,131,theory(equality)]) ).
cnf(140,plain,
divide(X,Y) = divide(divide(Z,Y),inverse(divide(X,Z))),
inference('REWRITE',[status(thm)],[102,131,theory(equality)]) ).
cnf(149,plain,
divide(divide(divide(X,inverse(Y)),inverse(Z)),X) = divide(Y,inverse(Z)),
inference('REWRITE',[status(thm)],[83,131,theory(equality)]) ).
cnf(158,plain,
inverse(divide(divide(X,Y),divide(X,Z))) = divide(Y,Z),
inference('PARAMODULATE',[status(thm)],[116,101,theory(equality)]) ).
cnf(160,plain,
divide(X,divide(Y,Z)) = divide(divide(Z,inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[101,80,theory(equality)]) ).
cnf(161,plain,
divide(X,divide(Y,inverse(divide(X,Z)))) = divide(Z,Y),
inference('PARAMODULATE',[status(thm)],[101,99,theory(equality)]) ).
cnf(162,plain,
divide(divide(X,Y),Z) = divide(X,divide(Y,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[101,80,theory(equality)]) ).
cnf(163,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[149,140,114,162,theory(equality)]) ).
cnf(176,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[4,160,163,theory(equality)]) ).
cnf(178,plain,
divide(divide(X,Y),divide(X,Z)) = divide(Z,Y),
inference('REWRITE',[status(thm)],[161,162,theory(equality)]) ).
cnf(181,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[158,178,theory(equality)]) ).
cnf(195,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[114,181,theory(equality)]) ).
cnf(207,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[195,181,theory(equality)]) ).
cnf(215,plain,
divide(c3,divide(inverse(a3),b3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[176,207,theory(equality)]) ).
cnf(219,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[181,136,theory(equality)]),181,theory(equality)]) ).
cnf(220,plain,
$false,
inference('REWRITE',[status(thm)],[215,219,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP555-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 07:21:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 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-14T07:21:23
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-06-14T07:21:23
% 0.46/0.62
% 0.46/0.62
% 0.46/0.62 #||
% 0.46/0.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.62 % SZS output start Refutation
% See solution above
% 0.46/0.62 ||#
% 0.46/0.62
% 0.46/0.62 ; Summary of computation:
% 0.46/0.62 ; 607 formulas have been input or derived (from 30 formulas).
% 0.46/0.62 ; 220 (36%) were retained. Of these,
% 0.46/0.62 ; 174 (79%) were simplified or subsumed later,
% 0.46/0.62 ; 46 (21%) are still being kept.
% 0.46/0.62 ;
% 0.46/0.62 ; Run time in seconds excluding printing time:
% 0.46/0.62 ; 0.001 1% Read assertion file (1 call)
% 0.46/0.62 ; 0.000 0% Assert (3 calls)
% 0.46/0.62 ; 0.027 19% Process new row (568 calls)
% 0.46/0.62 ; 0.003 2% Resolution (58 calls)
% 0.46/0.62 ; 0.013 9% Paramodulation (29 calls)
% 0.46/0.62 ; 0.027 19% Forward simplification (495 calls)
% 0.46/0.62 ; 0.023 17% Backward simplification (219 calls)
% 0.46/0.62 ; 0.021 15% Ordering (2,829 calls)
% 0.46/0.62 ; 0.000 0% Sortal reasoning (32 calls)
% 0.46/0.62 ; 0.000 0% Purity testing (1 call)
% 0.46/0.62 ; 0.024 17% Other
% 0.46/0.62 ; 0.139 Total
% 0.46/0.62 ; 0.143 Real time
% 0.46/0.62 ;
% 0.46/0.62 ; Term-hash-array has 873 terms in all.
% 0.46/0.62 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.46/0.62 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.46/0.62 ; Path-index has 165 entries (430 at peak, 955 added, 790 deleted).
% 0.46/0.62 ; Path-index has 1,018 nodes (1,285 at peak, 1,621 added, 603 deleted).
% 0.46/0.62 ; Trie-index has 165 entries (430 at peak, 955 added, 790 deleted).
% 0.46/0.62 ; Trie-index has 534 nodes (1,824 at peak, 3,690 added, 3,156 deleted).
% 0.46/0.62 ; Retrieved 2,481 generalization terms in 3,025 calls.
% 0.46/0.62 ; Retrieved 2,251 instance terms in 277 calls.
% 0.46/0.62 ; Retrieved 2,933 unifiable terms in 208 calls.
% 0.46/0.62 ;
% 0.46/0.62 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.46/0.62 ; 1 with value 0
% 0.46/0.62 ; The agenda of rows to process has 29 entries:
% 0.46/0.62 ; 11 with value 21 6 with value 22 12 with value 23
% 0.46/0.62 ; The agenda of rows to give has 35 entries:
% 0.46/0.62 ; 3 with value (4 17) 2 with value (4 22) 1 with value (4 27)
% 0.46/0.62 ; 1 with value (4 18) 5 with value (4 23) 2 with value (4 28)
% 0.46/0.62 ; 2 with value (4 19) 2 with value (4 24) 1 with value (4 30)
% 0.46/0.62 ; 4 with value (4 20) 5 with value (4 25) 3 with value (4 31)
% 0.46/0.62 ; 3 with value (4 21) 1 with value (4 26)
% 0.46/0.62 Evaluation took:
% 0.46/0.62 0.143 seconds of real time
% 0.46/0.62 0.125096 seconds of user run time
% 0.46/0.62 0.01754 seconds of system run time
% 0.46/0.62 0 calls to %EVAL
% 0.46/0.62 0 page faults and
% 0.46/0.62 11,608,648 bytes consed.
% 0.46/0.62 :PROOF-FOUND
% 0.46/0.62 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T07:21:23
% 0.46/0.62 :PROOF-FOUND
% 0.46/0.62 *
%------------------------------------------------------------------------------