%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL688+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:16:12 PM UTC 2026
% Result : Theorem 55.80s 8.75s
% Output : CNFRefutation 55.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 43 ( 17 unt; 0 def)
% Number of atoms : 327 ( 0 equ)
% Maximal formula atoms : 110 ( 7 avg)
% Number of connectives : 579 ( 295 ~; 241 |; 42 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 47 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 142 ( 0 sgn 104 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ ! [X1] :
( ~ p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( ~ ! [X1] :
( ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ( ! [X2] :
( ~ ! [X1] :
( ~ ( p1(X1)
& ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ p1(X1) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ( ~ ! [X2] :
( ~ ! [X1] :
( ~ ! [X2] :
( ~ p2(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& p2(X1)
& ~ ! [X2] :
( ~ ( ~ p2(X2)
| ! [X1] :
( p3(X1)
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ ! [X1] :
( ~ ! [X2] :
( ~ p2(X2)
| ! [X1] :
( p3(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ p4(X2)
| ~ r1(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( r1(X2,X3)
& r1(X1,X2) )
=> r1(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ ! [X1] :
( ~ p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( ~ ! [X1] :
( ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ( ! [X2] :
( ~ ! [X1] :
( ~ ( p1(X1)
& ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ p1(X1) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ( ~ ! [X2] :
( ~ ! [X1] :
( ~ ! [X2] :
( ~ p2(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& p2(X1)
& ~ ! [X2] :
( ~ ( ~ p2(X2)
| ! [X1] :
( p3(X1)
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ ! [X1] :
( ~ ! [X2] :
( ~ p2(X2)
| ! [X1] :
( p3(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ p4(X2)
| ~ r1(X1,X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_4,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ ! [X1] :
( ~ p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( ~ ! [X1] :
( ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ( ! [X2] :
( ~ ! [X1] :
( ~ ( p1(X1)
& ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ p1(X1) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ( ~ ! [X2] :
( ~ ! [X1] :
( ~ ! [X2] :
( ~ p2(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& p2(X1)
& ~ ! [X2] :
( ~ ( ~ p2(X2)
| ! [X1] :
( p3(X1)
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ ! [X1] :
( ~ ! [X2] :
( ~ p2(X2)
| ! [X1] :
( p3(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ p4(X2)
| ~ r1(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
! [X9,X10,X11,X14,X15,X17,X19,X20,X23,X24,X27,X30,X32,X33,X34] :
( ( ~ p1(X34)
| ~ r1(X33,X34)
| ~ r1(X32,X33)
| ~ r1(esk1_0,X32)
| p1(esk13_1(X32)) )
& ( ~ p1(X34)
| ~ r1(X33,X34)
| ~ r1(X32,X33)
| ~ r1(esk1_0,X32)
| r1(X32,esk13_1(X32)) )
& ( ~ r1(esk11_0,X30)
| ~ p2(esk12_1(X30)) )
& ( ~ r1(esk11_0,X30)
| r1(X30,esk12_1(X30)) )
& r1(esk1_0,esk11_0)
& ~ p1(esk10_0)
& r1(esk8_0,esk10_0)
& ( p1(X27)
| ~ r1(esk9_0,X27) )
& r1(esk8_0,esk9_0)
& r1(esk1_0,esk8_0)
& ( p1(esk1_0)
| ~ r1(esk1_0,X20)
| ~ p1(esk6_1(X20))
| ~ p1(X23)
| p1(X24)
| ~ r1(X23,X24)
| ~ r1(esk7_0,X23) )
& ( p1(esk1_0)
| ~ r1(esk1_0,X20)
| ~ p1(esk6_1(X20))
| ~ p1(esk7_0) )
& ( p1(esk1_0)
| ~ r1(esk1_0,X20)
| ~ p1(esk6_1(X20))
| r1(esk1_0,esk7_0) )
& ( p1(esk1_0)
| ~ r1(esk1_0,X20)
| r1(X20,esk6_1(X20))
| ~ p1(X23)
| p1(X24)
| ~ r1(X23,X24)
| ~ r1(esk7_0,X23) )
& ( p1(esk1_0)
| ~ r1(esk1_0,X20)
| r1(X20,esk6_1(X20))
| ~ p1(esk7_0) )
& ( p1(esk1_0)
| ~ r1(esk1_0,X20)
| r1(X20,esk6_1(X20))
| r1(esk1_0,esk7_0) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X14)
| ~ p2(X14)
| ~ r1(X14,X15)
| p2(X15)
| ~ r1(X14,X17)
| ~ p2(X19)
| ~ r1(esk5_3(X10,X14,X17),X19) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X14)
| ~ p2(X14)
| ~ r1(X14,X15)
| p2(X15)
| ~ r1(X14,X17)
| r1(X17,esk5_3(X10,X14,X17)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X14)
| ~ p2(X14)
| ~ r1(X14,X15)
| ~ p3(esk4_3(X10,X14,X15))
| ~ r1(X14,X17)
| ~ p2(X19)
| ~ r1(esk5_3(X10,X14,X17),X19) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X14)
| ~ p2(X14)
| ~ r1(X14,X15)
| ~ p3(esk4_3(X10,X14,X15))
| ~ r1(X14,X17)
| r1(X17,esk5_3(X10,X14,X17)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X14)
| ~ p2(X14)
| ~ r1(X14,X15)
| r1(X15,esk4_3(X10,X14,X15))
| ~ r1(X14,X17)
| ~ p2(X19)
| ~ r1(esk5_3(X10,X14,X17),X19) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X14)
| ~ p2(X14)
| ~ r1(X14,X15)
| r1(X15,esk4_3(X10,X14,X15))
| ~ r1(X14,X17)
| r1(X17,esk5_3(X10,X14,X17)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| p2(esk2_2(X10,X11)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| ~ p3(esk3_2(X10,X11)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| r1(esk2_2(X10,X11),esk3_2(X10,X11)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| r1(X11,esk2_2(X10,X11)) )
& ( ~ p4(X9)
| ~ r1(esk1_0,X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| r1(esk2_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
r1(esk1_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X4] : r1(X4,X4),
inference(variable_rename,[status(thm)],[reflexivity]) ).
fof(c_0_9,plain,
! [X5,X6,X7] :
( r1(X5,X7)
| ~ r1(X6,X7)
| ~ r1(X5,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ r1(esk11_0,X1)
| r1(esk2_2(esk11_0,X1),esk3_2(esk11_0,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ r1(esk1_0,X2)
| ~ r1(X2,X1)
| r1(X1,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ r1(X2,X3)
| ~ r1(X1,X2)
| r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
r1(esk2_2(esk11_0,esk11_0),esk3_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ r1(esk11_0,X1)
| r1(X1,esk2_2(esk11_0,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( ~ r1(X1,esk2_2(esk11_0,esk11_0))
| r1(X1,esk3_2(esk11_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
r1(esk11_0,esk2_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| p2(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ r1(esk11_0,X1)
| r1(X1,esk12_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
r1(esk11_0,esk3_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ r1(esk1_0,X2)
| ~ r1(X2,X3)
| ~ p2(X3)
| ~ r1(X3,X4)
| ~ r1(X3,X1)
| p2(X4)
| r1(X1,esk5_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( ~ r1(X1,esk11_0)
| r1(X1,esk2_2(esk11_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1(esk11_0,X1)
| p2(esk2_2(esk11_0,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_24,negated_conjecture,
r1(esk3_2(esk11_0,esk11_0),esk12_1(esk3_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ r1(X3,X2)
| ~ r1(X3,X1)
| ~ r1(esk1_0,X3)
| ~ p2(X3)
| r1(X2,esk5_3(esk1_0,X3,X2))
| p2(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_26,negated_conjecture,
r1(esk1_0,esk2_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_22,c_0_7]) ).
cnf(c_0_27,negated_conjecture,
p2(esk2_2(esk11_0,esk11_0)),
inference(spm,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_28,negated_conjecture,
( ~ r1(X1,esk3_2(esk11_0,esk11_0))
| r1(X1,esk12_1(esk3_2(esk11_0,esk11_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1(esk2_2(esk11_0,esk11_0),X2)
| ~ r1(esk2_2(esk11_0,esk11_0),X1)
| r1(X2,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),X2))
| p2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
r1(esk2_2(esk11_0,esk11_0),esk12_1(esk3_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_31,negated_conjecture,
( ~ r1(esk2_2(esk11_0,esk11_0),X1)
| r1(X1,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),X1))
| p2(esk12_1(esk3_2(esk11_0,esk11_0))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( ~ r1(esk11_0,X1)
| ~ p2(esk12_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
( r1(esk2_2(esk11_0,esk11_0),esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)))
| p2(esk12_1(esk3_2(esk11_0,esk11_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_11]) ).
cnf(c_0_34,negated_conjecture,
r1(esk2_2(esk11_0,esk11_0),esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20])]) ).
cnf(c_0_35,negated_conjecture,
( ~ r1(X1,esk2_2(esk11_0,esk11_0))
| r1(X1,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
r1(esk11_0,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_37,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ p2(X2)
| ~ r1(X2,X5)
| ~ r1(X2,X3)
| ~ p2(X4)
| ~ r1(esk5_3(X1,X2,X3),X4)
| p2(X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_38,negated_conjecture,
r1(esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)),esk2_2(esk11_0,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)))),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
p2(esk2_2(esk11_0,esk5_3(esk1_0,esk2_2(esk11_0,esk11_0),esk2_2(esk11_0,esk11_0)))),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( ~ r1(esk2_2(esk11_0,esk11_0),X1)
| p2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_27]),c_0_11]),c_0_11]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
p2(esk12_1(esk3_2(esk11_0,esk11_0))),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_41]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL688+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n001.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 01:04:13 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 55.80/8.75 % Version: 3.5.1
% 55.80/8.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 55.80/8.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 55.80/8.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 55.80/8.75 % Starting new_bool_3 with 300s (1) cores
% 55.80/8.75 % Starting new_bool_1 with 300s (1) cores
% 55.80/8.75 % Starting sh5l with 300s (1) cores
% 55.80/8.75 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1862267 completed with status 0
% 55.80/8.75 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 55.80/8.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 55.80/8.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 55.80/8.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 55.80/8.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 55.80/8.75 % No SInE strategy applied
% 55.80/8.75 % Search class: FGHNF-FFMS31-SFFFFFNN
% 55.80/8.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 55.80/8.75 % Starting SubtermCWHack with 136s (1) cores
% 55.80/8.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 55.80/8.75 % Starting G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S065A with 136s (1) cores
% 55.80/8.75 % Starting new_bool_3 with 136s (1) cores
% 55.80/8.75 % Starting new_bool_1 with 136s (1) cores
% 55.80/8.75 % G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S065A with pid 1862276 completed with status 0
% 55.80/8.75 % Result found by G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S065A
% 55.80/8.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 55.80/8.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 55.80/8.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 55.80/8.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 55.80/8.75 % No SInE strategy applied
% 55.80/8.75 % Search class: FGHNF-FFMS31-SFFFFFNN
% 55.80/8.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 55.80/8.75 % Starting SubtermCWHack with 136s (1) cores
% 55.80/8.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 55.80/8.75 % Starting G-E--_107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S065A with 136s (1) cores
% 55.80/8.75 % Preprocessing time : 0.002 s
% 55.80/8.75 % Presaturation interreduction done
% 55.80/8.75
% 55.80/8.75 % Proof found!
% 55.80/8.75 % SZS status Theorem
% 55.80/8.75 % SZS output start CNFRefutation
% See solution above
% 55.80/8.75 % Parsed axioms : 3
% 55.80/8.75 % Removed by relevancy pruning/SinE : 0
% 55.80/8.75 % Initial clauses : 29
% 55.80/8.75 % Removed in clause preprocessing : 0
% 55.80/8.75 % Initial clauses in saturation : 29
% 55.80/8.75 % Processed clauses : 14776
% 55.80/8.75 % ...of these trivial : 25
% 55.80/8.75 % ...subsumed : 2261
% 55.80/8.75 % ...remaining for further processing : 12490
% 55.80/8.75 % Other redundant clauses eliminated : 0
% 55.80/8.75 % Clauses deleted for lack of memory : 0
% 55.80/8.75 % Backward-subsumed : 9
% 55.80/8.75 % Backward-rewritten : 131
% 55.80/8.75 % Generated clauses : 38629
% 55.80/8.75 % ...of the previous two non-redundant : 32955
% 55.80/8.75 % ...aggressively subsumed : 0
% 55.80/8.75 % Contextual simplify-reflections : 2
% 55.80/8.75 % Paramodulations : 38629
% 55.80/8.75 % Factorizations : 0
% 55.80/8.75 % NegExts : 0
% 55.80/8.75 % Equation resolutions : 0
% 55.80/8.75 % Disequality decompositions : 0
% 55.80/8.75 % Total rewrite steps : 8762
% 55.80/8.75 % ...of those cached : 6366
% 55.80/8.75 % Propositional unsat checks : 0
% 55.80/8.75 % Propositional check models : 0
% 55.80/8.75 % Propositional check unsatisfiable : 0
% 55.80/8.75 % Propositional clauses : 0
% 55.80/8.75 % Propositional clauses after purity: 0
% 55.80/8.75 % Propositional unsat core size : 0
% 55.80/8.75 % Propositional preprocessing time : 0.000
% 55.80/8.75 % Propositional encoding time : 0.000
% 55.80/8.75 % Propositional solver time : 0.000
% 55.80/8.75 % Success case prop preproc time : 0.000
% 55.80/8.75 % Success case prop encoding time : 0.000
% 55.80/8.75 % Success case prop solver time : 0.000
% 55.80/8.75 % Current number of processed clauses : 12321
% 55.80/8.75 % Positive orientable unit clauses : 4892
% 55.80/8.75 % Positive unorientable unit clauses: 0
% 55.80/8.75 % Negative unit clauses : 428
% 55.80/8.75 % Non-unit-clauses : 7001
% 55.80/8.75 % Current number of unprocessed clauses: 17624
% 55.80/8.75 % ...number of literals in the above : 51667
% 55.80/8.75 % Current number of archived formulas : 0
% 55.80/8.75 % Current number of archived clauses : 169
% 55.80/8.75 % Clause-clause subsumption calls (NU) : 7373397
% 55.80/8.75 % Rec. Clause-clause subsumption calls : 3960872
% 55.80/8.75 % Non-unit clause-clause subsumptions : 2270
% 55.80/8.75 % Unit Clause-clause subsumption calls : 1366421
% 55.80/8.75 % Rewrite failures with RHS unbound : 0
% 55.80/8.75 % BW rewrite match attempts : 173322
% 55.80/8.75 % BW rewrite match successes : 51
% 55.80/8.75 % Condensation attempts : 0
% 55.80/8.75 % Condensation successes : 0
% 55.80/8.75 % Termbank termtop insertions : 955763
% 55.80/8.75 % Search garbage collected termcells : 535
% 55.80/8.75
% 55.80/8.75 % -------------------------------------------------
% 55.80/8.75 % User time : 7.854 s
% 55.80/8.75 % System time : 0.131 s
% 55.80/8.75 % Total time : 7.986 s
% 55.80/8.75 % Maximum resident set size: 3640 pages
% 55.80/8.75
% 55.80/8.75 % -------------------------------------------------
% 55.80/8.75 % User time : 39.141 s
% 55.80/8.75 % System time : 0.881 s
% 55.80/8.75 % Total time : 40.022 s
% 55.80/8.75 % Maximum resident set size: 4864 pages
% 55.80/8.75 % E exiting
%------------------------------------------------------------------------------