TSTP Solution File: GRP108-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP108-1 : TPTP v8.1.0. Bugfixed v2.7.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:36:11 EDT 2022
% Result : Unsatisfiable 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 3
% Syntax : Number of clauses : 81 ( 76 unt; 0 nHn; 7 RR)
% Number of literals : 94 ( 93 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 253 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(inverse(double_divide(X,inverse(double_divide(Y,double_divide(X,Z))))),Z)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(4,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,multiply,theory(equality)]) ).
cnf(5,plain,
inverse(double_divide(inverse(double_divide(X,Y)),Z)) = inverse(double_divide(U,inverse(double_divide(Y,double_divide(U,double_divide(X,Z)))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X,Y)),Z)),double_divide(X,Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(7,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(Y,X)),double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(8,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(inverse(double_divide(Z,X)),U)),Y))) = double_divide(Z,U),
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(12,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,double_divide(Y,U)))) = U,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(13,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = double_divide(inverse(double_divide(U,Z)),double_divide(U,X)),
inference('PARAMODULATE',[status(thm)],[6,7,theory(equality)]) ).
cnf(20,plain,
inverse(double_divide(double_divide(X,double_divide(inverse(double_divide(inverse(double_divide(Y,X)),Z)),U)),double_divide(U,double_divide(double_divide(Y,Z),V)))) = V,
inference('PARAMODULATE',[status(thm)],[12,6,theory(equality)]) ).
cnf(24,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(X,inverse(double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[6,13,theory(equality)]) ).
cnf(25,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)) = double_divide(inverse(double_divide(U,Y)),double_divide(U,Z)),
inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]) ).
cnf(26,plain,
inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,Z)),double_divide(X,Z))))) = Y,
inference('PARAMODULATE',[status(thm)],[7,13,theory(equality)]) ).
cnf(37,plain,
inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),U)),double_divide(inverse(double_divide(Z,V)),U))) = double_divide(Y,V),
inference('PARAMODULATE',[status(thm)],[6,13,theory(equality)]) ).
cnf(40,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = double_divide(U,double_divide(inverse(double_divide(V,inverse(double_divide(U,double_divide(V,Z))))),X)),
inference('PARAMODULATE',[status(thm)],[13,single_axiom,theory(equality)]) ).
cnf(63,plain,
inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(double_divide(Z,X)))))) = Z,
inference('PARAMODULATE',[status(thm)],[6,24,theory(equality)]) ).
cnf(70,plain,
inverse(double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(double_divide(Z,U)),Y))) = double_divide(Z,inverse(double_divide(U,X))),
inference('PARAMODULATE',[status(thm)],[6,24,theory(equality)]) ).
cnf(75,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(inverse(double_divide(Y,Z)),X)),U))) = double_divide(Y,inverse(double_divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[7,24,theory(equality)]) ).
cnf(84,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(Y,Z)))),double_divide(X,U)),double_divide(U,V))) = double_divide(Y,inverse(double_divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[12,24,theory(equality)]) ).
cnf(99,plain,
double_divide(X,double_divide(inverse(double_divide(Y,inverse(double_divide(X,double_divide(Y,Z))))),U)) = double_divide(inverse(double_divide(V,Z)),double_divide(V,U)),
inference('PARAMODULATE',[status(thm)],[25,single_axiom,theory(equality)]) ).
cnf(120,plain,
inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,Z)),double_divide(Y,Z))))) = X,
inference('PARAMODULATE',[status(thm)],[26,25,theory(equality)]) ).
cnf(134,plain,
double_divide(inverse(double_divide(X,inverse(Y))),double_divide(X,Z)) = double_divide(U,double_divide(U,inverse(double_divide(Z,Y)))),
inference('PARAMODULATE',[status(thm)],[24,63,theory(equality)]) ).
cnf(138,plain,
inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,Z)))) = inverse(double_divide(U,inverse(double_divide(Z,double_divide(U,X))))),
inference('PARAMODULATE',[status(thm)],[63,single_axiom,theory(equality)]) ).
cnf(144,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(double_divide(Z,double_divide(Z,inverse(double_divide(U,V)))),Y))) = double_divide(U,double_divide(inverse(V),X)),
inference('PARAMODULATE',[status(thm)],[13,63,theory(equality)]) ).
cnf(156,plain,
inverse(double_divide(X,inverse(double_divide(inverse(Y),Y)))) = X,
inference('PARAMODULATE',[status(thm)],[120,24,theory(equality)]) ).
cnf(164,plain,
inverse(double_divide(inverse(inverse(double_divide(inverse(X),X))),double_divide(Y,double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[63,156,theory(equality)]) ).
cnf(167,plain,
double_divide(X,double_divide(X,Y)) = double_divide(Z,double_divide(Z,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,156,theory(equality)]),156,theory(equality)]) ).
cnf(182,plain,
inverse(double_divide(X,double_divide(X,double_divide(inverse(Y),inverse(double_divide(Z,Y)))))) = Z,
inference('PARAMODULATE',[status(thm)],[63,167,theory(equality)]) ).
cnf(188,plain,
double_divide(inverse(double_divide(X,Y)),Z) = double_divide(U,double_divide(U,double_divide(X,inverse(double_divide(Y,Z))))),
inference('PARAMODULATE',[status(thm)],[167,24,theory(equality)]) ).
cnf(189,plain,
inverse(double_divide(inverse(double_divide(inverse(X),Y)),X)) = Y,
inference('REWRITE',[status(thm)],[182,188,theory(equality)]) ).
cnf(196,plain,
double_divide(inverse(double_divide(X,double_divide(X,Y))),double_divide(Z,U)) = double_divide(inverse(double_divide(V,double_divide(Z,Y))),double_divide(V,U)),
inference('PARAMODULATE',[status(thm)],[25,167,theory(equality)]) ).
cnf(197,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X,double_divide(X,Y))),Z)),double_divide(U,Z))) = double_divide(U,Y),
inference('PARAMODULATE',[status(thm)],[6,167,theory(equality)]) ).
cnf(203,plain,
inverse(double_divide(inverse(double_divide(X,double_divide(X,Y))),double_divide(Z,double_divide(U,Y)))) = double_divide(inverse(double_divide(V,Z)),double_divide(V,U)),
inference('PARAMODULATE',[status(thm)],[13,167,theory(equality)]) ).
cnf(209,plain,
inverse(double_divide(X,double_divide(inverse(Y),X))) = Y,
inference('PARAMODULATE',[status(thm)],[189,189,theory(equality)]) ).
cnf(211,plain,
X = inverse(double_divide(inverse(inverse(double_divide(inverse(Y),Y))),X)),
inference('PARAMODULATE',[status(thm)],[156,189,theory(equality)]) ).
cnf(212,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[164,211,theory(equality)]) ).
cnf(226,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(Z,U)),Y))) = double_divide(Z,double_divide(inverse(U),X)),
inference('REWRITE',[status(thm)],[144,212,theory(equality)]) ).
cnf(228,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(inverse(Z),Y)) = double_divide(X,Z),
inference('REWRITE',[status(thm)],[8,226,theory(equality)]) ).
cnf(232,plain,
inverse(double_divide(X,double_divide(Y,Z))) = double_divide(Y,double_divide(inverse(Z),X)),
inference('REWRITE',[status(thm)],[226,228,theory(equality)]) ).
cnf(235,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = inverse(double_divide(X,double_divide(U,double_divide(V,inverse(double_divide(U,double_divide(V,Z))))))),
inference('REWRITE',[status(thm)],[40,232,theory(equality)]) ).
cnf(237,plain,
inverse(double_divide(X,double_divide(Y,double_divide(Z,inverse(double_divide(Y,double_divide(Z,U))))))) = double_divide(inverse(double_divide(V,U)),double_divide(V,X)),
inference('REWRITE',[status(thm)],[99,232,theory(equality)]) ).
cnf(240,plain,
inverse(inverse(double_divide(X,inverse(double_divide(Y,Z))))) = double_divide(Y,inverse(double_divide(Z,X))),
inference('REWRITE',[status(thm)],[75,212,232,theory(equality)]) ).
cnf(242,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(inverse(inverse(double_divide(inverse(b2),inverse(double_divide(a2,b2)))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[4,240,theory(equality)]) ).
cnf(253,plain,
inverse(double_divide(X,double_divide(Y,inverse(inverse(double_divide(double_divide(Z,U),inverse(double_divide(Z,Y)))))))) = double_divide(inverse(double_divide(V,U)),double_divide(V,X)),
inference('REWRITE',[status(thm)],[237,240,theory(equality)]) ).
cnf(254,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = inverse(double_divide(X,double_divide(U,inverse(inverse(double_divide(double_divide(V,Z),inverse(double_divide(V,U)))))))),
inference('REWRITE',[status(thm)],[235,240,theory(equality)]) ).
cnf(271,plain,
inverse(double_divide(inverse(double_divide(X,inverse(double_divide(Y,double_divide(Z,double_divide(U,Z)))))),double_divide(X,double_divide(double_divide(U,Y),V)))) = V,
inference('REWRITE',[status(thm)],[20,232,theory(equality)]) ).
cnf(274,plain,
inverse(inverse(double_divide(double_divide(X,Y),double_divide(Z,double_divide(X,Z))))) = Y,
inference('REWRITE',[status(thm)],[7,232,theory(equality)]) ).
cnf(275,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[209,212,232,theory(equality)]) ).
cnf(290,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = inverse(double_divide(X,double_divide(U,double_divide(double_divide(V,Z),inverse(double_divide(V,U)))))),
inference('REWRITE',[status(thm)],[254,275,theory(equality)]) ).
cnf(292,plain,
inverse(double_divide(X,double_divide(Y,double_divide(double_divide(Z,U),inverse(double_divide(Z,Y)))))) = double_divide(inverse(double_divide(V,U)),double_divide(V,X)),
inference('REWRITE',[status(thm)],[253,275,theory(equality)]) ).
cnf(306,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(inverse(b2),inverse(double_divide(a2,b2)))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[242,275,theory(equality)]) ).
cnf(309,plain,
double_divide(double_divide(X,Y),double_divide(Z,double_divide(X,Z))) = Y,
inference('REWRITE',[status(thm)],[274,275,theory(equality)]) ).
cnf(323,plain,
inverse(double_divide(inverse(X),double_divide(Y,Z))) = double_divide(Y,inverse(double_divide(Z,X))),
inference('REWRITE',[status(thm)],[70,228,theory(equality)]) ).
cnf(325,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,U))) = double_divide(Y,U),
inference('REWRITE',[status(thm)],[37,228,theory(equality)]) ).
cnf(327,plain,
double_divide(inverse(double_divide(X,Y)),Z) = double_divide(X,inverse(double_divide(Y,Z))),
inference('REWRITE',[status(thm)],[84,325,theory(equality)]) ).
cnf(331,plain,
inverse(double_divide(inverse(X),inverse(double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[189,327,theory(equality)]) ).
cnf(332,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[306,331,327,theory(equality)]) ).
cnf(340,plain,
double_divide(inverse(double_divide(X,inverse(Y))),double_divide(X,Z)) = inverse(double_divide(Z,Y)),
inference('REWRITE',[status(thm)],[134,212,theory(equality)]) ).
cnf(341,plain,
double_divide(double_divide(double_divide(X,Y),Z),double_divide(Y,double_divide(U,double_divide(X,U)))) = Z,
inference('REWRITE',[status(thm)],[271,275,340,theory(equality)]) ).
cnf(355,plain,
double_divide(inverse(X),double_divide(Y,Z)) = double_divide(inverse(double_divide(U,double_divide(Y,X))),double_divide(U,Z)),
inference('REWRITE',[status(thm)],[196,212,theory(equality)]) ).
cnf(356,plain,
inverse(double_divide(inverse(double_divide(inverse(X),Y)),double_divide(Z,Y))) = double_divide(Z,X),
inference('REWRITE',[status(thm)],[197,212,theory(equality)]) ).
cnf(362,plain,
inverse(double_divide(inverse(X),double_divide(Y,double_divide(Z,X)))) = double_divide(inverse(double_divide(U,Y)),double_divide(U,Z)),
inference('REWRITE',[status(thm)],[203,212,theory(equality)]) ).
cnf(364,plain,
inverse(double_divide(inverse(X),Y)) = double_divide(inverse(double_divide(Z,X)),double_divide(Z,Y)),
inference('REWRITE',[status(thm)],[138,275,323,212,theory(equality)]) ).
cnf(365,plain,
inverse(double_divide(X,Y)) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[340,275,364,theory(equality)]) ).
cnf(366,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference('REWRITE',[status(thm)],[332,365,theory(equality)]) ).
cnf(368,plain,
double_divide(inverse(X),double_divide(Y,Z)) = inverse(double_divide(inverse(double_divide(Y,X)),Z)),
inference('REWRITE',[status(thm)],[355,364,theory(equality)]) ).
cnf(379,plain,
inverse(double_divide(X,double_divide(Y,double_divide(double_divide(Z,U),inverse(double_divide(Z,Y)))))) = inverse(double_divide(inverse(U),X)),
inference('REWRITE',[status(thm)],[292,364,theory(equality)]) ).
cnf(380,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = inverse(double_divide(inverse(Z),X)),
inference('REWRITE',[status(thm)],[290,379,theory(equality)]) ).
cnf(381,plain,
inverse(double_divide(inverse(X),inverse(Y))) = double_divide(X,Y),
inference('REWRITE',[status(thm)],[356,380,theory(equality)]) ).
cnf(392,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('REWRITE',[status(thm)],[331,381,theory(equality)]) ).
cnf(394,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[309,392,theory(equality)]) ).
cnf(395,plain,
double_divide(double_divide(double_divide(X,Y),Z),double_divide(Y,X)) = Z,
inference('REWRITE',[status(thm)],[341,392,theory(equality)]) ).
cnf(422,plain,
double_divide(inverse(X),Y) = inverse(double_divide(inverse(Y),X)),
inference('REWRITE',[status(thm)],[362,275,380,368,364,theory(equality)]) ).
cnf(457,plain,
double_divide(double_divide(X,Y),inverse(double_divide(X,Z))) = double_divide(inverse(Y),Z),
inference('PARAMODULATE',[status(thm)],[394,228,theory(equality)]) ).
cnf(495,plain,
double_divide(double_divide(double_divide(inverse(X),Y),Z),inverse(double_divide(inverse(Y),X))) = Z,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[395,457,theory(equality)]),364,theory(equality)]) ).
cnf(500,plain,
double_divide(double_divide(double_divide(X,Y),Z),inverse(double_divide(inverse(Y),U))) = double_divide(inverse(Z),inverse(double_divide(X,U))),
inference('PARAMODULATE',[status(thm)],[457,457,theory(equality)]) ).
cnf(501,plain,
double_divide(inverse(X),double_divide(inverse(Y),Y)) = X,
inference('REWRITE',[status(thm)],[495,422,500,theory(equality)]) ).
cnf(507,plain,
double_divide(X,inverse(X)) = double_divide(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[394,501,theory(equality)]) ).
cnf(516,plain,
inverse(double_divide(X,inverse(X))) = inverse(double_divide(Y,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[365,507,theory(equality)]) ).
cnf(517,plain,
$false,
inference('REWRITE',[status(thm)],[366,516,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP108-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n024.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 : Mon Jun 13 10:02:03 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.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:02:03
% 0.20/0.47 ; 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-13T10:02:03
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 #||
% 0.60/0.77 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.77 % SZS output start Refutation
% See solution above
% 0.60/0.79 ||#
% 0.60/0.79
% 0.60/0.79 ; Summary of computation:
% 0.60/0.79 ; 1272 formulas have been input or derived (from 34 formulas).
% 0.60/0.79 ; 517 (41%) were retained. Of these,
% 0.60/0.79 ; 377 (73%) were simplified or subsumed later,
% 0.60/0.79 ; 140 (27%) are still being kept.
% 0.60/0.79 ;
% 0.60/0.79 ; Run time in seconds excluding printing time:
% 0.60/0.79 ; 0.001 0% Read assertion file (1 call)
% 0.60/0.79 ; 0.000 0% Assert (3 calls)
% 0.60/0.79 ; 0.070 24% Process new row (1,208 calls)
% 0.60/0.79 ; 0.003 1% Resolution (66 calls)
% 0.60/0.79 ; 0.024 8% Paramodulation (33 calls)
% 0.60/0.79 ; 0.000 0% Condensing (4 calls)
% 0.60/0.79 ; 0.000 0% Forward subsumption (4 calls)
% 0.60/0.79 ; 0.002 1% Backward subsumption (4 calls)
% 0.60/0.79 ; 0.051 17% Forward simplification (1,113 calls)
% 0.60/0.79 ; 0.057 19% Backward simplification (516 calls)
% 0.60/0.79 ; 0.059 20% Ordering (7,440 calls)
% 0.60/0.79 ; 0.001 0% Sortal reasoning (32 calls)
% 0.60/0.79 ; 0.001 0% Purity testing (1 call)
% 0.60/0.79 ; 0.028 9% Other
% 0.60/0.79 ; 0.297 Total
% 0.60/0.79 ; 0.314 Real time
% 0.60/0.79 ;
% 0.60/0.79 ; Term-hash-array has 2,249 terms in all.
% 0.60/0.79 ; Feature-vector-row-index has 0 entries (1 at peak, 4 added, 4 deleted).
% 0.60/0.79 ; Feature-vector-row-index has 1 node (36 at peak, 126 added, 125 deleted).
% 0.60/0.79 ; Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.60/0.79 ; Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.60/0.79 ; Path-index has 530 entries (1,220 at peak, 2,601 added, 2,071 deleted).
% 0.60/0.79 ; Path-index has 3,306 nodes (3,805 at peak, 4,934 added, 1,628 deleted).
% 0.60/0.79 ; Trie-index has 530 entries (1,220 at peak, 2,601 added, 2,071 deleted).
% 0.60/0.79 ; Trie-index has 2,289 nodes (5,134 at peak, 10,783 added, 8,494 deleted).
% 0.60/0.79 ; Retrieved 6,237 generalization terms in 9,439 calls.
% 0.60/0.79 ; Retrieved 5,270 instance terms in 631 calls.
% 0.60/0.79 ; Retrieved 5,767 unifiable terms in 287 calls.
% 0.60/0.79 ;
% 0.60/0.79 ; The agenda of rows to process has 33 entries:
% 0.60/0.79 ; 4 with value 23 12 with value 26 3 with value 28
% 0.60/0.79 ; 13 with value 25 1 with value 27
% 0.60/0.79 ; The agenda of rows to give has 125 entries:
% 0.60/0.79 ; 3 with value (4 20) 15 with value (4 27) 2 with value (4 34)
% 0.60/0.79 ; 1 with value (4 21) 9 with value (4 28) 6 with value (4 35)
% 0.60/0.79 ; 6 with value (4 22) 7 with value (4 29) 1 with value (4 36)
% 0.60/0.79 ; 12 with value (4 23) 8 with value (4 30) 3 with value (4 37)
% 0.60/0.79 ; 8 with value (4 24) 3 with value (4 31) 2 with value (4 38)
% 0.60/0.79 ; 13 with value (4 25) 11 with value (4 32) 1 with value (4 41)
% 0.60/0.79 ; 12 with value (4 26) 2 with value (4 33)
% 0.60/0.79 Evaluation took:
% 0.60/0.79 0.314 seconds of real time
% 0.60/0.79 0.28398 seconds of user run time
% 0.60/0.79 0.029689 seconds of system run time
% 0.60/0.79 [Run times include 0.017 seconds GC run time.]
% 0.60/0.79 0 calls to %EVAL
% 0.60/0.79 0 page faults and
% 0.60/0.79 28,092,608 bytes consed.
% 0.60/0.79 :PROOF-FOUND
% 0.60/0.79 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:02:04
% 0.60/0.79 :PROOF-FOUND
% 0.60/0.79 *
%------------------------------------------------------------------------------