TSTP Solution File: KLE010+3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE010+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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 : Sun Jul 17 02:26:06 EDT 2022
% Result : Theorem 2.55s 2.80s
% Output : Refutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 68 ( 57 unt; 0 nHn; 58 RR)
% Number of literals : 84 ( 52 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
addition(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
cnf(3,plain,
addition(X,addition(X,Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[2]) ).
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
cnf(8,axiom,
multiplication(addition(X,Y),Z) = addition(multiplication(X,Z),multiplication(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
cnf(11,axiom,
( ~ leq(X,Y)
| addition(X,Y) = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
cnf(12,axiom,
( leq(X,Y)
| addition(X,Y) != Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
cnf(13,axiom,
( ~ test(X)
| complement('SKOLEMAAAU1'(X),X) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_1) ).
cnf(14,axiom,
( test(X)
| ~ complement(Y,X) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_1) ).
cnf(15,axiom,
( ~ complement(X,Y)
| multiplication(Y,X) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
cnf(16,axiom,
( ~ complement(X,Y)
| multiplication(X,Y) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
cnf(17,axiom,
( ~ complement(X,Y)
| addition(X,Y) = one ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
cnf(18,axiom,
( complement(X,Y)
| multiplication(Y,X) != zero
| multiplication(X,Y) != zero
| addition(X,Y) != one ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
cnf(19,axiom,
( ~ test(X)
| c(X) != Y
| complement(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
cnf(20,axiom,
( ~ test(X)
| c(X) = Y
| ~ complement(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
cnf(22,axiom,
( ~ test(X)
| ~ test(Y)
| c(addition(X,Y)) = multiplication(c(X),c(Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+2.ax',test_deMorgan1) ).
cnf(24,negated_conjecture,
test('SKOLEMAAAU3'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(25,negated_conjecture,
test('SKOLEMAAAU2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(26,negated_conjecture,
one != addition(multiplication('SKOLEMAAAU3','SKOLEMAAAU2'),addition(multiplication(c('SKOLEMAAAU3'),'SKOLEMAAAU2'),addition(multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),addition(multiplication(c('SKOLEMAAAU2'),'SKOLEMAAAU3'),multiplication(c('SKOLEMAAAU2'),c('SKOLEMAAAU3')))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(27,plain,
complement('SKOLEMAAAU1'('SKOLEMAAAU3'),'SKOLEMAAAU3'),
inference('HYPERRESOLVE',[status(thm)],[13,24]) ).
cnf(28,plain,
complement('SKOLEMAAAU1'('SKOLEMAAAU2'),'SKOLEMAAAU2'),
inference('HYPERRESOLVE',[status(thm)],[13,25]) ).
cnf(32,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[12,3]) ).
cnf(36,plain,
complement('SKOLEMAAAU3',c('SKOLEMAAAU3')),
inference('HYPERRESOLVE',[status(thm)],[19,24,theory(equality)]) ).
cnf(37,plain,
complement('SKOLEMAAAU2',c('SKOLEMAAAU2')),
inference('HYPERRESOLVE',[status(thm)],[19,25,theory(equality)]) ).
cnf(51,plain,
c(addition('SKOLEMAAAU3','SKOLEMAAAU2')) = multiplication(c('SKOLEMAAAU3'),c('SKOLEMAAAU2')),
inference('HYPERRESOLVE',[status(thm)],[22,24,25]) ).
cnf(52,plain,
c(addition('SKOLEMAAAU3','SKOLEMAAAU2')) = multiplication(c('SKOLEMAAAU2'),c('SKOLEMAAAU3')),
inference('HYPERRESOLVE',[status(thm)],[22,25,24]) ).
cnf(53,plain,
one != addition(multiplication('SKOLEMAAAU3','SKOLEMAAAU2'),addition(multiplication(c('SKOLEMAAAU3'),'SKOLEMAAAU2'),addition(multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),addition(multiplication(c('SKOLEMAAAU2'),'SKOLEMAAAU3'),c(addition('SKOLEMAAAU3','SKOLEMAAAU2')))))),
inference('REWRITE',[status(thm)],[26,52,theory(equality)]) ).
cnf(136,plain,
addition('SKOLEMAAAU1'('SKOLEMAAAU3'),'SKOLEMAAAU3') = one,
inference('HYPERRESOLVE',[status(thm)],[17,27]) ).
cnf(138,plain,
multiplication('SKOLEMAAAU1'('SKOLEMAAAU3'),'SKOLEMAAAU3') = zero,
inference('HYPERRESOLVE',[status(thm)],[16,27]) ).
cnf(139,plain,
multiplication('SKOLEMAAAU3','SKOLEMAAAU1'('SKOLEMAAAU3')) = zero,
inference('HYPERRESOLVE',[status(thm)],[15,27]) ).
cnf(141,plain,
addition('SKOLEMAAAU1'('SKOLEMAAAU2'),'SKOLEMAAAU2') = one,
inference('HYPERRESOLVE',[status(thm)],[17,28]) ).
cnf(143,plain,
multiplication('SKOLEMAAAU1'('SKOLEMAAAU2'),'SKOLEMAAAU2') = zero,
inference('HYPERRESOLVE',[status(thm)],[16,28]) ).
cnf(144,plain,
multiplication('SKOLEMAAAU2','SKOLEMAAAU1'('SKOLEMAAAU2')) = zero,
inference('HYPERRESOLVE',[status(thm)],[15,28]) ).
cnf(146,plain,
test(c('SKOLEMAAAU3')),
inference('HYPERRESOLVE',[status(thm)],[14,36]) ).
cnf(151,plain,
test(c('SKOLEMAAAU2')),
inference('HYPERRESOLVE',[status(thm)],[14,37]) ).
cnf(152,plain,
addition('SKOLEMAAAU2',c('SKOLEMAAAU2')) = one,
inference('HYPERRESOLVE',[status(thm)],[17,37]) ).
cnf(164,plain,
c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2')) = multiplication(c(c('SKOLEMAAAU3')),c('SKOLEMAAAU2')),
inference('HYPERRESOLVE',[status(thm)],[22,146,25]) ).
cnf(167,plain,
c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2')) = multiplication(c('SKOLEMAAAU2'),c(c('SKOLEMAAAU3'))),
inference('HYPERRESOLVE',[status(thm)],[22,146,25]) ).
cnf(187,plain,
c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))) = multiplication(c(c('SKOLEMAAAU2')),c(c('SKOLEMAAAU3'))),
inference('HYPERRESOLVE',[status(thm)],[22,151,146]) ).
cnf(189,plain,
c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))) = multiplication(c(c('SKOLEMAAAU3')),c(c('SKOLEMAAAU2'))),
inference('HYPERRESOLVE',[status(thm)],[22,151,146]) ).
cnf(204,plain,
leq('SKOLEMAAAU3',one),
inference('PARAMODULATE',[status(thm)],[32,136,theory(equality)]) ).
cnf(208,plain,
X = addition(multiplication('SKOLEMAAAU1'('SKOLEMAAAU3'),X),multiplication('SKOLEMAAAU3',X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,136,theory(equality)]),6,theory(equality)]) ).
cnf(212,plain,
complement('SKOLEMAAAU3','SKOLEMAAAU1'('SKOLEMAAAU3')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,136,theory(equality)]),139,138,theory(equality)]) ).
cnf(213,plain,
addition(one,'SKOLEMAAAU3') = one,
inference('HYPERRESOLVE',[status(thm)],[11,204]) ).
cnf(218,plain,
c('SKOLEMAAAU3') = 'SKOLEMAAAU1'('SKOLEMAAAU3'),
inference('HYPERRESOLVE',[status(thm)],[20,212,24]) ).
cnf(219,plain,
complement(c('SKOLEMAAAU3'),'SKOLEMAAAU3'),
inference('REWRITE',[status(thm)],[27,218,theory(equality)]) ).
cnf(224,plain,
X = addition(multiplication(c('SKOLEMAAAU3'),X),multiplication('SKOLEMAAAU3',X)),
inference('REWRITE',[status(thm)],[208,218,theory(equality)]) ).
cnf(240,plain,
one != addition(multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),addition(multiplication(c('SKOLEMAAAU2'),'SKOLEMAAAU3'),addition(c(addition('SKOLEMAAAU3','SKOLEMAAAU2')),'SKOLEMAAAU2'))),
inference('REWRITE',[status(thm)],[53,224,theory(equality)]) ).
cnf(243,plain,
c(c('SKOLEMAAAU3')) = 'SKOLEMAAAU3',
inference('HYPERRESOLVE',[status(thm)],[20,219,146]) ).
cnf(245,plain,
c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2')) = multiplication('SKOLEMAAAU3',c('SKOLEMAAAU2')),
inference('REWRITE',[status(thm)],[164,243,theory(equality)]) ).
cnf(250,plain,
c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2')) = multiplication(c('SKOLEMAAAU2'),'SKOLEMAAAU3'),
inference('REWRITE',[status(thm)],[167,243,theory(equality)]) ).
cnf(281,plain,
one != addition(multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),addition(c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2')),addition(c(addition('SKOLEMAAAU3','SKOLEMAAAU2')),'SKOLEMAAAU2'))),
inference('REWRITE',[status(thm)],[240,250,theory(equality)]) ).
cnf(290,plain,
c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))) = multiplication(c(c('SKOLEMAAAU2')),'SKOLEMAAAU3'),
inference('REWRITE',[status(thm)],[187,243,theory(equality)]) ).
cnf(291,plain,
c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))) = multiplication('SKOLEMAAAU3',c(c('SKOLEMAAAU2'))),
inference('REWRITE',[status(thm)],[189,243,theory(equality)]) ).
cnf(295,plain,
leq('SKOLEMAAAU2',one),
inference('PARAMODULATE',[status(thm)],[32,141,theory(equality)]) ).
cnf(303,plain,
complement('SKOLEMAAAU2','SKOLEMAAAU1'('SKOLEMAAAU2')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,141,theory(equality)]),144,143,theory(equality)]) ).
cnf(304,plain,
addition(one,'SKOLEMAAAU2') = one,
inference('HYPERRESOLVE',[status(thm)],[11,295]) ).
cnf(305,plain,
addition('SKOLEMAAAU2',addition(one,X)) = addition(one,X),
inference('EMBED',[status(thm)],[304]) ).
cnf(309,plain,
c('SKOLEMAAAU2') = 'SKOLEMAAAU1'('SKOLEMAAAU2'),
inference('HYPERRESOLVE',[status(thm)],[20,303,25]) ).
cnf(310,plain,
complement(c('SKOLEMAAAU2'),'SKOLEMAAAU2'),
inference('REWRITE',[status(thm)],[28,309,theory(equality)]) ).
cnf(319,plain,
c(c('SKOLEMAAAU2')) = 'SKOLEMAAAU2',
inference('HYPERRESOLVE',[status(thm)],[20,310,151]) ).
cnf(347,plain,
c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))) = multiplication('SKOLEMAAAU2','SKOLEMAAAU3'),
inference('REWRITE',[status(thm)],[290,319,theory(equality)]) ).
cnf(363,plain,
one != addition(c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))),addition(c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2')),addition(c(addition('SKOLEMAAAU3','SKOLEMAAAU2')),'SKOLEMAAAU2'))),
inference('REWRITE',[status(thm)],[281,347,theory(equality)]) ).
cnf(380,plain,
c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2'))) = multiplication('SKOLEMAAAU3','SKOLEMAAAU2'),
inference('REWRITE',[status(thm)],[291,319,theory(equality)]) ).
cnf(447,plain,
X = addition(X,multiplication('SKOLEMAAAU3',X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,213,theory(equality)]),6,theory(equality)]) ).
cnf(448,plain,
addition(X,addition(multiplication('SKOLEMAAAU3',X),Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[447]) ).
cnf(637,plain,
one = addition(one,c(addition(c('SKOLEMAAAU3'),c('SKOLEMAAAU2')))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[305,448,theory(equality)]),380,304,theory(equality)]) ).
cnf(1536,plain,
c('SKOLEMAAAU2') = addition(c(addition('SKOLEMAAAU3','SKOLEMAAAU2')),c(addition(c('SKOLEMAAAU3'),'SKOLEMAAAU2'))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[224,51,theory(equality)]),245,theory(equality)]) ).
cnf(1542,plain,
$false,
inference('REWRITE',[status(thm)],[363,637,152,1536,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE010+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 16:04:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47 *
% 0.18/0.47 "."
% 0.18/0.47 *
% 0.18/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T16:04:02
% 0.18/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-16T16:04:02
% 0.18/0.48
% 0.18/0.48 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.18/0.48 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.18/0.48 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.18/0.48 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.18/0.48 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.18/0.48 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.18/0.48 ; Declaring addition to be commutative.
% 2.55/2.80 ; Declaring addition to be associative-commutative.
% 2.55/2.80
% 2.55/2.80 #||
% 2.55/2.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.55/2.80 % SZS output start Refutation
% See solution above
% 2.63/2.81 ||#
% 2.63/2.81
% 2.63/2.81 ; Summary of computation:
% 2.63/2.81 ; 10925 formulas have been input or derived (from 201 formulas).
% 2.63/2.81 ; 1542 (14%) were retained. Of these,
% 2.63/2.81 ; 270 (18%) were simplified or subsumed later,
% 2.63/2.81 ; 1272 (82%) are still being kept.
% 2.63/2.81 ;
% 2.63/2.81 ; Run time in seconds excluding printing time:
% 2.63/2.81 ; 0.005 0% Read assertion file (1 call)
% 2.63/2.81 ; 0.002 0% Assert (19 calls)
% 2.63/2.81 ; 0.146 6% Process new row (10,550 calls)
% 2.63/2.81 ; 0.047 2% Resolution (400 calls)
% 2.63/2.81 ; 0.115 5% Paramodulation (200 calls)
% 2.63/2.81 ; 0.000 0% Factoring (4 calls)
% 2.63/2.81 ; 0.001 0% Embedding (118 calls)
% 2.63/2.81 ; 0.056 2% Condensing (992 calls)
% 2.63/2.81 ; 0.055 2% Forward subsumption (992 calls)
% 2.63/2.81 ; 0.015 1% Backward subsumption (412 calls)
% 2.63/2.81 ; 0.028 1% Clause clause subsumption (3,048 calls)
% 2.63/2.81 ; 1.740 74% Forward simplification (10,407 calls)
% 2.63/2.81 ; 0.039 2% Backward simplification (1,439 calls)
% 2.63/2.81 ; 0.020 1% Ordering (6,312 calls)
% 2.63/2.81 ; 0.004 0% Ordering ac (891 calls)
% 2.63/2.81 ; 0.000 0% Sortal reasoning (32 calls)
% 2.63/2.81 ; 0.000 0% Purity testing (1 call)
% 2.63/2.81 ; 0.064 3% Other
% 2.63/2.81 ; 2.337 Total
% 2.63/2.81 ; 2.343 Real time
% 2.63/2.81 ;
% 2.63/2.81 ; Term-hash-array has 3,102 terms in all.
% 2.63/2.81 ; Feature-vector-row-index has 382 entries (383 at peak, 412 added, 30 deleted).
% 2.63/2.81 ; Feature-vector-row-index has 1,740 nodes (1,755 at peak, 1,954 added, 214 deleted).
% 2.63/2.81 ; Retrieved 3,955 possibly forward subsuming rows in 992 calls.
% 2.63/2.81 ; Retrieved 518 possibly backward subsumed rows in 412 calls.
% 2.63/2.81 ; Path-index has 2,659 entries (2,672 at peak, 3,176 added, 517 deleted).
% 2.63/2.81 ; Path-index has 805 nodes (805 at peak, 1,072 added, 267 deleted).
% 2.63/2.81 ; Trie-index has 2,659 entries (2,672 at peak, 3,176 added, 517 deleted).
% 2.63/2.81 ; Trie-index has 1,412 nodes (1,418 at peak, 1,890 added, 478 deleted).
% 2.63/2.81 ; Retrieved 1,886,883 generalization terms in 68,565 calls.
% 2.63/2.81 ; Retrieved 3,138 instance terms in 1,044 calls.
% 2.63/2.81 ; Retrieved 42,502 unifiable terms in 2,392 calls.
% 2.63/2.81 ;
% 2.63/2.81 ; The agenda of backward simplifiable rows to process has 11 entries:
% 2.63/2.81 ; 11 with value 0
% 2.63/2.81 ; The agenda of rows to process has 20 entries:
% 2.63/2.81 ; 2 with value 22 3 with value 25 1 with value 30
% 2.63/2.81 ; 2 with value 23 2 with value 26 2 with value 47
% 2.63/2.81 ; 7 with value 24 1 with value 27
% 2.63/2.81 ; The agenda of rows to give has 1095 entries:
% 2.63/2.81 ; 39 with value (4 17) 36 with value (4 32) 8 with value (4 56)
% 2.63/2.81 ; 40 with value (4 18) 22 with value (4 33) 8 with value (4 58)
% 2.63/2.81 ; 90 with value (4 19) 36 with value (4 34) 5 with value (4 59)
% 2.63/2.81 ; 108 with value (4 20) 8 with value (4 35) 1 with value (4 61)
% 2.63/2.81 ; 78 with value (4 21) 24 with value (4 36) 4 with value (4 62)
% 2.63/2.81 ; 33 with value (4 22) 12 with value (4 37) 8 with value (4 63)
% 2.63/2.81 ; 71 with value (4 23) 5 with value (4 38) 8 with value (4 65)
% 2.63/2.81 ; 64 with value (4 24) 16 with value (4 39) 8 with value (4 70)
% 2.63/2.81 ; 95 with value (4 25) 2 with value (4 41) 8 with value (4 77)
% 2.63/2.81 ; 50 with value (4 26) 8 with value (4 42) 2 with value (4 79)
% 2.63/2.81 ; 54 with value (4 27) 4 with value (4 45) 8 with value (4 84)
% 2.63/2.81 ; 33 with value (4 28) 2 with value (4 51) 8 with value (4 97)
% 2.63/2.81 ; 28 with value (4 29) 8 with value (4 53) 8 with value (4 104)
% 2.63/2.81 ; 24 with value (4 30) 4 with value (4 55) 1 with value (4 107)
% 2.63/2.81 ; 16 with value (4 31)
% 2.63/2.81 Evaluation took:
% 2.63/2.81 2.343 seconds of real time
% 2.63/2.81 2.247556 seconds of user run time
% 2.63/2.81 0.094892 seconds of system run time
% 2.63/2.81 [Run times include 0.1 seconds GC run time.]
% 2.63/2.81 0 calls to %EVAL
% 2.63/2.81 0 page faults and
% 2.63/2.81 258,488,640 bytes consed.
% 2.63/2.81 :PROOF-FOUND
% 2.63/2.81 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T16:04:05
% 2.63/2.81 :PROOF-FOUND
% 2.63/2.81 *
%------------------------------------------------------------------------------