%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL672+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:04 PM UTC 2026
% Result : Theorem 2.39s 0.87s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 341 ( 0 equ)
% Maximal formula atoms : 96 ( 9 avg)
% Number of connectives : 601 ( 295 ~; 253 |; 52 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 169 ( 0 sgn 118 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ! [X1] :
( ~ ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( r1(X2,X3)
& r1(X1,X2) )
=> r1(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ! [X1] :
( ~ ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_4,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ! [X1] :
( ~ ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) )
| ( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
& ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,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])])]) ).
fof(c_0_6,negated_conjecture,
! [X9,X10,X11,X13,X14,X15,X16,X17,X19,X20,X21,X22,X23,X25,X26,X28,X29,X30,X32,X36] :
( ~ p1(esk11_0)
& r1(esk1_0,esk11_0)
& ~ p1(esk10_0)
& r1(esk8_0,esk10_0)
& ( p1(X36)
| ~ r1(esk9_0,X36) )
& r1(esk8_0,esk9_0)
& r1(esk1_0,esk8_0)
& ~ p2(esk7_0)
& r1(esk1_0,esk7_0)
& ( p1(X32)
| ~ r1(esk1_0,X32)
| p2(X29)
| ~ r1(esk1_0,X29)
| ~ r1(esk1_0,X30)
| $true )
& ( p1(X32)
| ~ r1(esk1_0,X32)
| p2(X29)
| ~ r1(esk1_0,X29)
| ~ r1(esk1_0,X30)
| r1(X30,esk6_1(X30)) )
& ( p1(X28)
| ~ r1(esk1_0,X28)
| p2(X21)
| ~ r1(esk1_0,X21)
| ~ r1(esk1_0,X22)
| ~ r1(X22,X23)
| p1(X25)
| ~ r1(esk4_2(X22,X23),X25)
| ~ r1(X22,X26)
| ~ p1(esk5_2(X22,X26)) )
& ( p1(X28)
| ~ r1(esk1_0,X28)
| p2(X21)
| ~ r1(esk1_0,X21)
| ~ r1(esk1_0,X22)
| ~ r1(X22,X23)
| p1(X25)
| ~ r1(esk4_2(X22,X23),X25)
| ~ r1(X22,X26)
| r1(X26,esk5_2(X22,X26)) )
& ( p1(X28)
| ~ r1(esk1_0,X28)
| p2(X21)
| ~ r1(esk1_0,X21)
| ~ r1(esk1_0,X22)
| ~ r1(X22,X23)
| r1(X23,esk4_2(X22,X23))
| ~ r1(X22,X26)
| ~ p1(esk5_2(X22,X26)) )
& ( p1(X28)
| ~ r1(esk1_0,X28)
| p2(X21)
| ~ r1(esk1_0,X21)
| ~ r1(esk1_0,X22)
| ~ r1(X22,X23)
| r1(X23,esk4_2(X22,X23))
| ~ r1(X22,X26)
| r1(X26,esk5_2(X22,X26)) )
& ( p1(X20)
| ~ r1(esk1_0,X20)
| p2(X14)
| ~ r1(esk1_0,X14)
| ~ r1(esk1_0,X15)
| ~ r1(X15,X16)
| p1(X19)
| ~ r1(X16,X19)
| ~ r1(X16,X17)
| ~ p1(esk3_3(X15,X16,X17)) )
& ( p1(X20)
| ~ r1(esk1_0,X20)
| p2(X14)
| ~ r1(esk1_0,X14)
| ~ r1(esk1_0,X15)
| ~ r1(X15,X16)
| p1(X19)
| ~ r1(X16,X19)
| ~ r1(X16,X17)
| r1(X17,esk3_3(X15,X16,X17)) )
& ( p1(X13)
| ~ r1(esk1_0,X13)
| p2(X9)
| ~ r1(esk1_0,X9)
| ~ r1(esk1_0,X10)
| ~ p1(X10)
| ~ r1(X10,X11)
| p1(esk2_2(X10,X11)) )
& ( p1(X13)
| ~ r1(esk1_0,X13)
| p2(X9)
| ~ r1(esk1_0,X9)
| ~ r1(esk1_0,X10)
| ~ p1(X10)
| ~ r1(X10,X11)
| r1(X11,esk2_2(X10,X11)) ) ),
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_7,plain,
( ~ r1(X2,X3)
| ~ r1(X1,X2)
| r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
r1(esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ r1(esk1_0,X6)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X3,X1)
| p1(X6)
| p2(X5)
| p1(X4)
| r1(X1,esk3_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ r1(X1,esk8_0)
| r1(X1,esk10_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
r1(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ p1(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X4] : r1(X4,X4),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_15,negated_conjecture,
( ~ r1(X4,X5)
| ~ r1(X5,X3)
| ~ r1(X5,X1)
| ~ r1(esk1_0,X4)
| ~ r1(esk1_0,X2)
| r1(X3,esk3_3(X4,X5,X3))
| p2(X2)
| p1(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ r1(X1,esk1_0)
| r1(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ p2(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( ~ r1(X3,X4)
| ~ r1(X4,X2)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X3)
| r1(X2,esk3_3(X3,X4,X2))
| p1(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( ~ r1(X1,esk1_0)
| r1(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( ~ r1(X3,X2)
| ~ r1(X3,X1)
| ~ r1(esk8_0,X3)
| r1(X2,esk3_3(esk8_0,X3,X2))
| p1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( ~ r1(esk1_0,X6)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X4)
| ~ r1(X2,X3)
| ~ p1(esk3_3(X1,X2,X3))
| p1(X6)
| p2(X5)
| p1(X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1(esk9_0,X1)
| p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( ~ r1(esk8_0,X2)
| ~ r1(esk8_0,X1)
| r1(X2,esk3_3(esk8_0,esk8_0,X2))
| p1(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ~ r1(X4,X5)
| ~ r1(X5,X6)
| ~ r1(X5,X1)
| ~ r1(esk1_0,X4)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X2)
| ~ r1(esk9_0,esk3_3(X4,X5,X6))
| p2(X3)
| p1(X2)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ r1(esk8_0,X1)
| r1(X1,esk3_3(esk8_0,esk8_0,X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_10]),c_0_17])]),c_0_12]) ).
cnf(c_0_27,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
r1(esk1_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1(esk8_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X1)
| p2(X3)
| p1(X2)
| p1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_11]),c_0_27]),c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
( ~ r1(X1,esk1_0)
| r1(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ p1(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( ~ r1(esk8_0,X1)
| ~ r1(esk1_0,X2)
| p2(X2)
| p1(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( ~ r1(esk8_0,X1)
| p1(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_33]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL672+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n001.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 00:58:43 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 2.39/0.87 % Version: 3.5.1
% 2.39/0.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.39/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/0.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.39/0.87 % Starting new_bool_3 with 300s (1) cores
% 2.39/0.87 % Starting new_bool_1 with 300s (1) cores
% 2.39/0.87 % Starting sh5l with 300s (1) cores
% 2.39/0.87 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1855378 completed with status 0
% 2.39/0.87 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.39/0.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.39/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/0.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.39/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.39/0.87 % No SInE strategy applied
% 2.39/0.87 % Search class: FGUNF-FFMS32-SFFFFFNN
% 2.39/0.87 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.39/0.87 % Starting SubtermCWHack with 136s (1) cores
% 2.39/0.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.39/0.87 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.39/0.87 % Starting new_bool_3 with 136s (1) cores
% 2.39/0.87 % Starting new_bool_1 with 136s (1) cores
% 2.39/0.87 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1855385 completed with status 0
% 2.39/0.87 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.39/0.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.39/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/0.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.39/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.39/0.87 % No SInE strategy applied
% 2.39/0.87 % Search class: FGUNF-FFMS32-SFFFFFNN
% 2.39/0.87 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.39/0.87 % Starting SubtermCWHack with 136s (1) cores
% 2.39/0.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.39/0.87 % Preprocessing time : 0.002 s
% 2.39/0.87 % Presaturation interreduction done
% 2.39/0.87
% 2.39/0.87 % Proof found!
% 2.39/0.87 % SZS status Theorem
% 2.39/0.87 % SZS output start CNFRefutation
% See solution above
% 2.39/0.87 % Parsed axioms : 3
% 2.39/0.87 % Removed by relevancy pruning/SinE : 0
% 2.39/0.87 % Initial clauses : 21
% 2.39/0.87 % Removed in clause preprocessing : 1
% 2.39/0.87 % Initial clauses in saturation : 20
% 2.39/0.87 % Processed clauses : 1297
% 2.39/0.87 % ...of these trivial : 0
% 2.39/0.87 % ...subsumed : 750
% 2.39/0.87 % ...remaining for further processing : 547
% 2.39/0.87 % Other redundant clauses eliminated : 0
% 2.39/0.87 % Clauses deleted for lack of memory : 0
% 2.39/0.87 % Backward-subsumed : 76
% 2.39/0.87 % Backward-rewritten : 0
% 2.39/0.87 % Generated clauses : 6828
% 2.39/0.87 % ...of the previous two non-redundant : 6820
% 2.39/0.87 % ...aggressively subsumed : 0
% 2.39/0.87 % Contextual simplify-reflections : 37
% 2.39/0.87 % Paramodulations : 6828
% 2.39/0.87 % Factorizations : 0
% 2.39/0.87 % NegExts : 0
% 2.39/0.87 % Equation resolutions : 0
% 2.39/0.87 % Disequality decompositions : 0
% 2.39/0.87 % Total rewrite steps : 1693
% 2.39/0.87 % ...of those cached : 1683
% 2.39/0.87 % Propositional unsat checks : 0
% 2.39/0.87 % Propositional check models : 0
% 2.39/0.87 % Propositional check unsatisfiable : 0
% 2.39/0.87 % Propositional clauses : 0
% 2.39/0.87 % Propositional clauses after purity: 0
% 2.39/0.87 % Propositional unsat core size : 0
% 2.39/0.87 % Propositional preprocessing time : 0.000
% 2.39/0.87 % Propositional encoding time : 0.000
% 2.39/0.87 % Propositional solver time : 0.000
% 2.39/0.87 % Success case prop preproc time : 0.000
% 2.39/0.87 % Success case prop encoding time : 0.000
% 2.39/0.87 % Success case prop solver time : 0.000
% 2.39/0.87 % Current number of processed clauses : 451
% 2.39/0.87 % Positive orientable unit clauses : 6
% 2.39/0.87 % Positive unorientable unit clauses: 0
% 2.39/0.87 % Negative unit clauses : 7
% 2.39/0.87 % Non-unit-clauses : 438
% 2.39/0.87 % Current number of unprocessed clauses: 4985
% 2.39/0.87 % ...number of literals in the above : 28562
% 2.39/0.87 % Current number of archived formulas : 0
% 2.39/0.87 % Current number of archived clauses : 96
% 2.39/0.87 % Clause-clause subsumption calls (NU) : 150296
% 2.39/0.87 % Rec. Clause-clause subsumption calls : 71562
% 2.39/0.87 % Non-unit clause-clause subsumptions : 835
% 2.39/0.87 % Unit Clause-clause subsumption calls : 29
% 2.39/0.87 % Rewrite failures with RHS unbound : 0
% 2.39/0.87 % BW rewrite match attempts : 8
% 2.39/0.87 % BW rewrite match successes : 0
% 2.39/0.87 % Condensation attempts : 0
% 2.39/0.87 % Condensation successes : 0
% 2.39/0.87 % Termbank termtop insertions : 157837
% 2.39/0.87 % Search garbage collected termcells : 572
% 2.39/0.87
% 2.39/0.87 % -------------------------------------------------
% 2.39/0.87 % User time : 0.318 s
% 2.39/0.87 % System time : 0.013 s
% 2.39/0.87 % Total time : 0.331 s
% 2.39/0.87 % Maximum resident set size: 3584 pages
% 2.39/0.87
% 2.39/0.87 % -------------------------------------------------
% 2.39/0.87 % User time : 1.523 s
% 2.39/0.87 % System time : 0.063 s
% 2.39/0.87 % Total time : 1.586 s
% 2.39/0.87 % Maximum resident set size: 4864 pages
% 2.39/0.87 % E exiting
%------------------------------------------------------------------------------