TSTP Solution File: GRP696-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP696-1 : TPTP v8.1.0. Released v4.0.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:40:22 EDT 2022
% Result : Unsatisfiable 163.01s 163.43s
% Output : Refutation 163.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of clauses : 85 ( 85 unt; 0 nHn; 3 RR)
% Number of literals : 85 ( 84 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 171 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(X,ld(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
ld(X,mult(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(rd(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c04,axiom,
rd(mult(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c05,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c06,axiom,
mult(unit,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c07,axiom,
mult(X,i(mult(Y,X))) = i(Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c08,axiom,
mult(X,mult(Y,Z)) = mult(rd(mult(X,Y),X),mult(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c09,axiom,
mult(mult(X,Y),Z) = mult(mult(X,Z),ld(Z,mult(Y,Z))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c10,axiom,
mult(i(X),X) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c11,axiom,
mult(X,i(X)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(goals,negated_conjecture,
mult(mult(mult(a,b),a),mult(a,c)) != mult(a,mult(mult(mult(b,a),a),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(15,plain,
ld(X,X) = unit,
inference('PARAMODULATE',[status(thm)],[c02,c05,theory(equality)]) ).
cnf(16,plain,
ld(X,unit) = i(X),
inference('PARAMODULATE',[status(thm)],[c02,c11,theory(equality)]) ).
cnf(17,plain,
i(i(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c02,c10,theory(equality)]),16,theory(equality)]) ).
cnf(19,plain,
ld(rd(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[c02,c03,theory(equality)]) ).
cnf(23,plain,
ld(X,i(Y)) = i(mult(Y,X)),
inference('PARAMODULATE',[status(thm)],[c02,c07,theory(equality)]) ).
cnf(25,plain,
mult(X,mult(Y,i(X))) = rd(mult(X,Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c08,c11,theory(equality)]),c05,theory(equality)]) ).
cnf(26,plain,
mult(X,mult(Y,Z)) = mult(mult(X,mult(Y,i(X))),mult(X,Z)),
inference('REWRITE',[status(thm)],[c08,25,theory(equality)]) ).
cnf(28,plain,
mult(mult(i(X),Y),X) = ld(X,mult(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c09,c10,theory(equality)]),c06,theory(equality)]) ).
cnf(29,plain,
mult(mult(X,i(Y)),Y) = mult(mult(X,Y),i(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c09,c10,theory(equality)]),16,theory(equality)]) ).
cnf(30,plain,
rd(mult(mult(X,Y),Z),ld(Z,mult(Y,Z))) = mult(X,Z),
inference('PARAMODULATE',[status(thm)],[c04,c09,theory(equality)]) ).
cnf(33,plain,
X = mult(mult(Y,X),ld(X,mult(i(Y),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c09,c11,theory(equality)]),c06,theory(equality)]) ).
cnf(78,plain,
mult(i(X),mult(Y,Z)) = mult(mult(i(X),mult(Y,X)),mult(i(X),Z)),
inference('PARAMODULATE',[status(thm)],[26,17,theory(equality)]) ).
cnf(79,plain,
ld(ld(X,Y),i(X)) = i(Y),
inference('PARAMODULATE',[status(thm)],[23,c01,theory(equality)]) ).
cnf(80,plain,
i(ld(X,i(Y))) = mult(Y,X),
inference('PARAMODULATE',[status(thm)],[17,23,theory(equality)]) ).
cnf(104,plain,
i(ld(X,ld(Y,X))) = ld(X,i(ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[28,17,80,theory(equality)]) ).
cnf(113,plain,
X = i(ld(ld(X,i(ld(X,Y))),ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[33,17,80,theory(equality)]) ).
cnf(114,plain,
i(ld(i(ld(X,i(Y))),Z)) = i(ld(i(ld(X,Z)),ld(i(ld(Z,i(Y))),Z))),
inference('REWRITE',[status(thm)],[78,17,80,theory(equality)]) ).
cnf(116,plain,
ld(X,i(ld(Y,i(X)))) = Y,
inference('REWRITE',[status(thm)],[c02,80,theory(equality)]) ).
cnf(121,plain,
i(ld(X,ld(i(X),i(Y)))) = i(ld(i(X),ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[29,17,80,theory(equality)]) ).
cnf(122,plain,
rd(i(ld(X,ld(Y,i(Z)))),i(ld(X,ld(Y,X)))) = i(ld(X,i(Z))),
inference('REWRITE',[status(thm)],[30,104,17,80,theory(equality)]) ).
cnf(141,plain,
i(ld(i(ld(c,i(a))),ld(a,ld(b,i(a))))) != i(ld(i(ld(c,ld(a,ld(a,i(b))))),i(a))),
inference('REWRITE',[status(thm)],[goals,17,80,theory(equality)]) ).
cnf(143,plain,
ld(X,i(Y)) = rd(i(X),Y),
inference('PARAMODULATE',[status(thm)],[116,19,theory(equality)]) ).
cnf(145,plain,
ld(ld(X,ld(Y,i(Z))),ld(X,ld(Y,X))) = i(ld(X,i(Z))),
inference('REWRITE',[status(thm)],[122,17,143,theory(equality)]) ).
cnf(151,plain,
ld(i(X),i(ld(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[116,17,theory(equality)]) ).
cnf(154,plain,
ld(ld(i(X),Y),X) = i(Y),
inference('PARAMODULATE',[status(thm)],[79,17,theory(equality)]) ).
cnf(160,plain,
i(ld(X,ld(i(Y),X))) = ld(X,i(ld(X,Y))),
inference('PARAMODULATE',[status(thm)],[104,17,theory(equality)]) ).
cnf(162,plain,
ld(ld(X,i(Y)),ld(X,ld(Y,X))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[116,104,theory(equality)]),17,theory(equality)]) ).
cnf(163,plain,
i(ld(X,ld(ld(Y,i(X)),X))) = ld(X,i(Y)),
inference('PARAMODULATE',[status(thm)],[104,116,theory(equality)]) ).
cnf(164,plain,
ld(i(ld(X,ld(Y,X))),i(X)) = ld(X,i(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[79,104,theory(equality)]),17,theory(equality)]) ).
cnf(165,plain,
i(ld(i(X),ld(ld(Y,X),i(X)))) = ld(i(X),i(Y)),
inference('PARAMODULATE',[status(thm)],[104,151,theory(equality)]) ).
cnf(174,plain,
ld(X,ld(Y,ld(ld(X,i(Y)),Y))) = Y,
inference('PARAMODULATE',[status(thm)],[162,116,theory(equality)]) ).
cnf(175,plain,
ld(X,ld(i(Y),ld(ld(X,Y),i(Y)))) = i(Y),
inference('PARAMODULATE',[status(thm)],[162,151,theory(equality)]) ).
cnf(200,plain,
i(X) = ld(ld(X,i(ld(X,Y))),ld(X,i(Y))),
inference('PARAMODULATE',[status(thm)],[17,113,theory(equality)]) ).
cnf(202,plain,
i(ld(X,i(ld(X,Y)))) = ld(X,ld(i(Y),X)),
inference('PARAMODULATE',[status(thm)],[17,160,theory(equality)]) ).
cnf(207,plain,
i(X) = ld(i(ld(X,ld(Y,X))),ld(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,104,theory(equality)]),17,theory(equality)]) ).
cnf(208,plain,
ld(i(ld(X,i(Y))),X) = ld(X,i(ld(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,200,theory(equality)]),17,theory(equality)]) ).
cnf(212,plain,
i(ld(i(ld(X,i(Y))),Z)) = i(ld(i(ld(X,Z)),ld(Z,i(ld(Z,Y))))),
inference('REWRITE',[status(thm)],[114,208,theory(equality)]) ).
cnf(232,plain,
X = ld(ld(i(X),i(Y)),ld(i(X),ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,151,theory(equality)]),17,theory(equality)]) ).
cnf(234,plain,
i(ld(X,Y)) = ld(ld(ld(X,Y),Y),ld(ld(X,Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,79,theory(equality)]),17,theory(equality)]) ).
cnf(240,plain,
ld(i(X),ld(X,ld(Y,X))) = i(ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[154,207,theory(equality)]) ).
cnf(241,plain,
ld(i(ld(X,Y)),X) = i(ld(X,ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,207,theory(equality)]),17,theory(equality)]) ).
cnf(251,plain,
i(ld(i(X),Y)) = ld(i(ld(ld(i(X),Y),ld(X,ld(i(X),Y)))),i(Y)),
inference('PARAMODULATE',[status(thm)],[207,154,theory(equality)]) ).
cnf(264,plain,
X = ld(Y,ld(i(X),ld(ld(Y,X),X))),
inference('PARAMODULATE',[status(thm)],[232,151,theory(equality)]) ).
cnf(280,plain,
ld(X,ld(ld(Y,i(X)),X)) = i(ld(X,i(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[232,174,theory(equality)]),234,163,theory(equality)]) ).
cnf(284,plain,
ld(X,ld(i(X),i(Y))) = i(ld(i(X),ld(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[240,79,theory(equality)]),17,theory(equality)]) ).
cnf(285,plain,
ld(i(X),ld(X,Y)) = i(ld(i(X),ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[121,17,284,theory(equality)]) ).
cnf(306,plain,
i(ld(X,i(ld(X,Y)))) = i(ld(ld(i(Y),X),ld(Y,ld(i(Y),X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[241,154,theory(equality)]),202,17,theory(equality)]) ).
cnf(307,plain,
i(ld(i(X),Y)) = ld(i(ld(Y,i(ld(Y,X)))),i(Y)),
inference('REWRITE',[status(thm)],[251,306,theory(equality)]) ).
cnf(318,plain,
ld(X,i(Y)) = i(ld(i(X),ld(ld(Y,X),X))),
inference('PARAMODULATE',[status(thm)],[79,264,theory(equality)]) ).
cnf(336,plain,
ld(i(X),ld(ld(Y,X),X)) = i(ld(X,i(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[232,264,theory(equality)]),234,318,theory(equality)]) ).
cnf(340,plain,
i(ld(i(X),ld(X,Y))) = ld(i(X),ld(X,i(Y))),
inference('PARAMODULATE',[status(thm)],[17,285,theory(equality)]) ).
cnf(347,plain,
ld(i(ld(X,i(Y))),ld(i(X),ld(X,Y))) = i(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,340,theory(equality)]),17,theory(equality)]) ).
cnf(360,plain,
ld(i(ld(X,i(Y))),i(X)) = ld(X,i(ld(i(X),Y))),
inference('PARAMODULATE',[status(thm)],[164,154,theory(equality)]) ).
cnf(361,plain,
i(ld(i(X),Y)) = ld(Y,i(ld(i(Y),ld(Y,X)))),
inference('REWRITE',[status(thm)],[307,360,theory(equality)]) ).
cnf(362,plain,
ld(i(ld(i(X),i(Y))),X) = ld(i(X),i(ld(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[164,79,theory(equality)]),17,theory(equality)]) ).
cnf(366,plain,
i(ld(i(X),Y)) = i(ld(i(Y),i(ld(Y,ld(X,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[240,164,theory(equality)]),361,340,17,theory(equality)]) ).
cnf(386,plain,
ld(i(X),ld(ld(Y,X),i(X))) = i(ld(i(X),i(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[232,175,theory(equality)]),234,165,theory(equality)]) ).
cnf(492,plain,
ld(i(X),i(ld(X,Y))) = i(ld(ld(Y,X),i(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[154,280,theory(equality)]),17,362,theory(equality)]) ).
cnf(493,plain,
i(ld(i(X),Y)) = ld(ld(ld(X,Y),Y),i(Y)),
inference('REWRITE',[status(thm)],[366,17,492,theory(equality)]) ).
cnf(566,plain,
ld(X,i(ld(X,Y))) = i(ld(ld(Y,X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[154,336,theory(equality)]),17,202,241,theory(equality)]) ).
cnf(604,plain,
i(ld(i(ld(X,i(Y))),Z)) = i(ld(i(ld(X,Z)),i(ld(ld(Y,Z),Z)))),
inference('REWRITE',[status(thm)],[212,566,theory(equality)]) ).
cnf(620,plain,
ld(ld(X,Y),Y) = ld(Y,ld(i(X),Y)),
inference('REWRITE',[status(thm)],[202,17,566,theory(equality)]) ).
cnf(653,plain,
ld(i(ld(X,Y)),Y) = i(ld(Y,ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[336,241,theory(equality)]),17,493,492,241,theory(equality)]) ).
cnf(980,plain,
ld(i(ld(i(X),ld(Y,X))),ld(X,Y)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[347,151,theory(equality)]),17,theory(equality)]) ).
cnf(1021,plain,
ld(i(ld(X,Y)),i(X)) = i(ld(i(X),ld(Y,X))),
inference('PARAMODULATE',[status(thm)],[151,980,theory(equality)]) ).
cnf(1091,plain,
i(ld(i(ld(i(X),Y)),X)) = ld(ld(i(Y),X),i(X)),
inference('PARAMODULATE',[status(thm)],[493,154,theory(equality)]) ).
cnf(1291,plain,
ld(i(ld(i(X),Y)),X) = i(ld(X,ld(Y,i(X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[280,653,theory(equality)]),17,154,620,theory(equality)]) ).
cnf(1297,plain,
ld(X,ld(Y,i(X))) = ld(ld(i(Y),X),i(X)),
inference('REWRITE',[status(thm)],[1091,17,1291,theory(equality)]) ).
cnf(1491,plain,
ld(ld(X,ld(Y,Z)),ld(X,ld(Y,X))) = i(ld(X,Z)),
inference('PARAMODULATE',[status(thm)],[145,17,theory(equality)]) ).
cnf(1493,plain,
ld(i(ld(X,ld(Y,X))),ld(X,Z)) = ld(X,ld(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,1491,theory(equality)]),17,theory(equality)]) ).
cnf(3014,plain,
ld(ld(i(X),i(Y)),ld(i(X),Z)) = ld(i(X),ld(ld(Y,X),Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1493,386,theory(equality)]),17,theory(equality)]) ).
cnf(37586,plain,
i(ld(i(ld(X,ld(Y,Z))),i(Y))) = i(ld(i(ld(X,i(Y))),i(ld(i(Y),i(Z))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[604,1021,theory(equality)]),16,15,3014,241,17,theory(equality)]) ).
cnf(37587,plain,
$false,
inference('REWRITE',[status(thm)],[141,17,1297,492,37586,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP696-1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 14:24:38 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.49 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.50 *
% 0.22/0.50 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.50 *
% 0.22/0.50 "."
% 0.22/0.50 *
% 0.22/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T14:24:38
% 0.22/0.50 ; 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-13T14:24:38
% 0.22/0.52
% 0.22/0.52 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.22/0.52 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.22/0.52 ; Recognized possible left inverse assertion (= (|mult| (|i| ?X) ?X) |unit|).
% 163.01/163.43 ; Recognized possible right inverse assertion (= (|mult| ?X (|i| ?X)) |unit|).
% 163.01/163.43
% 163.01/163.43 #||
% 163.01/163.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 163.01/163.43 % SZS output start Refutation
% See solution above
% 163.01/163.44 ||#
% 163.01/163.44
% 163.01/163.44 ; Summary of computation:
% 163.01/163.44 ; 104736 formulas have been input or derived (from 307 formulas).
% 163.01/163.44 ; 37587 (36%) were retained. Of these,
% 163.01/163.44 ; 8939 (24%) were simplified or subsumed later,
% 163.01/163.44 ; 28648 (76%) are still being kept.
% 163.01/163.44 ;
% 163.01/163.44 ; Run time in seconds excluding printing time:
% 163.01/163.44 ; 0.002 0% Read assertion file (1 call)
% 163.01/163.44 ; 0.001 0% Assert (12 calls)
% 163.01/163.44 ; 8.999 6% Process new row (103,504 calls)
% 163.01/163.44 ; 0.306 0% Resolution (612 calls)
% 163.01/163.44 ; 4.221 3% Paramodulation (306 calls)
% 163.01/163.44 ; 47.588 29% Forward simplification (100,387 calls)
% 163.01/163.44 ; 13.492 8% Backward simplification (37,587 calls)
% 163.01/163.44 ; 87.598 54% Ordering (3,735,022 calls)
% 163.01/163.44 ; 0.000 0% Sortal reasoning (32 calls)
% 163.01/163.44 ; 0.000 0% Purity testing (1 call)
% 163.01/163.44 ; 0.539 0% Other
% 163.01/163.44 ; 162.746 Total
% 163.01/163.44 ; 162.934 Real time
% 163.10/163.45 ;
% 163.10/163.45 ; Term-hash-array has 107,047 terms in all.
% 163.10/163.45 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 163.10/163.45 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 163.10/163.45 ; Path-index has 85,886 entries (85,905 at peak, 109,721 added, 23,835 deleted).
% 163.10/163.45 ; Path-index has 12,291 nodes (12,348 at peak, 14,420 added, 2,129 deleted).
% 163.10/163.45 ; Trie-index has 85,886 entries (85,905 at peak, 109,721 added, 23,835 deleted).
% 163.10/163.45 ; Trie-index has 728,830 nodes (728,965 at peak, 925,184 added, 196,354 deleted).
% 163.10/163.45 ; Retrieved 15,924,824 generalization terms in 2,385,950 calls.
% 163.10/163.45 ; Retrieved 1,999,031 instance terms in 47,871 calls.
% 163.10/163.45 ; Retrieved 924,390 unifiable terms in 2,520 calls.
% 163.10/163.45 ;
% 163.10/163.45 ; The agenda of rows to process has 1023 entries:
% 163.10/163.45 ; 5 with value 45 30 with value 58 3 with value 70
% 163.10/163.45 ; 68 with value 46 44 with value 59 1 with value 72
% 163.10/163.45 ; 48 with value 47 57 with value 60 2 with value 73
% 163.10/163.45 ; 43 with value 48 72 with value 61 2 with value 74
% 163.10/163.45 ; 62 with value 49 24 with value 62 3 with value 75
% 163.10/163.45 ; 37 with value 50 23 with value 63 4 with value 76
% 163.10/163.45 ; 42 with value 51 19 with value 64 2 with value 77
% 163.10/163.45 ; 59 with value 52 53 with value 65 1 with value 78
% 163.10/163.45 ; 45 with value 53 14 with value 66 1 with value 84
% 163.10/163.45 ; 33 with value 54 23 with value 67 2 with value 85
% 163.10/163.45 ; 61 with value 55 15 with value 68 1 with value 88
% 163.10/163.45 ; 42 with value 56 33 with value 69 2 with value 90
% 163.10/163.45 ; 47 with value 57
% 163.10/163.45 ; The agenda of rows to give has 28426 entries:
% 163.10/163.45 ; 118 with value (4 29) 1226 with value (4 47) 57 with value (4 65)
% 163.10/163.45 ; 196 with value (4 30) 1209 with value (4 48) 74 with value (4 66)
% 163.10/163.45 ; 250 with value (4 31) 1384 with value (4 49) 65 with value (4 67)
% 163.10/163.45 ; 281 with value (4 32) 1448 with value (4 50) 57 with value (4 68)
% 163.10/163.45 ; 347 with value (4 33) 1548 with value (4 51) 25 with value (4 69)
% 163.10/163.45 ; 420 with value (4 34) 1183 with value (4 52) 20 with value (4 70)
% 163.10/163.45 ; 694 with value (4 35) 1073 with value (4 53) 29 with value (4 71)
% 163.10/163.45 ; 805 with value (4 36) 889 with value (4 54) 16 with value (4 72)
% 163.10/163.45 ; 896 with value (4 37) 649 with value (4 55) 6 with value (4 73)
% 163.10/163.45 ; 1132 with value (4 38) 481 with value (4 56) 9 with value (4 74)
% 163.10/163.45 ; 1120 with value (4 39) 287 with value (4 57) 9 with value (4 75)
% 163.10/163.45 ; 1396 with value (4 40) 254 with value (4 58) 4 with value (4 76)
% 163.10/163.45 ; 1367 with value (4 41) 245 with value (4 59) 3 with value (4 77)
% 163.10/163.45 ; 1502 with value (4 42) 145 with value (4 60) 3 with value (4 78)
% 163.10/163.45 ; 1261 with value (4 43) 123 with value (4 61) 4 with value (4 80)
% 163.10/163.45 ; 1295 with value (4 44) 102 with value (4 62) 2 with value (4 81)
% 163.10/163.45 ; 1318 with value (4 45) 89 with value (4 63) 1 with value (4 84)
% 163.10/163.45 ; 1215 with value (4 46) 92 with value (4 64) 2 with value (4 85)
% 163.10/163.45 Evaluation took:
% 163.10/163.45 162.942 seconds of real time
% 163.10/163.45 153.70288 seconds of user run time
% 163.10/163.45 9.061566 seconds of system run time
% 163.10/163.45 [Run times include 36.417 seconds GC run time.]
% 163.10/163.45 0 calls to %EVAL
% 163.10/163.45 0 page faults and
% 163.10/163.45 6,598,275,512 bytes consed.
% 163.10/163.45 :PROOF-FOUND
% 163.10/163.45 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T14:27:21
% 163.10/163.45 :PROOF-FOUND
% 163.10/163.45 *
%------------------------------------------------------------------------------