TSTP Solution File: GRP477-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP477-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n017.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.78s 0.97s
% Output : Refutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 3
% Syntax : Number of clauses : 86 ( 86 unt; 0 nHn; 4 RR)
% Number of literals : 86 ( 85 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 404 ( 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/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
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(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(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(62,plain,
divide(inverse(divide(X,Y)),divide(divide(Z,U),inverse(divide(divide(divide(U,Z),V),X)))) = divide(inverse(divide(divide(divide(W,X1),V),Y)),divide(X1,W)),
inference('PARAMODULATE',[status(thm)],[35,34,theory(equality)]) ).
cnf(128,plain,
divide(divide(X,divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(divide(V,W),X1))))),U) = divide(divide(X,divide(W,V)),X1),
inference('PARAMODULATE',[status(thm)],[36,8,theory(equality)]) ).
cnf(140,plain,
inverse(divide(divide(X,Y),divide(divide(inverse(divide(Z,U)),divide(divide(V,W),inverse(divide(divide(divide(W,V),X1),Z)))),Y))) = inverse(divide(divide(X,X1),U)),
inference('PARAMODULATE',[status(thm)],[29,36,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(150,plain,
divide(divide(inverse(X),divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),inverse(divide(V,divide(X,W))))))),U) = divide(divide(X1,Y1),inverse(divide(divide(divide(Y1,X1),W),V))),
inference('PARAMODULATE',[status(thm)],[36,35,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(219,plain,
inverse(divide(divide(inverse(divide(divide(divide(X,Y),Z),U)),divide(Y,X)),divide(V,divide(W,X1)))) = inverse(divide(divide(inverse(divide(divide(divide(X1,W),Z),U)),Y1),divide(V,Y1))),
inference('PARAMODULATE',[status(thm)],[29,39,theory(equality)]) ).
cnf(220,plain,
inverse(divide(divide(X,Y),divide(inverse(divide(divide(divide(Z,U),V),W)),Y))) = inverse(divide(divide(X,divide(U,Z)),divide(inverse(divide(divide(divide(X1,Y1),V),W)),divide(Y1,X1)))),
inference('PARAMODULATE',[status(thm)],[29,39,theory(equality)]) ).
cnf(241,plain,
divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),inverse(divide(divide(divide(V,W),X1),Y1)))),divide(Y,X)) = inverse(divide(divide(divide(U,Z),divide(W,V)),divide(inverse(divide(divide(divide(Z1,U1),X1),Y1)),divide(U1,Z1)))),
inference('PARAMODULATE',[status(thm)],[5,39,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(304,plain,
inverse(X) = inverse(divide(divide(inverse(divide(divide(inverse(divide(divide(divide(Y,Z),divide(U,U)),V)),divide(Z,Y)),X)),W),divide(inverse(V),W))),
inference('PARAMODULATE',[status(thm)],[272,34,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(402,plain,
inverse(divide(divide(X,Y),divide(Z,inverse(divide(divide(divide(U,V),W),divide(divide(Y,X),W)))))) = inverse(divide(divide(divide(V,U),X1),divide(Z,X1))),
inference('PARAMODULATE',[status(thm)],[29,388,theory(equality)]) ).
cnf(418,plain,
divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)) = inverse(divide(divide(W,X1),divide(V,inverse(divide(divide(divide(Z,U),Y1),divide(divide(X1,W),Y1)))))),
inference('PARAMODULATE',[status(thm)],[5,388,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(446,plain,
divide(X,inverse(divide(divide(divide(divide(Y,Z),inverse(divide(divide(divide(Z,Y),U),divide(X,U)))),V),divide(W,V)))) = divide(divide(X1,Y1),inverse(divide(divide(divide(Y1,X1),Z1),divide(W,Z1)))),
inference('PARAMODULATE',[status(thm)],[388,7,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(465,plain,
inverse(divide(X,divide(Y,divide(divide(Z,U),inverse(divide(divide(U,Z),X)))))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,450,theory(equality)]),451,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(484,plain,
divide(inverse(divide(divide(divide(divide(X,Y),inverse(divide(divide(divide(Y,X),divide(Z,U)),divide(U,Z)))),V),divide(W,V))),inverse(divide(X1,X1))) = W,
inference('PARAMODULATE',[status(thm)],[7,450,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(491,plain,
divide(inverse(divide(divide(divide(X,Y),inverse(divide(divide(divide(Y,X),divide(Z,U)),divide(U,Z)))),V)),inverse(divide(W,W))) = V,
inference('REWRITE',[status(thm)],[484,490,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(500,plain,
divide(inverse(divide(divide(divide(X,Y),inverse(divide(Y,X))),Z)),inverse(divide(U,U))) = Z,
inference('REWRITE',[status(thm)],[491,498,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(522,plain,
divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)) = inverse(divide(divide(W,X1),divide(V,inverse(divide(divide(Z,U),divide(X1,W)))))),
inference('REWRITE',[status(thm)],[418,490,theory(equality)]) ).
cnf(549,plain,
inverse(divide(divide(X,Y),divide(Z,inverse(divide(divide(U,V),divide(Y,X)))))) = inverse(divide(divide(V,U),Z)),
inference('REWRITE',[status(thm)],[402,490,theory(equality)]) ).
cnf(551,plain,
divide(inverse(divide(divide(divide(X,Y),divide(Z,U)),V)),divide(Y,X)) = inverse(divide(divide(U,Z),V)),
inference('REWRITE',[status(thm)],[522,549,theory(equality)]) ).
cnf(555,plain,
inverse(divide(divide(X,Y),inverse(divide(divide(divide(Z,U),V),W)))) = inverse(divide(divide(divide(X,Y),divide(U,Z)),divide(inverse(divide(divide(divide(X1,Y1),V),W)),divide(Y1,X1)))),
inference('REWRITE',[status(thm)],[241,551,theory(equality)]) ).
cnf(580,plain,
divide(X,inverse(divide(divide(divide(Y,Z),inverse(divide(divide(Z,Y),X))),U))) = divide(divide(V,W),inverse(divide(divide(W,V),U))),
inference('REWRITE',[status(thm)],[446,490,theory(equality)]) ).
cnf(584,plain,
inverse(X) = inverse(divide(inverse(divide(inverse(divide(divide(Y,Y),Z)),X)),inverse(Z))),
inference('REWRITE',[status(thm)],[304,551,490,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(609,plain,
inverse(X) = divide(divide(Y,Z),divide(X,divide(Z,Y))),
inference('REWRITE',[status(thm)],[498,602,theory(equality)]) ).
cnf(610,plain,
inverse(X) = divide(divide(Y,Y),X),
inference('REWRITE',[status(thm)],[488,602,theory(equality)]) ).
cnf(611,plain,
divide(divide(X,divide(divide(Y,Z),divide(divide(divide(U,V),W),divide(divide(Z,Y),X1)))),X1) = divide(divide(X,divide(V,U)),W),
inference('REWRITE',[status(thm)],[128,602,theory(equality)]) ).
cnf(612,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[4,602,theory(equality)]) ).
cnf(617,plain,
inverse(X) = divide(inverse(Y),divide(X,divide(Y,divide(Z,Z)))),
inference('REWRITE',[status(thm)],[584,602,theory(equality)]) ).
cnf(621,plain,
divide(X,divide(Y,inverse(X))) = inverse(Y),
inference('REWRITE',[status(thm)],[580,609,602,theory(equality)]) ).
cnf(640,plain,
divide(inverse(inverse(X)),divide(Y,Y)) = X,
inference('REWRITE',[status(thm)],[500,610,602,theory(equality)]) ).
cnf(644,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[465,621,609,602,theory(equality)]) ).
cnf(645,plain,
divide(X,divide(Y,Y)) = X,
inference('REWRITE',[status(thm)],[640,644,theory(equality)]) ).
cnf(646,plain,
inverse(X) = divide(inverse(Y),divide(X,Y)),
inference('REWRITE',[status(thm)],[617,645,theory(equality)]) ).
cnf(657,plain,
divide(inverse(X),Y) = divide(divide(Z,U),divide(Y,divide(divide(U,Z),X))),
inference('REWRITE',[status(thm)],[150,646,611,602,theory(equality)]) ).
cnf(692,plain,
divide(divide(X,divide(divide(Y,Z),U)),divide(V,W)) = divide(divide(divide(X,divide(divide(X1,Y1),U)),divide(Y1,X1)),divide(divide(V,W),divide(Z,Y))),
inference('REWRITE',[status(thm)],[555,602,theory(equality)]) ).
cnf(700,plain,
divide(divide(X,Y),divide(inverse(Z),Y)) = divide(divide(X,divide(divide(U,V),Z)),divide(V,U)),
inference('REWRITE',[status(thm)],[62,657,602,theory(equality)]) ).
cnf(707,plain,
divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
inference('REWRITE',[status(thm)],[490,602,theory(equality)]) ).
cnf(715,plain,
divide(X,inverse(Y)) = divide(divide(X,divide(divide(Z,U),Y)),divide(U,Z)),
inference('REWRITE',[status(thm)],[700,707,theory(equality)]) ).
cnf(717,plain,
divide(divide(X,divide(divide(Y,Z),U)),divide(V,W)) = divide(divide(X,inverse(U)),divide(divide(V,W),divide(Z,Y))),
inference('REWRITE',[status(thm)],[692,715,theory(equality)]) ).
cnf(729,plain,
divide(divide(X,divide(divide(Y,Z),U)),V) = divide(divide(X,inverse(U)),divide(V,divide(Z,Y))),
inference('REWRITE',[status(thm)],[220,645,707,717,602,490,theory(equality)]) ).
cnf(730,plain,
divide(divide(X,divide(Y,Z)),divide(U,inverse(V))) = divide(X,divide(U,divide(divide(Z,Y),V))),
inference('REWRITE',[status(thm)],[219,645,707,729,602,490,theory(equality)]) ).
cnf(731,plain,
divide(divide(X,inverse(Y)),Z) = divide(X,divide(Z,Y)),
inference('REWRITE',[status(thm)],[140,610,707,730,602,490,theory(equality)]) ).
cnf(732,plain,
$false,
inference('REWRITE',[status(thm)],[612,731,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP477-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 22:56:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.47 #<PACKAGE "SNARK-USER">
% 0.21/0.47 *
% 0.21/0.47 SNARK-TPTP-OPTIONS
% 0.21/0.47 *
% 0.21/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47 (USE-FACTORING :POS)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.47 *
% 0.21/0.47 "."
% 0.21/0.47 *
% 0.21/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:56:38
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-13T22:56:38
% 0.78/0.97
% 0.78/0.97
% 0.78/0.97 #||
% 0.78/0.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/0.97 % SZS output start Refutation
% See solution above
% 0.83/0.98 ||#
% 0.83/0.98
% 0.83/0.98 ; Summary of computation:
% 0.83/0.98 ; 1903 formulas have been input or derived (from 24 formulas).
% 0.83/0.98 ; 732 (38%) were retained. Of these,
% 0.83/0.98 ; 687 (94%) were simplified or subsumed later,
% 0.83/0.98 ; 45 ( 6%) are still being kept.
% 0.83/0.98 ;
% 0.83/0.98 ; Run time in seconds excluding printing time:
% 0.83/0.98 ; 0.001 0% Read assertion file (1 call)
% 0.83/0.98 ; 0.000 0% Assert (3 calls)
% 0.83/0.98 ; 0.152 31% Process new row (1,652 calls)
% 0.83/0.98 ; 0.003 1% Resolution (46 calls)
% 0.83/0.98 ; 0.038 8% Paramodulation (23 calls)
% 0.83/0.98 ; 0.124 25% Forward simplification (1,387 calls)
% 0.83/0.98 ; 0.115 23% Backward simplification (731 calls)
% 0.83/0.98 ; 0.027 5% Ordering (4,071 calls)
% 0.83/0.98 ; 0.001 0% Sortal reasoning (32 calls)
% 0.83/0.98 ; 0.000 0% Purity testing (1 call)
% 0.83/0.98 ; 0.030 6% Other
% 0.83/0.98 ; 0.491 Total
% 0.83/0.98 ; 0.508 Real time
% 0.83/0.98 ;
% 0.83/0.98 ; Term-hash-array has 4,748 terms in all.
% 0.83/0.98 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.83/0.98 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.83/0.98 ; Path-index has 218 entries (3,489 at peak, 5,114 added, 4,896 deleted).
% 0.83/0.98 ; Path-index has 9,187 nodes (11,793 at peak, 14,368 added, 5,181 deleted).
% 0.83/0.98 ; Trie-index has 218 entries (3,489 at peak, 5,114 added, 4,896 deleted).
% 0.83/0.98 ; Trie-index has 841 nodes (24,082 at peak, 32,729 added, 31,888 deleted).
% 0.83/0.98 ; Retrieved 6,838 generalization terms in 21,538 calls.
% 0.83/0.98 ; Retrieved 4,248 instance terms in 782 calls.
% 0.83/0.98 ; Retrieved 8,955 unifiable terms in 264 calls.
% 0.83/0.98 ;
% 0.83/0.98 ; The agenda of backward simplifiable rows to process has 213 entries:
% 0.83/0.98 ; 213 with value 0
% 0.83/0.98 ; The agenda of rows to process has 34 entries:
% 0.83/0.98 ; 4 with value 35 8 with value 37 2 with value 39
% 0.83/0.98 ; 8 with value 36 6 with value 38 6 with value 40
% 0.83/0.98 ; The agenda of rows to give has 43 entries:
% 0.83/0.98 ; 1 with value (4 14) 2 with value (4 22) 4 with value (4 30)
% 0.83/0.98 ; 1 with value (4 16) 2 with value (4 23) 2 with value (4 31)
% 0.83/0.98 ; 1 with value (4 17) 2 with value (4 24) 2 with value (4 33)
% 0.83/0.98 ; 1 with value (4 18) 1 with value (4 26) 2 with value (4 36)
% 0.83/0.98 ; 2 with value (4 19) 6 with value (4 27) 2 with value (4 38)
% 0.83/0.98 ; 2 with value (4 20) 3 with value (4 28) 2 with value (4 41)
% 0.83/0.98 ; 2 with value (4 21) 3 with value (4 29)
% 0.83/0.98 Evaluation took:
% 0.83/0.98 0.508 seconds of real time
% 0.83/0.98 0.475337 seconds of user run time
% 0.83/0.98 0.032889 seconds of system run time
% 0.83/0.98 [Run times include 0.039 seconds GC run time.]
% 0.83/0.98 0 calls to %EVAL
% 0.83/0.98 0 page faults and
% 0.83/0.98 48,157,928 bytes consed.
% 0.83/0.98 :PROOF-FOUND
% 0.83/0.98 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:56:39
% 0.83/0.98 :PROOF-FOUND
% 0.83/0.98 *
%------------------------------------------------------------------------------