%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KRS080+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:01:27 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 4 unt; 0 def)
% Number of atoms : 402 ( 63 equ)
% Maximal formula atoms : 235 ( 9 avg)
% Number of connectives : 632 ( 272 ~; 302 |; 53 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 60 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-1 aty)
% Number of variables : 72 ( 1 sgn 24 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( cp(X5)
& cp2(X5)
& rr(X4,X5) )
& ? [X5] :
( cp3(X5)
& cp(X5)
& rr(X4,X5) )
& ? [X5] :
( cp3(X5)
& rr(X4,X5) )
& ? [X5] :
( cp2(X5)
& rr(X4,X5) )
& ! [X6,X7,X8,X9] :
( ( rr(X4,X9)
& rr(X4,X8)
& rr(X4,X7)
& rr(X4,X6) )
=> ( X8 = X9
| X7 = X9
| X7 = X8
| X6 = X9
| X6 = X8
| X6 = X7 ) )
& ? [X5] :
( cp4(X5)
& rr(X4,X5) )
& ? [X5] :
( cp1(X5)
& rr(X4,X5) )
& ? [X5] :
( cp1(X5)
& cp(X5)
& rr(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp3(X4)
| cp5(X4)
| cp4(X4)
| cp2(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
=> ~ ( cp3(X4)
| cp5(X4)
| cp4(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X4] :
( cp3(X4)
=> ~ ( cp5(X4)
| cp4(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_21224),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(c_0_5,plain,
! [X40,X44,X45,X46,X47,X52,X53,X54,X55,X60,X61,X62,X63] :
( ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| esk10_1(X52) != esk11_1(X52) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| esk9_1(X52) != esk11_1(X52) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| esk9_1(X52) != esk10_1(X52) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| esk8_1(X52) != esk11_1(X52) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| esk8_1(X52) != esk10_1(X52) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| esk8_1(X52) != esk9_1(X52) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| rr(X52,esk11_1(X52)) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| rr(X52,esk10_1(X52)) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| rr(X52,esk9_1(X52)) )
& ( cUnsatisfiable(X52)
| ~ cp(X63)
| ~ cp2(X63)
| ~ rr(X52,X63)
| ~ cp3(X62)
| ~ cp(X62)
| ~ rr(X52,X62)
| ~ cp3(X61)
| ~ rr(X52,X61)
| ~ cp2(X60)
| ~ rr(X52,X60)
| ~ cp4(X55)
| ~ rr(X52,X55)
| ~ cp1(X54)
| ~ rr(X52,X54)
| ~ cp1(X53)
| ~ cp(X53)
| ~ rr(X52,X53)
| rr(X52,esk8_1(X52)) )
& ( ~ cUnsatisfiable(X40)
| cp(esk7_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp2(esk7_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk7_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp3(esk6_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp(esk6_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk6_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp3(esk5_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk5_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp2(esk4_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk4_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| X46 = X47
| X45 = X47
| X45 = X46
| X44 = X47
| X44 = X46
| X44 = X45
| ~ rr(X40,X47)
| ~ rr(X40,X46)
| ~ rr(X40,X45)
| ~ rr(X40,X44) )
& ( ~ cUnsatisfiable(X40)
| cp4(esk3_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk3_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp1(esk2_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk2_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp1(esk1_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| cp(esk1_1(X40)) )
& ( ~ cUnsatisfiable(X40)
| rr(X40,esk1_1(X40)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])]) ).
cnf(c_0_6,plain,
( ~ cUnsatisfiable(X1)
| ~ rr(X1,X5)
| ~ rr(X1,X4)
| ~ rr(X1,X3)
| ~ rr(X1,X2)
| X4 = X5
| X3 = X5
| X3 = X4
| X2 = X5
| X2 = X4
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ cUnsatisfiable(X2)
| ~ rr(X2,X1)
| ~ rr(X2,X3)
| ~ rr(X2,X4)
| X3 = X4
| X1 = X4
| X1 = X3
| X4 = esk7_1(X2)
| X3 = esk7_1(X2)
| X1 = esk7_1(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X64] :
( ( ~ cp1(X64)
| ~ cp3(X64) )
& ( ~ cp1(X64)
| ~ cp5(X64) )
& ( ~ cp1(X64)
| ~ cp4(X64) )
& ( ~ cp1(X64)
| ~ cp2(X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_11,plain,
( ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2)
| X3 = X2
| X3 = esk7_1(X1)
| X2 = esk7_1(X1)
| X3 = esk6_1(X1)
| X2 = esk6_1(X1)
| esk7_1(X1) = esk6_1(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X65] :
( ( ~ cp2(X65)
| ~ cp3(X65) )
& ( ~ cp2(X65)
| ~ cp5(X65) )
& ( ~ cp2(X65)
| ~ cp4(X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])]) ).
cnf(c_0_14,plain,
( ~ cp1(X1)
| ~ cp4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ cUnsatisfiable(X1)
| cp4(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| ~ rr(X1,X2)
| X2 = esk6_1(X1)
| X2 = esk7_1(X1)
| X2 = esk3_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk7_1(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ cUnsatisfiable(X1)
| rr(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_18,plain,
! [X66] :
( ( ~ cp3(X66)
| ~ cp5(X66) )
& ( ~ cp3(X66)
| ~ cp4(X66) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])]) ).
cnf(c_0_19,plain,
( ~ cp2(X1)
| ~ cp4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = esk7_1(X1)
| esk3_1(X1) = esk6_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk2_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk2_1(X1) = esk6_1(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ cUnsatisfiable(X1)
| cp1(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( ~ cp3(X1)
| ~ cp4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ cUnsatisfiable(X1)
| ~ cp2(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk7_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,plain,
( ~ cUnsatisfiable(X1)
| cp2(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,plain,
( ~ cUnsatisfiable(X1)
| ~ cp3(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_28,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) = esk6_1(X1)
| esk7_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk2_1(X1) = esk6_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
( ~ cUnsatisfiable(X1)
| cp3(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk7_1(X1)
| esk7_1(X1) = esk6_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_33,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( ~ cUnsatisfiable(X1)
| esk7_1(X1) = esk6_1(X1)
| esk2_1(X1) = esk6_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk6_1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_36,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,plain,
( ~ cUnsatisfiable(X1)
| esk7_1(X1) = esk6_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
( ~ cUnsatisfiable(X1)
| ~ cp2(esk6_1(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_39,plain,
cUnsatisfiable(i2003_11_14_17_19_21224),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_40,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS080+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n011.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Sun Sep 20 22:52:40 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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
% 0.13/0.46 % Version: 3.5.1
% 0.13/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.46 % Starting sh5l with 300s (1) cores
% 0.13/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 367796 completed with status 0
% 0.13/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.46 % No SInE strategy applied
% 0.13/0.46 % Search class: FGHSF-FFMF11-SFFFFFNN
% 0.13/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.46 % new_bool_3 with pid 367820 completed with status 0
% 0.13/0.46 % Result found by new_bool_3
% 0.13/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.46 % No SInE strategy applied
% 0.13/0.46 % Search class: FGHSF-FFMF11-SFFFFFNN
% 0.13/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.46 % Preprocessing time : 0.001 s
% 0.13/0.46 % Presaturation interreduction done
% 0.13/0.46
% 0.13/0.46 % Proof found!
% 0.13/0.46 % SZS status Unsatisfiable
% 0.13/0.46 % SZS output start CNFRefutation
% See solution above
% 0.13/0.46 % Parsed axioms : 21
% 0.13/0.46 % Removed by relevancy pruning/SinE : 0
% 0.13/0.46 % Initial clauses : 56
% 0.13/0.46 % Removed in clause preprocessing : 14
% 0.13/0.46 % Initial clauses in saturation : 42
% 0.13/0.46 % Processed clauses : 162
% 0.13/0.46 % ...of these trivial : 0
% 0.13/0.46 % ...subsumed : 31
% 0.13/0.46 % ...remaining for further processing : 131
% 0.13/0.46 % Other redundant clauses eliminated : 0
% 0.13/0.46 % Clauses deleted for lack of memory : 0
% 0.13/0.46 % Backward-subsumed : 64
% 0.13/0.46 % Backward-rewritten : 0
% 0.13/0.46 % Generated clauses : 231
% 0.13/0.46 % ...of the previous two non-redundant : 210
% 0.13/0.46 % ...aggressively subsumed : 0
% 0.13/0.46 % Contextual simplify-reflections : 15
% 0.13/0.46 % Paramodulations : 211
% 0.13/0.46 % Factorizations : 19
% 0.13/0.46 % NegExts : 0
% 0.13/0.46 % Equation resolutions : 0
% 0.13/0.46 % Disequality decompositions : 0
% 0.13/0.46 % Total rewrite steps : 0
% 0.13/0.46 % ...of those cached : 0
% 0.13/0.46 % Propositional unsat checks : 0
% 0.13/0.46 % Propositional check models : 0
% 0.13/0.46 % Propositional check unsatisfiable : 0
% 0.13/0.46 % Propositional clauses : 0
% 0.13/0.46 % Propositional clauses after purity: 0
% 0.13/0.46 % Propositional unsat core size : 0
% 0.13/0.46 % Propositional preprocessing time : 0.000
% 0.13/0.46 % Propositional encoding time : 0.000
% 0.13/0.46 % Propositional solver time : 0.000
% 0.13/0.46 % Success case prop preproc time : 0.000
% 0.13/0.46 % Success case prop encoding time : 0.000
% 0.13/0.46 % Success case prop solver time : 0.000
% 0.13/0.46 % Current number of processed clauses : 24
% 0.13/0.46 % Positive orientable unit clauses : 0
% 0.13/0.46 % Positive unorientable unit clauses: 0
% 0.13/0.46 % Negative unit clauses : 2
% 0.13/0.46 % Non-unit-clauses : 22
% 0.13/0.46 % Current number of unprocessed clauses: 96
% 0.13/0.46 % ...number of literals in the above : 1073
% 0.13/0.46 % Current number of archived formulas : 0
% 0.13/0.46 % Current number of archived clauses : 108
% 0.13/0.46 % Clause-clause subsumption calls (NU) : 4602
% 0.13/0.46 % Rec. Clause-clause subsumption calls : 2818
% 0.13/0.46 % Non-unit clause-clause subsumptions : 73
% 0.13/0.46 % Unit Clause-clause subsumption calls : 37
% 0.13/0.46 % Rewrite failures with RHS unbound : 0
% 0.13/0.46 % BW rewrite match attempts : 0
% 0.13/0.46 % BW rewrite match successes : 0
% 0.13/0.46 % Condensation attempts : 0
% 0.13/0.46 % Condensation successes : 0
% 0.13/0.46 % Termbank termtop insertions : 10707
% 0.13/0.46 % Search garbage collected termcells : 957
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.015 s
% 0.13/0.46 % System time : 0.007 s
% 0.13/0.46 % Total time : 0.022 s
% 0.13/0.46 % Maximum resident set size: 3660 pages
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.067 s
% 0.13/0.46 % System time : 0.018 s
% 0.13/0.46 % Total time : 0.084 s
% 0.13/0.46 % Maximum resident set size: 4864 pages
% 0.13/0.46 % E exiting
%------------------------------------------------------------------------------