%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE011+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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:08 EDT 2022
% Result : Theorem 4.77s 5.00s
% Output : Refutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 70 ( 53 unt; 0 nHn; 59 RR)
% Number of literals : 92 ( 47 equ; 28 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 : 37 ( 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('SKOLEMAAAR1'(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('SKOLEMAAAR3'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(25,negated_conjecture,
test('SKOLEMAAAR2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(26,negated_conjecture,
( ~ leq(one,addition(multiplication(addition('SKOLEMAAAR3',c('SKOLEMAAAR3')),'SKOLEMAAAR2'),addition(multiplication(addition('SKOLEMAAAR2',c('SKOLEMAAAR2')),'SKOLEMAAAR3'),multiplication(c('SKOLEMAAAR2'),c('SKOLEMAAAR3')))))
| ~ leq(addition(multiplication(addition('SKOLEMAAAR3',c('SKOLEMAAAR3')),'SKOLEMAAAR2'),addition(multiplication(addition('SKOLEMAAAR2',c('SKOLEMAAAR2')),'SKOLEMAAAR3'),multiplication(c('SKOLEMAAAR2'),c('SKOLEMAAAR3')))),one) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(27,plain,
( ~ leq(one,addition(multiplication('SKOLEMAAAR3','SKOLEMAAAR2'),addition(multiplication(c('SKOLEMAAAR3'),'SKOLEMAAAR2'),addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),multiplication(c('SKOLEMAAAR2'),c('SKOLEMAAAR3')))))))
| ~ leq(addition(multiplication('SKOLEMAAAR3','SKOLEMAAAR2'),addition(multiplication(c('SKOLEMAAAR3'),'SKOLEMAAAR2'),addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),multiplication(c('SKOLEMAAAR2'),c('SKOLEMAAAR3')))))),one) ),
inference('REWRITE',[status(thm)],[26,8,theory(equality)]) ).
cnf(28,plain,
complement('SKOLEMAAAR1'('SKOLEMAAAR3'),'SKOLEMAAAR3'),
inference('HYPERRESOLVE',[status(thm)],[13,24]) ).
cnf(29,plain,
complement('SKOLEMAAAR1'('SKOLEMAAAR2'),'SKOLEMAAAR2'),
inference('HYPERRESOLVE',[status(thm)],[13,25]) ).
cnf(32,plain,
leq(X,X),
inference('HYPERRESOLVE',[status(thm)],[12,2]) ).
cnf(33,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[12,3]) ).
cnf(37,plain,
complement('SKOLEMAAAR3',c('SKOLEMAAAR3')),
inference('HYPERRESOLVE',[status(thm)],[19,24,theory(equality)]) ).
cnf(38,plain,
complement('SKOLEMAAAR2',c('SKOLEMAAAR2')),
inference('HYPERRESOLVE',[status(thm)],[19,25,theory(equality)]) ).
cnf(52,plain,
c(addition('SKOLEMAAAR3','SKOLEMAAAR2')) = multiplication(c('SKOLEMAAAR3'),c('SKOLEMAAAR2')),
inference('HYPERRESOLVE',[status(thm)],[22,24,25]) ).
cnf(53,plain,
c(addition('SKOLEMAAAR3','SKOLEMAAAR2')) = multiplication(c('SKOLEMAAAR2'),c('SKOLEMAAAR3')),
inference('HYPERRESOLVE',[status(thm)],[22,25,24]) ).
cnf(54,plain,
( ~ leq(one,addition(multiplication('SKOLEMAAAR3','SKOLEMAAAR2'),addition(multiplication(c('SKOLEMAAAR3'),'SKOLEMAAAR2'),addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),c(addition('SKOLEMAAAR3','SKOLEMAAAR2')))))))
| ~ leq(addition(multiplication('SKOLEMAAAR3','SKOLEMAAAR2'),addition(multiplication(c('SKOLEMAAAR3'),'SKOLEMAAAR2'),addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),c(addition('SKOLEMAAAR3','SKOLEMAAAR2')))))),one) ),
inference('REWRITE',[status(thm)],[27,53,theory(equality)]) ).
cnf(107,plain,
addition('SKOLEMAAAR1'('SKOLEMAAAR3'),'SKOLEMAAAR3') = one,
inference('HYPERRESOLVE',[status(thm)],[17,28]) ).
cnf(109,plain,
multiplication('SKOLEMAAAR1'('SKOLEMAAAR3'),'SKOLEMAAAR3') = zero,
inference('HYPERRESOLVE',[status(thm)],[16,28]) ).
cnf(110,plain,
multiplication('SKOLEMAAAR3','SKOLEMAAAR1'('SKOLEMAAAR3')) = zero,
inference('HYPERRESOLVE',[status(thm)],[15,28]) ).
cnf(112,plain,
addition('SKOLEMAAAR1'('SKOLEMAAAR2'),'SKOLEMAAAR2') = one,
inference('HYPERRESOLVE',[status(thm)],[17,29]) ).
cnf(114,plain,
multiplication('SKOLEMAAAR1'('SKOLEMAAAR2'),'SKOLEMAAAR2') = zero,
inference('HYPERRESOLVE',[status(thm)],[16,29]) ).
cnf(115,plain,
multiplication('SKOLEMAAAR2','SKOLEMAAAR1'('SKOLEMAAAR2')) = zero,
inference('HYPERRESOLVE',[status(thm)],[15,29]) ).
cnf(117,plain,
test(c('SKOLEMAAAR3')),
inference('HYPERRESOLVE',[status(thm)],[14,37]) ).
cnf(122,plain,
test(c('SKOLEMAAAR2')),
inference('HYPERRESOLVE',[status(thm)],[14,38]) ).
cnf(123,plain,
addition('SKOLEMAAAR2',c('SKOLEMAAAR2')) = one,
inference('HYPERRESOLVE',[status(thm)],[17,38]) ).
cnf(135,plain,
c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')) = multiplication(c(c('SKOLEMAAAR3')),c('SKOLEMAAAR2')),
inference('HYPERRESOLVE',[status(thm)],[22,117,25]) ).
cnf(138,plain,
c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')) = multiplication(c('SKOLEMAAAR2'),c(c('SKOLEMAAAR3'))),
inference('HYPERRESOLVE',[status(thm)],[22,117,25]) ).
cnf(158,plain,
c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))) = multiplication(c(c('SKOLEMAAAR2')),c(c('SKOLEMAAAR3'))),
inference('HYPERRESOLVE',[status(thm)],[22,122,117]) ).
cnf(160,plain,
c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))) = multiplication(c(c('SKOLEMAAAR3')),c(c('SKOLEMAAAR2'))),
inference('HYPERRESOLVE',[status(thm)],[22,122,117]) ).
cnf(175,plain,
leq('SKOLEMAAAR3',one),
inference('PARAMODULATE',[status(thm)],[33,107,theory(equality)]) ).
cnf(179,plain,
X = addition(multiplication('SKOLEMAAAR1'('SKOLEMAAAR3'),X),multiplication('SKOLEMAAAR3',X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,107,theory(equality)]),6,theory(equality)]) ).
cnf(183,plain,
complement('SKOLEMAAAR3','SKOLEMAAAR1'('SKOLEMAAAR3')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,107,theory(equality)]),110,109,theory(equality)]) ).
cnf(184,plain,
addition(one,'SKOLEMAAAR3') = one,
inference('HYPERRESOLVE',[status(thm)],[11,175]) ).
cnf(189,plain,
c('SKOLEMAAAR3') = 'SKOLEMAAAR1'('SKOLEMAAAR3'),
inference('HYPERRESOLVE',[status(thm)],[20,183,24]) ).
cnf(190,plain,
complement(c('SKOLEMAAAR3'),'SKOLEMAAAR3'),
inference('REWRITE',[status(thm)],[28,189,theory(equality)]) ).
cnf(195,plain,
X = addition(multiplication(c('SKOLEMAAAR3'),X),multiplication('SKOLEMAAAR3',X)),
inference('REWRITE',[status(thm)],[179,189,theory(equality)]) ).
cnf(197,plain,
( ~ leq(one,addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),'SKOLEMAAAR2'))))
| ~ leq(addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),'SKOLEMAAAR2'))),one) ),
inference('REWRITE',[status(thm)],[54,195,theory(equality)]) ).
cnf(200,plain,
c(c('SKOLEMAAAR3')) = 'SKOLEMAAAR3',
inference('HYPERRESOLVE',[status(thm)],[20,190,117]) ).
cnf(202,plain,
c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')) = multiplication('SKOLEMAAAR3',c('SKOLEMAAAR2')),
inference('REWRITE',[status(thm)],[135,200,theory(equality)]) ).
cnf(207,plain,
c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')) = multiplication(c('SKOLEMAAAR2'),'SKOLEMAAAR3'),
inference('REWRITE',[status(thm)],[138,200,theory(equality)]) ).
cnf(208,plain,
( ~ leq(one,addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')),addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),'SKOLEMAAAR2'))))
| ~ leq(addition(multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),addition(c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')),addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),'SKOLEMAAAR2'))),one) ),
inference('REWRITE',[status(thm)],[197,207,theory(equality)]) ).
cnf(217,plain,
c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))) = multiplication(c(c('SKOLEMAAAR2')),'SKOLEMAAAR3'),
inference('REWRITE',[status(thm)],[158,200,theory(equality)]) ).
cnf(218,plain,
c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))) = multiplication('SKOLEMAAAR3',c(c('SKOLEMAAAR2'))),
inference('REWRITE',[status(thm)],[160,200,theory(equality)]) ).
cnf(222,plain,
leq('SKOLEMAAAR2',one),
inference('PARAMODULATE',[status(thm)],[33,112,theory(equality)]) ).
cnf(230,plain,
complement('SKOLEMAAAR2','SKOLEMAAAR1'('SKOLEMAAAR2')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,112,theory(equality)]),115,114,theory(equality)]) ).
cnf(231,plain,
addition(one,'SKOLEMAAAR2') = one,
inference('HYPERRESOLVE',[status(thm)],[11,222]) ).
cnf(232,plain,
addition('SKOLEMAAAR2',addition(one,X)) = addition(one,X),
inference('EMBED',[status(thm)],[231]) ).
cnf(236,plain,
c('SKOLEMAAAR2') = 'SKOLEMAAAR1'('SKOLEMAAAR2'),
inference('HYPERRESOLVE',[status(thm)],[20,230,25]) ).
cnf(237,plain,
complement(c('SKOLEMAAAR2'),'SKOLEMAAAR2'),
inference('REWRITE',[status(thm)],[29,236,theory(equality)]) ).
cnf(246,plain,
c(c('SKOLEMAAAR2')) = 'SKOLEMAAAR2',
inference('HYPERRESOLVE',[status(thm)],[20,237,122]) ).
cnf(258,plain,
c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))) = multiplication('SKOLEMAAAR2','SKOLEMAAAR3'),
inference('REWRITE',[status(thm)],[217,246,theory(equality)]) ).
cnf(260,plain,
( ~ leq(one,addition(c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))),addition(c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')),addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),'SKOLEMAAAR2'))))
| ~ leq(addition(c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))),addition(c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2')),addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),'SKOLEMAAAR2'))),one) ),
inference('REWRITE',[status(thm)],[208,258,theory(equality)]) ).
cnf(261,plain,
c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2'))) = multiplication('SKOLEMAAAR3','SKOLEMAAAR2'),
inference('REWRITE',[status(thm)],[218,246,theory(equality)]) ).
cnf(312,plain,
X = addition(X,multiplication('SKOLEMAAAR3',X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,184,theory(equality)]),6,theory(equality)]) ).
cnf(313,plain,
addition(X,addition(multiplication('SKOLEMAAAR3',X),Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[312]) ).
cnf(502,plain,
one = addition(one,c(addition(c('SKOLEMAAAR3'),c('SKOLEMAAAR2')))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[232,313,theory(equality)]),261,231,theory(equality)]) ).
cnf(1401,plain,
c('SKOLEMAAAR2') = addition(c(addition('SKOLEMAAAR3','SKOLEMAAAR2')),c(addition(c('SKOLEMAAAR3'),'SKOLEMAAAR2'))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[195,52,theory(equality)]),202,theory(equality)]) ).
cnf(1403,plain,
$false,
inference('REWRITE',[status(thm)],[260,32,502,123,1401,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : KLE011+4 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.09 % Command : run-snark %s %d
% 0.09/0.29 % Computer : n029.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 16 11:04:27 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.38 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 *
% 0.13/0.38 *
% 0.13/0.39 #<PACKAGE "SNARK-USER">
% 0.13/0.39 *
% 0.13/0.39 SNARK-TPTP-OPTIONS
% 0.13/0.39 *
% 0.13/0.39 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.13/0.39 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.13/0.39 (USE-FACTORING :POS)
% 0.13/0.39 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.13/0.39 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.13/0.39 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.13/0.39 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.13/0.39 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.13/0.39 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.13/0.39 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.13/0.39 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.13/0.39 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.13/0.39 (DECLARE-TPTP-SYMBOLS2))
% 0.13/0.39 *
% 0.13/0.39 "."
% 0.13/0.39 *
% 0.13/0.39 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T11:04:27
% 0.13/0.39 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-16T11:04:27
% 0.13/0.40
% 0.13/0.40 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.13/0.40 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.13/0.40 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.13/0.40 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.13/0.40 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.13/0.40 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.13/0.40 ; Declaring addition to be commutative.
% 4.77/5.00 ; Declaring addition to be associative-commutative.
% 4.77/5.00
% 4.77/5.00 #||
% 4.77/5.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.77/5.00 % SZS output start Refutation
% See solution above
% 4.77/5.01 ||#
% 4.77/5.01
% 4.77/5.01 ; Summary of computation:
% 4.77/5.01 ; 10734 formulas have been input or derived (from 201 formulas).
% 4.77/5.01 ; 1403 (13%) were retained. Of these,
% 4.77/5.01 ; 151 (11%) were simplified or subsumed later,
% 4.77/5.01 ; 1252 (89%) are still being kept.
% 4.77/5.01 ;
% 4.77/5.01 ; Run time in seconds excluding printing time:
% 4.77/5.01 ; 0.005 0% Read assertion file (1 call)
% 4.77/5.01 ; 0.001 0% Assert (19 calls)
% 4.77/5.01 ; 0.225 5% Process new row (10,369 calls)
% 4.77/5.01 ; 0.071 2% Resolution (400 calls)
% 4.77/5.01 ; 0.226 5% Paramodulation (200 calls)
% 4.77/5.01 ; 0.001 0% Factoring (4 calls)
% 4.77/5.01 ; 0.001 0% Embedding (118 calls)
% 4.77/5.01 ; 0.083 2% Condensing (997 calls)
% 4.77/5.01 ; 0.083 2% Forward subsumption (997 calls)
% 4.77/5.01 ; 0.026 1% Backward subsumption (417 calls)
% 4.77/5.01 ; 0.037 1% Clause clause subsumption (3,048 calls)
% 4.77/5.01 ; 3.663 80% Forward simplification (10,226 calls)
% 4.77/5.01 ; 0.038 1% Backward simplification (1,299 calls)
% 4.77/5.01 ; 0.036 1% Ordering (6,312 calls)
% 4.77/5.01 ; 0.016 0% Ordering ac (891 calls)
% 4.77/5.01 ; 0.001 0% Sortal reasoning (32 calls)
% 4.77/5.01 ; 0.000 0% Purity testing (1 call)
% 4.77/5.01 ; 0.086 2% Other
% 4.77/5.01 ; 4.599 Total
% 4.77/5.01 ; 4.625 Real time
% 4.77/5.01 ;
% 4.77/5.01 ; Term-hash-array has 2,903 terms in all.
% 4.77/5.01 ; Feature-vector-row-index has 382 entries (384 at peak, 417 added, 35 deleted).
% 4.77/5.01 ; Feature-vector-row-index has 1,740 nodes (1,771 at peak, 2,045 added, 305 deleted).
% 4.77/5.01 ; Retrieved 3,955 possibly forward subsuming rows in 997 calls.
% 4.77/5.01 ; Retrieved 518 possibly backward subsumed rows in 417 calls.
% 4.77/5.01 ; Path-index has 2,628 entries (2,630 at peak, 2,940 added, 312 deleted).
% 4.77/5.01 ; Path-index has 795 nodes (799 at peak, 1,025 added, 230 deleted).
% 4.77/5.01 ; Trie-index has 2,628 entries (2,630 at peak, 2,940 added, 312 deleted).
% 4.77/5.01 ; Trie-index has 1,411 nodes (1,417 at peak, 1,827 added, 416 deleted).
% 4.77/5.01 ; Retrieved 1,871,368 generalization terms in 66,696 calls.
% 4.77/5.01 ; Retrieved 2,950 instance terms in 899 calls.
% 4.77/5.01 ; Retrieved 41,146 unifiable terms in 2,320 calls.
% 4.77/5.01 ;
% 4.77/5.01 ; The agenda of rows to process has 20 entries:
% 4.77/5.01 ; 2 with value 22 3 with value 25 1 with value 30
% 4.77/5.01 ; 2 with value 23 2 with value 26 2 with value 47
% 4.77/5.01 ; 7 with value 24 1 with value 27
% 4.77/5.01 ; The agenda of rows to give has 1075 entries:
% 4.77/5.01 ; 39 with value (4 17) 36 with value (4 32) 8 with value (4 56)
% 4.77/5.01 ; 40 with value (4 18) 22 with value (4 33) 8 with value (4 58)
% 4.77/5.01 ; 90 with value (4 19) 36 with value (4 34) 5 with value (4 59)
% 4.77/5.01 ; 108 with value (4 20) 8 with value (4 35) 1 with value (4 61)
% 4.77/5.01 ; 76 with value (4 21) 20 with value (4 36) 4 with value (4 62)
% 4.77/5.01 ; 33 with value (4 22) 12 with value (4 37) 8 with value (4 63)
% 4.77/5.01 ; 71 with value (4 23) 5 with value (4 38) 8 with value (4 65)
% 4.77/5.01 ; 64 with value (4 24) 16 with value (4 39) 8 with value (4 70)
% 4.77/5.01 ; 87 with value (4 25) 2 with value (4 41) 8 with value (4 77)
% 4.77/5.01 ; 50 with value (4 26) 8 with value (4 42) 2 with value (4 79)
% 4.77/5.01 ; 54 with value (4 27) 4 with value (4 45) 8 with value (4 84)
% 4.77/5.01 ; 31 with value (4 28) 2 with value (4 51) 8 with value (4 97)
% 4.77/5.01 ; 24 with value (4 29) 8 with value (4 53) 8 with value (4 104)
% 4.77/5.01 ; 24 with value (4 30) 4 with value (4 55) 1 with value (4 107)
% 4.77/5.01 ; 16 with value (4 31)
% 4.77/5.01 Evaluation took:
% 4.77/5.01 4.626 seconds of real time
% 4.77/5.01 4.508808 seconds of user run time
% 4.77/5.01 0.109006 seconds of system run time
% 4.77/5.01 [Run times include 0.184 seconds GC run time.]
% 4.77/5.01 0 calls to %EVAL
% 4.77/5.01 0 page faults and
% 4.77/5.01 256,860,304 bytes consed.
% 4.77/5.02 :PROOF-FOUND
% 4.77/5.02 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T11:04:32
% 4.77/5.02 :PROOF-FOUND
% 4.77/5.02 *
%------------------------------------------------------------------------------