TSTP Solution File: GRP475-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP475-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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:03 EDT 2022
% Result : Unsatisfiable 0.80s 0.98s
% Output : Refutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 3 RR)
% Number of literals : 47 ( 46 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 199 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X,Y),Z),divide(U,Z))),divide(Y,X)) = U,
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_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(4,plain,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference('REWRITE',[status(thm)],[prove_these_axioms_1,multiply,theory(equality)]) ).
cnf(5,plain,
divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)) = inverse(divide(divide(divide(U,Z),W),divide(V,W))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
divide(inverse(divide(divide(X,Y),divide(Z,Y))),divide(divide(U,V),inverse(divide(divide(divide(V,U),W),divide(X,W))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(inverse(divide(divide(divide(divide(X,Y),inverse(divide(divide(divide(Y,X),Z),divide(U,Z)))),V),divide(W,V))),U) = W,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(8,plain,
inverse(divide(divide(divide(X,Y),Z),divide(divide(U,divide(Y,X)),Z))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(9,plain,
inverse(divide(divide(divide(X,Y),Z),divide(U,Z))) = inverse(divide(divide(divide(X,Y),V),divide(U,V))),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(10,plain,
divide(divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)),divide(Z,U)) = V,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(29,plain,
inverse(divide(divide(X,Y),divide(Z,Y))) = inverse(divide(divide(X,U),divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[9,single_axiom,theory(equality)]) ).
cnf(34,plain,
divide(divide(inverse(divide(divide(divide(X,Y),Z),U)),divide(Y,X)),Z) = U,
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(35,plain,
divide(inverse(divide(X,divide(Y,Z))),divide(divide(U,V),inverse(divide(divide(divide(V,U),Z),X)))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,34,theory(equality)]) ).
cnf(36,plain,
divide(divide(inverse(divide(X,Y)),divide(divide(Z,U),inverse(divide(divide(divide(U,Z),V),X)))),V) = Y,
inference('PARAMODULATE',[status(thm)],[34,34,theory(equality)]) ).
cnf(37,plain,
inverse(divide(X,divide(divide(Y,divide(divide(Z,U),inverse(divide(divide(divide(U,Z),V),X)))),V))) = Y,
inference('PARAMODULATE',[status(thm)],[8,34,theory(equality)]) ).
cnf(38,plain,
inverse(X) = inverse(divide(divide(inverse(divide(divide(divide(Y,Z),divide(U,divide(Z,Y))),X)),V),divide(U,V))),
inference('PARAMODULATE',[status(thm)],[29,34,theory(equality)]) ).
cnf(39,plain,
divide(inverse(divide(divide(divide(X,Y),Z),U)),divide(Y,X)) = divide(inverse(divide(divide(divide(V,W),Z),U)),divide(W,V)),
inference('PARAMODULATE',[status(thm)],[single_axiom,34,theory(equality)]) ).
cnf(43,plain,
inverse(divide(X,divide(Y,Z))) = inverse(divide(divide(divide(inverse(divide(divide(divide(U,V),Z),X)),divide(V,U)),W),divide(Y,W))),
inference('PARAMODULATE',[status(thm)],[29,34,theory(equality)]) ).
cnf(59,plain,
divide(X,divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(divide(V,W),U))))) = divide(X,divide(W,V)),
inference('PARAMODULATE',[status(thm)],[35,8,theory(equality)]) ).
cnf(141,plain,
divide(divide(inverse(X),divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(inverse(divide(divide(divide(V,W),X1),X)),divide(W,V)))))),U) = X1,
inference('PARAMODULATE',[status(thm)],[36,34,theory(equality)]) ).
cnf(206,plain,
inverse(X) = inverse(divide(divide(inverse(divide(divide(Y,Z),X)),U),divide(inverse(divide(divide(Y,V),divide(Z,V))),U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[38,6,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(272,plain,
inverse(X) = inverse(divide(divide(inverse(divide(Y,X)),Z),divide(inverse(divide(Y,divide(U,U))),Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[206,34,theory(equality)]),43,theory(equality)]) ).
cnf(277,plain,
divide(divide(inverse(X),divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(inverse(divide(divide(V,W),X)),X1))))),U) = divide(inverse(divide(divide(V,Y1),divide(W,Y1))),X1),
inference('PARAMODULATE',[status(thm)],[36,206,theory(equality)]) ).
cnf(386,plain,
divide(inverse(divide(divide(divide(X,Y),inverse(divide(divide(divide(Z,U),V),divide(divide(W,X1),V)))),divide(X1,W))),divide(Y,X)) = divide(U,Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,59,theory(equality)]) ).
cnf(388,plain,
divide(X,Y) = divide(divide(Z,U),inverse(divide(divide(divide(U,Z),V),divide(divide(Y,X),V)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,59,theory(equality)]),34,theory(equality)]) ).
cnf(421,plain,
divide(inverse(divide(divide(X,Y),Z)),divide(U,V)) = divide(inverse(divide(divide(divide(W,X1),inverse(divide(divide(divide(U,V),Y1),divide(divide(Y,X),Y1)))),Z)),divide(X1,W)),
inference('PARAMODULATE',[status(thm)],[39,388,theory(equality)]) ).
cnf(422,plain,
divide(inverse(divide(divide(X,Y),divide(X,Y))),divide(Z,U)) = divide(U,Z),
inference('REWRITE',[status(thm)],[386,421,theory(equality)]) ).
cnf(450,plain,
divide(inverse(divide(X,X)),divide(Y,Z)) = divide(Z,Y),
inference('PARAMODULATE',[status(thm)],[422,7,theory(equality)]) ).
cnf(451,plain,
divide(X,Y) = divide(divide(X,Y),inverse(divide(Z,Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[450,450,theory(equality)]),450,theory(equality)]) ).
cnf(453,plain,
inverse(X) = inverse(divide(divide(Y,Z),divide(inverse(divide(X,divide(U,U))),divide(Z,Y)))),
inference('PARAMODULATE',[status(thm)],[272,450,theory(equality)]) ).
cnf(459,plain,
inverse(divide(divide(X,Y),divide(inverse(divide(Z,Z)),Y))) = inverse(divide(divide(X,divide(U,V)),divide(V,U))),
inference('PARAMODULATE',[status(thm)],[29,450,theory(equality)]) ).
cnf(460,plain,
inverse(X) = inverse(divide(divide(inverse(divide(inverse(divide(Y,Y)),X)),Z),divide(inverse(divide(U,U)),Z))),
inference('PARAMODULATE',[status(thm)],[272,450,theory(equality)]) ).
cnf(462,plain,
inverse(divide(X,Y)) = inverse(divide(divide(Z,U),divide(inverse(divide(divide(X,V),divide(Y,V))),divide(U,Z)))),
inference('PARAMODULATE',[status(thm)],[206,450,theory(equality)]) ).
cnf(464,plain,
inverse(divide(X,X)) = inverse(divide(Y,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,450,theory(equality)]),34,theory(equality)]) ).
cnf(468,plain,
inverse(divide(X,Y)) = inverse(divide(divide(inverse(divide(Y,X)),Z),divide(inverse(divide(U,U)),Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[272,450,theory(equality)]),450,theory(equality)]) ).
cnf(470,plain,
inverse(X) = inverse(divide(X,inverse(divide(Y,Y)))),
inference('REWRITE',[status(thm)],[460,468,theory(equality)]) ).
cnf(475,plain,
divide(inverse(divide(divide(X,Y),divide(Z,U))),divide(Y,X)) = inverse(divide(divide(divide(U,Z),divide(V,W)),divide(W,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,450,theory(equality)]),451,theory(equality)]) ).
cnf(488,plain,
inverse(X) = inverse(divide(X,divide(Y,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[206,464,theory(equality)]),468,theory(equality)]) ).
cnf(489,plain,
inverse(X) = inverse(divide(divide(Y,Z),divide(inverse(X),divide(Z,Y)))),
inference('REWRITE',[status(thm)],[453,488,theory(equality)]) ).
cnf(490,plain,
inverse(divide(X,Y)) = inverse(divide(divide(X,Z),divide(Y,Z))),
inference('REWRITE',[status(thm)],[462,489,theory(equality)]) ).
cnf(498,plain,
inverse(X) = inverse(divide(divide(X,divide(Y,Z)),divide(Z,Y))),
inference('REWRITE',[status(thm)],[459,470,490,theory(equality)]) ).
cnf(501,plain,
divide(inverse(divide(divide(X,Y),divide(Z,U))),divide(Y,X)) = inverse(divide(U,Z)),
inference('REWRITE',[status(thm)],[475,498,theory(equality)]) ).
cnf(600,plain,
divide(divide(inverse(X),divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(inverse(divide(divide(V,W),X)),X1))))),U) = divide(inverse(divide(V,W)),X1),
inference('REWRITE',[status(thm)],[277,490,theory(equality)]) ).
cnf(601,plain,
divide(inverse(divide(divide(X,Y),Z)),divide(Y,X)) = Z,
inference('REWRITE',[status(thm)],[141,600,theory(equality)]) ).
cnf(602,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('REWRITE',[status(thm)],[501,601,theory(equality)]) ).
cnf(647,plain,
divide(X,X) = divide(Y,Y),
inference('REWRITE',[status(thm)],[464,602,theory(equality)]) ).
cnf(648,plain,
$false,
inference('REWRITE',[status(thm)],[4,647,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP475-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n004.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 : Mon Jun 13 23:15:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 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.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.51 (USE-FACTORING :POS)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.51 *
% 0.21/0.51 "."
% 0.21/0.51 *
% 0.21/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:15:54
% 0.21/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-06-13T23:15:54
% 0.80/0.98
% 0.80/0.98
% 0.80/0.98 #||
% 0.80/0.98 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.80/0.98 % SZS output start Refutation
% See solution above
% 0.80/0.99 ||#
% 0.80/0.99
% 0.80/0.99 ; Summary of computation:
% 0.80/0.99 ; 1832 formulas have been input or derived (from 24 formulas).
% 0.80/0.99 ; 648 (35%) were retained. Of these,
% 0.80/0.99 ; 613 (95%) were simplified or subsumed later,
% 0.80/0.99 ; 35 ( 5%) are still being kept.
% 0.80/0.99 ;
% 0.80/0.99 ; Run time in seconds excluding printing time:
% 0.80/0.99 ; 0.001 0% Read assertion file (1 call)
% 0.80/0.99 ; 0.001 0% Assert (3 calls)
% 0.80/0.99 ; 0.157 33% Process new row (1,409 calls)
% 0.80/0.99 ; 0.002 0% Resolution (46 calls)
% 0.80/0.99 ; 0.048 10% Paramodulation (23 calls)
% 0.80/0.99 ; 0.114 24% Forward simplification (1,144 calls)
% 0.80/0.99 ; 0.116 24% Backward simplification (647 calls)
% 0.80/0.99 ; 0.009 2% Ordering (2,516 calls)
% 0.80/0.99 ; 0.000 0% Sortal reasoning (32 calls)
% 0.80/0.99 ; 0.000 0% Purity testing (1 call)
% 0.80/0.99 ; 0.027 6% Other
% 0.80/0.99 ; 0.475 Total
% 0.80/0.99 ; 0.489 Real time
% 0.80/0.99 ;
% 0.80/0.99 ; Term-hash-array has 4,382 terms in all.
% 0.80/1.00 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.80/1.00 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.80/1.00 ; Path-index has 191 entries (3,485 at peak, 4,663 added, 4,472 deleted).
% 0.80/1.00 ; Path-index has 9,044 nodes (11,783 at peak, 13,940 added, 4,896 deleted).
% 0.80/1.00 ; Trie-index has 191 entries (3,485 at peak, 4,663 added, 4,472 deleted).
% 0.80/1.00 ; Trie-index has 864 nodes (24,065 at peak, 30,633 added, 29,769 deleted).
% 0.80/1.00 ; Retrieved 2,322 generalization terms in 16,699 calls.
% 0.80/1.00 ; Retrieved 3,481 instance terms in 673 calls.
% 0.80/1.00 ; Retrieved 8,953 unifiable terms in 260 calls.
% 0.80/1.00 ;
% 0.80/1.00 ; The agenda of backward simplifiable rows to process has 385 entries:
% 0.80/1.00 ; 385 with value 0
% 0.80/1.00 ; The agenda of rows to process has 34 entries:
% 0.80/1.00 ; 4 with value 35 8 with value 37 2 with value 39
% 0.80/1.00 ; 8 with value 36 6 with value 38 6 with value 40
% 0.80/1.00 ; The agenda of rows to give has 33 entries:
% 0.80/1.00 ; 2 with value (4 14) 1 with value (4 24) 1 with value (4 37)
% 0.80/1.00 ; 1 with value (4 16) 1 with value (4 28) 3 with value (4 39)
% 0.80/1.00 ; 1 with value (4 17) 2 with value (4 30) 1 with value (4 40)
% 0.80/1.00 ; 2 with value (4 18) 3 with value (4 31) 2 with value (4 41)
% 0.80/1.00 ; 2 with value (4 19) 1 with value (4 34) 2 with value (4 42)
% 0.80/1.00 ; 3 with value (4 20) 3 with value (4 36) 1 with value (4 43)
% 0.80/1.00 ; 1 with value (4 22)
% 0.80/1.00 Evaluation took:
% 0.80/1.00 0.489 seconds of real time
% 0.80/1.00 0.466203 seconds of user run time
% 0.80/1.00 0.022965 seconds of system run time
% 0.80/1.00 [Run times include 0.047 seconds GC run time.]
% 0.80/1.00 0 calls to %EVAL
% 0.80/1.00 0 page faults and
% 0.80/1.00 38,516,048 bytes consed.
% 0.80/1.00 :PROOF-FOUND
% 0.80/1.00 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:15:54
% 0.80/1.00 :PROOF-FOUND
% 0.80/1.00 *
%------------------------------------------------------------------------------