TSTP Solution File: GRP205-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP205-1 : TPTP v8.1.0. Released v2.3.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:37:32 EDT 2022
% Result : Unsatisfiable 4.17s 4.35s
% Output : Refutation 4.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of clauses : 77 ( 77 unt; 0 nHn; 5 RR)
% Number of literals : 77 ( 76 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 139 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
cnf(right_identity,axiom,
multiply(X,identity) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).
cnf(multiply_left_division,axiom,
multiply(X,left_division(X,Y)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_left_division) ).
cnf(left_division_multiply,axiom,
left_division(X,multiply(X,Y)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_division_multiply) ).
cnf(multiply_right_division,axiom,
multiply(right_division(X,Y),Y) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_right_division) ).
cnf(right_division_multiply,axiom,
right_division(multiply(X,Y),Y) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_division_multiply) ).
cnf(right_inverse,axiom,
multiply(X,right_inverse(X)) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_inverse) ).
cnf(left_inverse,axiom,
multiply(left_inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
cnf(moufang3,axiom,
multiply(multiply(multiply(X,Y),X),Z) = multiply(X,multiply(Y,multiply(X,Z))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',moufang3) ).
cnf(prove_moufang4,negated_conjecture,
multiply(x,multiply(multiply(y,z),x)) != multiply(multiply(x,y),multiply(z,x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_moufang4) ).
cnf(15,plain,
left_division(X,identity) = right_inverse(X),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,right_inverse,theory(equality)]) ).
cnf(16,plain,
right_inverse(left_inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_division_multiply,left_inverse,theory(equality)]),15,theory(equality)]) ).
cnf(19,plain,
right_division(X,X) = identity,
inference('PARAMODULATE',[status(thm)],[right_division_multiply,left_identity,theory(equality)]) ).
cnf(22,plain,
right_division(X,left_division(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[right_division_multiply,multiply_left_division,theory(equality)]) ).
cnf(23,plain,
multiply(X,multiply(Y,X)) = multiply(multiply(X,Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[right_identity,moufang3,theory(equality)]),right_identity,theory(equality)]) ).
cnf(24,plain,
multiply(multiply(X,X),Y) = multiply(X,multiply(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[moufang3,right_identity,theory(equality)]),left_identity,theory(equality)]) ).
cnf(25,plain,
multiply(X,Y) = multiply(X,multiply(right_inverse(X),multiply(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[moufang3,right_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(27,plain,
multiply(multiply(X,Y),Z) = multiply(Y,multiply(left_division(Y,X),multiply(Y,Z))),
inference('PARAMODULATE',[status(thm)],[moufang3,multiply_left_division,theory(equality)]) ).
cnf(28,plain,
multiply(multiply(multiply(X,Y),X),left_division(X,Z)) = multiply(X,multiply(Y,Z)),
inference('PARAMODULATE',[status(thm)],[moufang3,multiply_left_division,theory(equality)]) ).
cnf(35,plain,
multiply(multiply(multiply(left_inverse(X),Y),left_inverse(X)),X) = multiply(left_inverse(X),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[moufang3,left_inverse,theory(equality)]),right_identity,theory(equality)]) ).
cnf(45,plain,
X = multiply(multiply(X,left_inverse(X)),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[23,left_inverse,theory(equality)]),right_identity,theory(equality)]) ).
cnf(48,plain,
left_division(X,multiply(multiply(X,Y),X)) = multiply(Y,X),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,23,theory(equality)]) ).
cnf(50,plain,
left_division(multiply(X,Y),multiply(X,multiply(Y,X))) = X,
inference('PARAMODULATE',[status(thm)],[left_division_multiply,23,theory(equality)]) ).
cnf(73,plain,
identity = multiply(X,left_inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[right_division_multiply,45,theory(equality)]),19,theory(equality)]) ).
cnf(74,plain,
right_inverse(X) = left_inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_division_multiply,73,theory(equality)]),15,theory(equality)]) ).
cnf(75,plain,
left_inverse(left_inverse(X)) = X,
inference('REWRITE',[status(thm)],[16,74,theory(equality)]) ).
cnf(77,plain,
multiply(X,Y) = multiply(X,multiply(left_inverse(X),multiply(X,Y))),
inference('REWRITE',[status(thm)],[25,74,theory(equality)]) ).
cnf(79,plain,
multiply(multiply(X,X),left_division(X,Y)) = multiply(X,Y),
inference('PARAMODULATE',[status(thm)],[24,multiply_left_division,theory(equality)]) ).
cnf(84,plain,
multiply(multiply(X,X),left_inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,73,theory(equality)]),right_identity,theory(equality)]) ).
cnf(108,plain,
right_division(X,left_inverse(X)) = multiply(X,X),
inference('PARAMODULATE',[status(thm)],[right_division_multiply,84,theory(equality)]) ).
cnf(123,plain,
right_division(left_inverse(X),X) = multiply(left_inverse(X),left_inverse(X)),
inference('PARAMODULATE',[status(thm)],[108,75,theory(equality)]) ).
cnf(147,plain,
X = multiply(left_inverse(X),multiply(X,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[48,84,theory(equality)]),50,theory(equality)]) ).
cnf(153,plain,
left_division(left_inverse(X),X) = multiply(X,X),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,147,theory(equality)]) ).
cnf(155,plain,
right_division(left_inverse(X),X) = left_division(X,left_inverse(X)),
inference('REWRITE',[status(thm)],[123,75,153,theory(equality)]) ).
cnf(169,plain,
multiply(left_division(left_inverse(X),X),left_division(X,Y)) = multiply(X,Y),
inference('REWRITE',[status(thm)],[79,153,theory(equality)]) ).
cnf(183,plain,
right_division(X,left_inverse(X)) = left_division(left_inverse(X),X),
inference('REWRITE',[status(thm)],[108,153,theory(equality)]) ).
cnf(228,plain,
X = multiply(Y,multiply(left_inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[77,multiply_left_division,theory(equality)]) ).
cnf(229,plain,
left_division(X,Y) = multiply(left_inverse(X),Y),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,228,theory(equality)]) ).
cnf(231,plain,
multiply(multiply(left_division(X,Y),left_inverse(X)),X) = left_division(X,Y),
inference('REWRITE',[status(thm)],[35,229,theory(equality)]) ).
cnf(232,plain,
right_division(left_division(X,Y),Y) = left_inverse(X),
inference('PARAMODULATE',[status(thm)],[right_division_multiply,229,theory(equality)]) ).
cnf(233,plain,
left_division(left_inverse(X),left_division(X,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[left_division_multiply,229,theory(equality)]) ).
cnf(234,plain,
left_division(left_inverse(X),Y) = multiply(X,Y),
inference('PARAMODULATE',[status(thm)],[229,75,theory(equality)]) ).
cnf(239,plain,
left_division(left_inverse(left_division(left_inverse(left_division(X,Y)),left_inverse(X))),X) = left_division(X,Y),
inference('REWRITE',[status(thm)],[231,234,theory(equality)]) ).
cnf(265,plain,
left_division(left_inverse(right_division(X,Y)),Y) = X,
inference('REWRITE',[status(thm)],[multiply_right_division,234,theory(equality)]) ).
cnf(266,plain,
left_division(X,left_division(left_inverse(X),Y)) = Y,
inference('REWRITE',[status(thm)],[left_division_multiply,234,theory(equality)]) ).
cnf(268,plain,
left_division(left_inverse(X),left_division(left_inverse(Y),X)) = left_division(left_inverse(left_division(left_inverse(X),Y)),X),
inference('REWRITE',[status(thm)],[23,234,theory(equality)]) ).
cnf(271,plain,
left_division(left_inverse(left_division(left_inverse(X),Y)),Z) = left_division(left_inverse(Y),left_division(left_inverse(left_division(Y,X)),left_division(left_inverse(Y),Z))),
inference('REWRITE',[status(thm)],[27,234,theory(equality)]) ).
cnf(272,plain,
left_division(left_inverse(left_division(left_inverse(left_division(left_inverse(X),Y)),X)),left_division(X,Z)) = left_division(left_inverse(X),left_division(left_inverse(Y),Z)),
inference('REWRITE',[status(thm)],[28,234,theory(equality)]) ).
cnf(307,plain,
left_division(left_inverse(left_division(left_inverse(X),X)),left_division(X,Y)) = left_division(left_inverse(X),Y),
inference('REWRITE',[status(thm)],[169,234,theory(equality)]) ).
cnf(341,plain,
left_division(left_inverse(left_division(left_inverse(x),left_division(left_inverse(y),z))),x) != left_division(left_inverse(left_division(left_inverse(x),y)),left_division(left_inverse(z),x)),
inference('REWRITE',[status(thm)],[prove_moufang4,268,234,theory(equality)]) ).
cnf(342,plain,
right_division(X,Y) = left_inverse(right_division(Y,X)),
inference('PARAMODULATE',[status(thm)],[22,265,theory(equality)]) ).
cnf(355,plain,
left_division(X,left_inverse(X)) = left_inverse(left_division(left_inverse(X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[342,183,theory(equality)]),155,theory(equality)]) ).
cnf(380,plain,
left_division(left_division(X,left_inverse(X)),left_division(X,Y)) = left_division(left_inverse(X),Y),
inference('REWRITE',[status(thm)],[307,355,theory(equality)]) ).
cnf(554,plain,
left_division(left_inverse(left_division(left_inverse(X),left_inverse(Y))),Y) = X,
inference('PARAMODULATE',[status(thm)],[239,266,theory(equality)]) ).
cnf(557,plain,
right_division(X,Y) = left_inverse(left_division(left_inverse(Y),left_inverse(X))),
inference('PARAMODULATE',[status(thm)],[22,554,theory(equality)]) ).
cnf(630,plain,
left_inverse(left_division(left_inverse(left_division(X,Y)),left_inverse(Y))) = X,
inference('REWRITE',[status(thm)],[22,557,theory(equality)]) ).
cnf(659,plain,
left_inverse(left_division(left_inverse(X),left_inverse(left_division(Y,X)))) = left_inverse(Y),
inference('REWRITE',[status(thm)],[232,557,theory(equality)]) ).
cnf(661,plain,
left_inverse(left_division(left_inverse(X),left_inverse(Y))) = left_division(left_inverse(Y),left_inverse(X)),
inference('REWRITE',[status(thm)],[342,75,557,theory(equality)]) ).
cnf(689,plain,
left_division(left_inverse(left_division(X,Y)),left_inverse(Y)) = left_inverse(X),
inference('REWRITE',[status(thm)],[659,661,theory(equality)]) ).
cnf(730,plain,
left_division(left_inverse(X),left_inverse(left_division(Y,X))) = Y,
inference('REWRITE',[status(thm)],[630,661,theory(equality)]) ).
cnf(769,plain,
left_division(X,Y) = left_inverse(left_division(Y,X)),
inference('PARAMODULATE',[status(thm)],[266,730,theory(equality)]) ).
cnf(828,plain,
left_division(left_inverse(X),left_division(left_inverse(Y),X)) = left_division(left_division(Y,left_inverse(X)),X),
inference('REWRITE',[status(thm)],[268,769,theory(equality)]) ).
cnf(829,plain,
left_division(left_division(X,left_inverse(Y)),Z) = left_division(left_inverse(X),left_division(left_division(Y,X),left_division(left_inverse(X),Z))),
inference('REWRITE',[status(thm)],[271,769,theory(equality)]) ).
cnf(830,plain,
left_division(left_division(X,left_division(Y,left_inverse(X))),left_division(X,Z)) = left_division(left_inverse(X),left_division(left_inverse(Y),Z)),
inference('REWRITE',[status(thm)],[272,769,theory(equality)]) ).
cnf(941,plain,
left_division(left_division(X,Y),left_inverse(X)) = left_inverse(Y),
inference('REWRITE',[status(thm)],[689,769,theory(equality)]) ).
cnf(951,plain,
left_division(left_division(left_division(left_inverse(y),z),left_inverse(x)),x) != left_division(left_division(y,left_inverse(x)),left_division(left_inverse(z),x)),
inference('REWRITE',[status(thm)],[341,769,theory(equality)]) ).
cnf(966,plain,
left_division(left_division(X,Y),left_division(X,left_inverse(X))) = left_division(Y,left_inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[769,380,theory(equality)]),769,theory(equality)]) ).
cnf(993,plain,
left_division(X,left_division(left_inverse(Y),left_inverse(X))) = left_division(left_division(Y,X),left_inverse(X)),
inference('PARAMODULATE',[status(thm)],[828,75,theory(equality)]) ).
cnf(1003,plain,
left_division(left_inverse(X),left_division(left_division(Y,Z),X)) = left_division(left_division(left_division(Z,Y),left_inverse(X)),X),
inference('PARAMODULATE',[status(thm)],[828,769,theory(equality)]) ).
cnf(1007,plain,
left_division(left_inverse(x),left_division(left_division(z,left_inverse(y)),x)) != left_division(left_division(y,left_inverse(x)),left_division(left_inverse(z),x)),
inference('REWRITE',[status(thm)],[951,1003,theory(equality)]) ).
cnf(1903,plain,
left_division(left_division(X,left_inverse(Y)),left_division(X,Z)) = left_division(left_inverse(X),left_division(left_division(Y,X),Z)),
inference('PARAMODULATE',[status(thm)],[829,233,theory(equality)]) ).
cnf(1908,plain,
left_division(left_division(left_division(X,Y),left_inverse(Y)),left_division(Y,Z)) = left_division(left_inverse(Y),left_division(X,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[830,75,theory(equality)]),993,theory(equality)]) ).
cnf(2012,plain,
left_division(left_division(X,Y),left_division(left_division(Z,X),left_inverse(X))) = left_division(left_division(Z,Y),left_inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[769,1908,theory(equality)]),769,theory(equality)]) ).
cnf(3341,plain,
left_division(left_inverse(X),left_division(left_division(Y,Z),X)) = left_division(left_division(left_division(X,Y),left_division(left_division(Z,X),left_inverse(X))),X),
inference('PARAMODULATE',[status(thm)],[1003,2012,theory(equality)]) ).
cnf(3348,plain,
left_division(left_division(left_inverse(X),Y),left_division(left_inverse(Z),X)) = left_division(left_division(left_division(X,Z),Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2012,941,theory(equality)]),75,theory(equality)]) ).
cnf(3353,plain,
left_division(left_inverse(X),left_division(left_division(Y,Z),X)) = left_division(left_division(left_inverse(Z),left_inverse(X)),left_division(left_inverse(Y),X)),
inference('REWRITE',[status(thm)],[3341,966,1903,3348,theory(equality)]) ).
cnf(3356,plain,
$false,
inference('REWRITE',[status(thm)],[1007,75,3353,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP205-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 03:44:33 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T03:44:33
% 0.21/0.49 ; 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-14T03:44:33
% 0.21/0.50
% 0.21/0.50 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.21/0.50 ; Recognized right identity assertion (= (|multiply| ?X |identity|) ?X).
% 0.21/0.50 ; Recognized possible right inverse assertion (= (|multiply| ?X (|right_inverse| ?X)) |identity|).
% 4.17/4.35 ; Recognized possible left inverse assertion (= (|multiply| (|left_inverse| ?X) ?X) |identity|).
% 4.17/4.35
% 4.17/4.35 #||
% 4.17/4.35 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.17/4.35 % SZS output start Refutation
% See solution above
% 4.17/4.38 ||#
% 4.17/4.38
% 4.17/4.38 ; Summary of computation:
% 4.17/4.38 ; 10216 formulas have been input or derived (from 138 formulas).
% 4.17/4.38 ; 3356 (33%) were retained. Of these,
% 4.17/4.38 ; 1147 (34%) were simplified or subsumed later,
% 4.17/4.38 ; 2209 (66%) are still being kept.
% 4.17/4.38 ;
% 4.17/4.38 ; Run time in seconds excluding printing time:
% 4.17/4.38 ; 0.002 0% Read assertion file (1 call)
% 4.17/4.38 ; 0.000 0% Assert (10 calls)
% 4.17/4.38 ; 0.424 11% Process new row (9,806 calls)
% 4.17/4.38 ; 0.010 0% Resolution (274 calls)
% 4.17/4.38 ; 0.160 4% Paramodulation (137 calls)
% 4.17/4.38 ; 0.990 26% Forward simplification (9,312 calls)
% 4.17/4.38 ; 0.528 14% Backward simplification (3,356 calls)
% 4.17/4.38 ; 1.672 43% Ordering (131,393 calls)
% 4.17/4.38 ; 0.000 0% Sortal reasoning (32 calls)
% 4.17/4.38 ; 0.000 0% Purity testing (1 call)
% 4.17/4.38 ; 0.074 2% Other
% 4.17/4.38 ; 3.860 Total
% 4.17/4.38 ; 3.896 Real time
% 4.17/4.38 ;
% 4.17/4.38 ; Term-hash-array has 10,172 terms in all.
% 4.17/4.38 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 4.17/4.38 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 4.17/4.38 ; Path-index has 7,162 entries (7,230 at peak, 10,586 added, 3,424 deleted).
% 4.17/4.38 ; Path-index has 3,711 nodes (3,881 at peak, 6,171 added, 2,460 deleted).
% 4.17/4.38 ; Trie-index has 7,162 entries (7,230 at peak, 10,586 added, 3,424 deleted).
% 4.17/4.38 ; Trie-index has 35,075 nodes (35,298 at peak, 57,838 added, 22,763 deleted).
% 4.17/4.38 ; Retrieved 545,645 generalization terms in 132,562 calls.
% 4.17/4.38 ; Retrieved 151,002 instance terms in 5,335 calls.
% 4.17/4.38 ; Retrieved 72,891 unifiable terms in 962 calls.
% 4.17/4.38 ;
% 4.17/4.38 ; The agenda of backward simplifiable rows to process has 12 entries:
% 4.17/4.38 ; 12 with value 0
% 4.17/4.38 ; The agenda of rows to process has 344 entries:
% 4.17/4.38 ; 5 with value 31 21 with value 39 18 with value 47
% 4.17/4.38 ; 19 with value 32 34 with value 40 3 with value 48
% 4.17/4.38 ; 26 with value 33 11 with value 41 1 with value 49
% 4.17/4.38 ; 31 with value 34 14 with value 42 2 with value 50
% 4.17/4.38 ; 20 with value 35 15 with value 43 5 with value 51
% 4.17/4.38 ; 46 with value 36 8 with value 44 1 with value 52
% 4.17/4.38 ; 30 with value 37 16 with value 45 1 with value 54
% 4.17/4.38 ; 10 with value 38 6 with value 46 1 with value 56
% 4.17/4.38 ; The agenda of rows to give has 2150 entries:
% 4.17/4.38 ; 31 with value (4 25) 161 with value (4 37) 23 with value (4 48)
% 4.17/4.38 ; 43 with value (4 26) 131 with value (4 38) 11 with value (4 49)
% 4.17/4.38 ; 59 with value (4 27) 77 with value (4 39) 10 with value (4 50)
% 4.17/4.38 ; 49 with value (4 28) 73 with value (4 40) 6 with value (4 51)
% 4.17/4.38 ; 57 with value (4 29) 70 with value (4 41) 5 with value (4 52)
% 4.17/4.38 ; 66 with value (4 30) 67 with value (4 42) 5 with value (4 53)
% 4.17/4.38 ; 141 with value (4 31) 71 with value (4 43) 8 with value (4 54)
% 4.17/4.38 ; 167 with value (4 32) 66 with value (4 44) 3 with value (4 55)
% 4.17/4.38 ; 157 with value (4 33) 43 with value (4 45) 4 with value (4 56)
% 4.17/4.38 ; 155 with value (4 34) 69 with value (4 46) 1 with value (4 57)
% 4.17/4.38 ; 112 with value (4 35) 58 with value (4 47) 1 with value (4 59)
% 4.17/4.38 ; 150 with value (4 36)
% 4.17/4.38 Evaluation took:
% 4.17/4.38 3.897 seconds of real time
% 4.17/4.38 3.650124 seconds of user run time
% 4.17/4.38 0.245902 seconds of system run time
% 4.17/4.38 [Run times include 0.283 seconds GC run time.]
% 4.17/4.38 0 calls to %EVAL
% 4.17/4.38 0 page faults and
% 4.17/4.38 265,942,904 bytes consed.
% 4.17/4.38 :PROOF-FOUND
% 4.17/4.38 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T03:44:37
% 4.17/4.38 :PROOF-FOUND
% 4.17/4.38 *
%------------------------------------------------------------------------------