%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP109-1 : TPTP v8.1.0. Bugfixed v2.7.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:36:11 EDT 2022
% Result : Unsatisfiable 0.47s 0.68s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 3
% Syntax : Number of clauses : 73 ( 68 unt; 0 nHn; 7 RR)
% Number of literals : 85 ( 84 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 11 ( 3 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 : 212 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(X,inverse(double_divide(inverse(Y),double_divide(X,Z))))),Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox2/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/sandbox2/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,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(U,inverse(double_divide(inverse(Y),double_divide(U,double_divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(double_divide(inverse(Y),double_divide(X,Z))))),inverse(double_divide(inverse(U),Y)))),Z) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),double_divide(X,Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(12,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(Y,inverse(X))),double_divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(14,plain,
double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(double_divide(Z,inverse(double_divide(inverse(X),double_divide(Z,inverse(U)))))),Y)) = U,
inference('PARAMODULATE',[status(thm)],[7,single_axiom,theory(equality)]) ).
cnf(19,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),inverse(U))),double_divide(X,Z)) = double_divide(V,inverse(double_divide(inverse(U),double_divide(V,Y)))),
inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]) ).
cnf(21,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),X) = Z,
inference('PARAMODULATE',[status(thm)],[12,single_axiom,theory(equality)]) ).
cnf(31,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(U,double_divide(U,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(36,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(U))))),U))),X) = Y,
inference('PARAMODULATE',[status(thm)],[21,21,theory(equality)]) ).
cnf(37,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),inverse(U))),X)),Z) = U,
inference('PARAMODULATE',[status(thm)],[7,21,theory(equality)]) ).
cnf(38,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(U))))),inverse(X))),U)) = Y,
inference('PARAMODULATE',[status(thm)],[12,21,theory(equality)]) ).
cnf(42,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(inverse(double_divide(Z,inverse(U))),V)))),X) = double_divide(inverse(U),double_divide(Y,double_divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[21,5,theory(equality)]) ).
cnf(50,plain,
double_divide(inverse(double_divide(X,inverse(Y))),inverse(Z)) = double_divide(inverse(double_divide(X,double_divide(U,double_divide(U,inverse(Y))))),double_divide(V,double_divide(V,inverse(Z)))),
inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]) ).
cnf(53,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(U,double_divide(U,inverse(V))))),V)),
inference('PARAMODULATE',[status(thm)],[31,21,theory(equality)]) ).
cnf(61,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),inverse(U))),double_divide(X,Z)) = double_divide(inverse(Y),double_divide(V,double_divide(V,inverse(U)))),
inference('PARAMODULATE',[status(thm)],[31,7,theory(equality)]) ).
cnf(68,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),inverse(Z))),U) = double_divide(inverse(double_divide(inverse(double_divide(X,U)),inverse(Y))),inverse(Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]),50,theory(equality)]) ).
cnf(73,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,Y)),inverse(double_divide(inverse(Z),double_divide(X,Y))))),inverse(double_divide(inverse(U),Z))) = U,
inference('REWRITE',[status(thm)],[6,68,theory(equality)]) ).
cnf(75,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(inverse(double_divide(U,inverse(V))),double_divide(inverse(double_divide(U,inverse(Y))),double_divide(W,double_divide(W,inverse(V)))))),
inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]) ).
cnf(80,plain,
double_divide(inverse(double_divide(inverse(X),inverse(double_divide(inverse(Y),X)))),inverse(double_divide(inverse(Z),Y))) = Z,
inference('PARAMODULATE',[status(thm)],[73,73,theory(equality)]) ).
cnf(81,plain,
double_divide(inverse(X),double_divide(inverse(Y),inverse(double_divide(inverse(X),Z)))) = double_divide(inverse(Z),Y),
inference('PARAMODULATE',[status(thm)],[7,80,theory(equality)]) ).
cnf(82,plain,
double_divide(inverse(double_divide(inverse(X),inverse(double_divide(inverse(Y),X)))),inverse(Z)) = double_divide(U,inverse(double_divide(inverse(Z),double_divide(U,Y)))),
inference('PARAMODULATE',[status(thm)],[80,single_axiom,theory(equality)]) ).
cnf(83,plain,
double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(double_divide(inverse(Z),inverse(double_divide(inverse(U),Z)))),Y)) = double_divide(inverse(X),U),
inference('PARAMODULATE',[status(thm)],[7,80,theory(equality)]) ).
cnf(90,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),double_divide(X,inverse(Z)))),inverse(Z))),inverse(double_divide(inverse(U),Y))) = U,
inference('PARAMODULATE',[status(thm)],[80,12,theory(equality)]) ).
cnf(94,plain,
double_divide(inverse(double_divide(inverse(X),inverse(double_divide(inverse(inverse(double_divide(inverse(Y),Z))),X)))),inverse(Y)) = double_divide(inverse(U),inverse(double_divide(inverse(Z),U))),
inference('PARAMODULATE',[status(thm)],[80,80,theory(equality)]) ).
cnf(105,plain,
double_divide(inverse(X),double_divide(inverse(Y),Z)) = double_divide(inverse(double_divide(inverse(Z),inverse(X))),Y),
inference('PARAMODULATE',[status(thm)],[12,81,theory(equality)]) ).
cnf(106,plain,
double_divide(inverse(X),double_divide(inverse(X),double_divide(inverse(Y),double_divide(inverse(inverse(Z)),double_divide(U,double_divide(U,inverse(Y))))))) = Z,
inference('REWRITE',[status(thm)],[38,105,theory(equality)]) ).
cnf(107,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(inverse(Y),double_divide(inverse(Y),double_divide(Z,double_divide(Z,inverse(U))))))),U) = X,
inference('REWRITE',[status(thm)],[37,105,theory(equality)]) ).
cnf(112,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(Y,Z)),double_divide(inverse(double_divide(Y,inverse(U))),Z))) = double_divide(V,inverse(double_divide(inverse(X),double_divide(V,U)))),
inference('REWRITE',[status(thm)],[19,105,theory(equality)]) ).
cnf(113,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(Y,Z)),double_divide(inverse(double_divide(Y,inverse(U))),Z))) = double_divide(inverse(U),double_divide(V,double_divide(V,inverse(X)))),
inference('REWRITE',[status(thm)],[61,105,theory(equality)]) ).
cnf(116,plain,
double_divide(inverse(double_divide(inverse(inverse(double_divide(inverse(X),Y))),Z)),double_divide(inverse(inverse(X)),Z)) = double_divide(inverse(U),inverse(double_divide(inverse(Y),U))),
inference('REWRITE',[status(thm)],[94,105,theory(equality)]) ).
cnf(117,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(inverse(Y),Z))),X) = double_divide(inverse(Z),Y),
inference('PARAMODULATE',[status(thm)],[21,81,theory(equality)]) ).
cnf(118,plain,
double_divide(inverse(X),double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(X))))) = Y,
inference('REWRITE',[status(thm)],[36,117,theory(equality)]) ).
cnf(119,plain,
double_divide(inverse(X),double_divide(inverse(X),Y)) = Y,
inference('REWRITE',[status(thm)],[106,118,theory(equality)]) ).
cnf(121,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),Z) = X,
inference('REWRITE',[status(thm)],[107,119,theory(equality)]) ).
cnf(122,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),inverse(Y)),
inference('REWRITE',[status(thm)],[53,121,theory(equality)]) ).
cnf(126,plain,
double_divide(inverse(X),inverse(double_divide(inverse(Y),X))) = Y,
inference('REWRITE',[status(thm)],[90,7,122,theory(equality)]) ).
cnf(131,plain,
double_divide(inverse(double_divide(inverse(inverse(double_divide(inverse(X),Y))),Z)),double_divide(inverse(inverse(X)),Z)) = Y,
inference('REWRITE',[status(thm)],[116,126,theory(equality)]) ).
cnf(133,plain,
double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(Z),Y)) = double_divide(inverse(X),Z),
inference('REWRITE',[status(thm)],[83,126,theory(equality)]) ).
cnf(134,plain,
double_divide(inverse(X),double_divide(Y,inverse(double_divide(inverse(X),double_divide(Y,inverse(Z)))))) = Z,
inference('REWRITE',[status(thm)],[14,133,theory(equality)]) ).
cnf(136,plain,
double_divide(inverse(inverse(double_divide(inverse(X),Y))),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[131,133,theory(equality)]) ).
cnf(137,plain,
double_divide(inverse(X),inverse(Y)) = double_divide(Z,inverse(double_divide(inverse(Y),double_divide(Z,X)))),
inference('REWRITE',[status(thm)],[82,126,theory(equality)]) ).
cnf(138,plain,
double_divide(inverse(X),double_divide(inverse(inverse(Y)),inverse(X))) = Y,
inference('REWRITE',[status(thm)],[134,137,theory(equality)]) ).
cnf(140,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(Y,Z)),double_divide(inverse(double_divide(Y,inverse(U))),Z))) = double_divide(inverse(U),inverse(X)),
inference('REWRITE',[status(thm)],[112,137,theory(equality)]) ).
cnf(142,plain,
double_divide(inverse(X),inverse(Y)) = double_divide(inverse(X),double_divide(Z,double_divide(Z,inverse(Y)))),
inference('REWRITE',[status(thm)],[113,140,theory(equality)]) ).
cnf(150,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(Y),inverse(double_divide(X,Z))),
inference('REWRITE',[status(thm)],[75,140,142,theory(equality)]) ).
cnf(174,plain,
inverse(double_divide(inverse(X),Y)) = double_divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[81,119,theory(equality)]) ).
cnf(176,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(Y,inverse(Z))),U))) = double_divide(inverse(Z),double_divide(X,double_divide(Y,U))),
inference('REWRITE',[status(thm)],[42,119,174,theory(equality)]) ).
cnf(178,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[12,119,176,theory(equality)]) ).
cnf(180,plain,
double_divide(inverse(X),double_divide(Y,inverse(X))) = Y,
inference('REWRITE',[status(thm)],[138,178,theory(equality)]) ).
cnf(189,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)))) != double_divide(inverse(a3),double_divide(c3,b3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[4,178,174,theory(equality)]) ).
cnf(190,plain,
inverse(double_divide(X,inverse(double_divide(inverse(X),Y)))) = Y,
inference('REWRITE',[status(thm)],[136,178,174,theory(equality)]) ).
cnf(192,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[119,178,theory(equality)]) ).
cnf(194,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[180,178,theory(equality)]) ).
cnf(195,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[194,194,theory(equality)]) ).
cnf(196,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[195,192,theory(equality)]) ).
cnf(198,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)))) != double_divide(inverse(a3),double_divide(c3,b3)) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[189,196,theory(equality)]),theory(equality)]) ).
cnf(199,plain,
double_divide(inverse(X),inverse(double_divide(Y,X))) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[126,178,theory(equality)]) ).
cnf(200,plain,
inverse(X) = double_divide(Y,inverse(double_divide(inverse(Y),X))),
inference('PARAMODULATE',[status(thm)],[178,190,theory(equality)]) ).
cnf(201,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[195,199,theory(equality)]) ).
cnf(207,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = inverse(double_divide(Y,double_divide(X,Z))),
inference('REWRITE',[status(thm)],[150,201,theory(equality)]) ).
cnf(222,plain,
double_divide(inverse(X),double_divide(inverse(Y),Z)) = double_divide(double_divide(Z,X),Y),
inference('REWRITE',[status(thm)],[105,178,201,theory(equality)]) ).
cnf(239,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[200,194,theory(equality)]) ).
cnf(246,plain,
( double_divide(a1,inverse(a1)) != double_divide(b1,inverse(b1))
| double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(inverse(a3),double_divide(c3,b3)) ),
inference('REWRITE',[status(thm)],[198,178,195,201,207,239,theory(equality)]) ).
cnf(269,plain,
double_divide(double_divide(inverse(X),X),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[194,222,theory(equality)]) ).
cnf(270,plain,
double_divide(inverse(X),double_divide(Y,Z)) = double_divide(double_divide(Z,X),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[222,178,theory(equality)]) ).
cnf(273,plain,
double_divide(a1,inverse(a1)) != double_divide(b1,inverse(b1)),
inference('REWRITE',[status(thm)],[246,270,theory(equality)]) ).
cnf(318,plain,
double_divide(X,inverse(X)) = double_divide(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[194,269,theory(equality)]) ).
cnf(325,plain,
double_divide(X,inverse(X)) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[318,318,theory(equality)]) ).
cnf(326,plain,
$false,
inference('REWRITE',[status(thm)],[273,325,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP109-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n004.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 00:38:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T00:38:39
% 0.19/0.47 ; 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-14T00:38:39
% 0.47/0.68
% 0.47/0.68
% 0.47/0.68 #||
% 0.47/0.68 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.68 % SZS output start Refutation
% See solution above
% 0.52/0.69 ||#
% 0.52/0.69
% 0.52/0.69 ; Summary of computation:
% 0.52/0.69 ; 771 formulas have been input or derived (from 32 formulas).
% 0.52/0.69 ; 326 (42%) were retained. Of these,
% 0.52/0.69 ; 209 (64%) were simplified or subsumed later,
% 0.52/0.69 ; 117 (36%) are still being kept.
% 0.52/0.69 ;
% 0.52/0.69 ; Run time in seconds excluding printing time:
% 0.52/0.69 ; 0.002 1% Read assertion file (1 call)
% 0.52/0.69 ; 0.000 0% Assert (3 calls)
% 0.52/0.69 ; 0.039 19% Process new row (708 calls)
% 0.52/0.69 ; 0.001 0% Resolution (62 calls)
% 0.52/0.69 ; 0.017 8% Paramodulation (31 calls)
% 0.52/0.69 ; 0.000 0% Condensing (4 calls)
% 0.52/0.69 ; 0.000 0% Forward subsumption (4 calls)
% 0.52/0.69 ; 0.000 0% Backward subsumption (4 calls)
% 0.52/0.69 ; 0.000 0% Clause clause subsumption (1 call)
% 0.52/0.69 ; 0.023 11% Forward simplification (591 calls)
% 0.52/0.69 ; 0.038 18% Backward simplification (325 calls)
% 0.52/0.69 ; 0.063 30% Ordering (6,114 calls)
% 0.52/0.69 ; 0.000 0% Sortal reasoning (32 calls)
% 0.52/0.69 ; 0.000 0% Purity testing (1 call)
% 0.52/0.69 ; 0.025 12% Other
% 0.52/0.69 ; 0.208 Total
% 0.52/0.69 ; 0.224 Real time
% 0.52/0.69 ;
% 0.52/0.69 ; Term-hash-array has 1,312 terms in all.
% 0.52/0.69 ; Feature-vector-row-index has 0 entries (1 at peak, 4 added, 4 deleted).
% 0.52/0.69 ; Feature-vector-row-index has 1 node (36 at peak, 123 added, 122 deleted).
% 0.52/0.69 ; Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.52/0.69 ; Retrieved 1 possibly backward subsumed row in 4 calls.
% 0.52/0.69 ; Path-index has 450 entries (644 at peak, 1,546 added, 1,096 deleted).
% 0.52/0.69 ; Path-index has 1,489 nodes (1,506 at peak, 2,271 added, 782 deleted).
% 0.52/0.69 ; Trie-index has 450 entries (644 at peak, 1,546 added, 1,096 deleted).
% 0.52/0.69 ; Trie-index has 1,702 nodes (2,985 at peak, 6,591 added, 4,889 deleted).
% 0.52/0.69 ; Retrieved 3,759 generalization terms in 4,339 calls.
% 0.52/0.69 ; Retrieved 3,780 instance terms in 486 calls.
% 0.52/0.69 ; Retrieved 3,735 unifiable terms in 293 calls.
% 0.52/0.69 ;
% 0.52/0.69 ; The agenda of rows to process has 43 entries:
% 0.52/0.69 ; 2 with value 19 1 with value 23 6 with value 26
% 0.52/0.69 ; 11 with value 20 7 with value 24 1 with value 27
% 0.52/0.69 ; 7 with value 21 7 with value 25 1 with value 28
% 0.52/0.69 ; The agenda of rows to give has 102 entries:
% 0.52/0.69 ; 3 with value (4 19) 6 with value (4 26) 3 with value (4 33)
% 0.52/0.69 ; 1 with value (4 20) 16 with value (4 27) 2 with value (4 34)
% 0.52/0.69 ; 4 with value (4 21) 6 with value (4 28) 2 with value (4 35)
% 0.52/0.69 ; 5 with value (4 22) 5 with value (4 29) 1 with value (4 36)
% 0.52/0.69 ; 7 with value (4 23) 9 with value (4 30) 1 with value (4 37)
% 0.52/0.69 ; 6 with value (4 24) 4 with value (4 31) 2 with value (4 38)
% 0.52/0.69 ; 14 with value (4 25) 4 with value (4 32) 1 with value (4 43)
% 0.52/0.69 Evaluation took:
% 0.52/0.69 0.225 seconds of real time
% 0.52/0.69 0.205575 seconds of user run time
% 0.52/0.69 0.01873 seconds of system run time
% 0.52/0.69 [Run times include 0.007 seconds GC run time.]
% 0.52/0.69 0 calls to %EVAL
% 0.52/0.69 0 page faults and
% 0.52/0.69 20,747,144 bytes consed.
% 0.52/0.69 :PROOF-FOUND
% 0.52/0.69 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T00:38:39
% 0.52/0.69 :PROOF-FOUND
% 0.52/0.69 *
%------------------------------------------------------------------------------