%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO014+2 : 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 : 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:59:34 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 224 ( 0 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 283 ( 104 ~; 116 |; 56 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 78 ( 0 sgn 32 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( leaf(X104,tptp0)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( leaf(X100,tptp0)
& next_subocc(X99,X100,tptp0)
& ( occurrence_of(X100,tptp1)
| occurrence_of(X100,tptp2) )
& next_subocc(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( ~ ? [X19] :
( min_precedes(X19,X17,X18)
& min_precedes(X16,X19,X18) )
& min_precedes(X16,X17,X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X2,X3,X4)
& min_precedes(X1,X2,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(c_0_4,negated_conjecture,
~ ! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( leaf(X104,tptp0)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,plain,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( leaf(X100,tptp0)
& next_subocc(X99,X100,tptp0)
& ( occurrence_of(X100,tptp1)
| occurrence_of(X100,tptp2) )
& next_subocc(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_6,negated_conjecture,
~ ! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( leaf(X104,tptp0)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X217,X218] :
( ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| leaf(esk17_1(X217),tptp0) )
& ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| next_subocc(esk16_1(X217),esk17_1(X217),tptp0) )
& ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| occurrence_of(esk17_1(X217),tptp1)
| occurrence_of(esk17_1(X217),tptp2) )
& ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| next_subocc(esk15_1(X217),esk16_1(X217),tptp0) )
& ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| occurrence_of(esk16_1(X217),tptp4) )
& ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| next_subocc(X217,esk15_1(X217),tptp0) )
& ( leaf_occ(X217,X218)
| ~ arboreal(X217)
| ~ subactivity_occurrence(X217,X218)
| ~ occurrence_of(X218,tptp0)
| occurrence_of(esk15_1(X217),tptp3) ) ),
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)],[c_0_5])])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X224,X225] :
( ( ~ leaf(X225,tptp0)
| ~ min_precedes(X224,X225,tptp0)
| ~ next_subocc(esk18_0,X224,tptp0)
| ~ occurrence_of(X224,tptp3)
| ~ occurrence_of(X225,tptp1) )
& ( ~ leaf(X225,tptp0)
| ~ min_precedes(X224,X225,tptp0)
| ~ next_subocc(esk18_0,X224,tptp0)
| ~ occurrence_of(X224,tptp3)
| ~ occurrence_of(X225,tptp2) )
& ~ leaf_occ(esk18_0,esk19_0)
& arboreal(esk18_0)
& subactivity_occurrence(esk18_0,esk19_0)
& occurrence_of(esk19_0,tptp0) ),
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_6])])])])])]) ).
cnf(c_0_9,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf(esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X120,X121,X122,X123,X124,X125,X126] :
( ( next_subocc(X124,X125,X126)
| ~ min_precedes(X124,X125,X126)
| min_precedes(esk1_3(X124,X125,X126),X125,X126) )
& ( next_subocc(X124,X125,X126)
| ~ min_precedes(X124,X125,X126)
| min_precedes(X124,esk1_3(X124,X125,X126),X126) )
& ( ~ next_subocc(X120,X121,X122)
| ~ min_precedes(X123,X121,X122)
| ~ min_precedes(X120,X123,X122) )
& ( ~ next_subocc(X120,X121,X122)
| min_precedes(X120,X121,X122) ) ),
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)],[sos_04])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| leaf_occ(X1,esk19_0)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
arboreal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk15_1(X1),esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| leaf_occ(X1,esk19_0)
| leaf(esk17_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_19,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp1)
| occurrence_of(esk17_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
! [X105,X106,X107,X108] :
( min_precedes(X105,X107,X108)
| ~ min_precedes(X106,X107,X108)
| ~ min_precedes(X105,X106,X108) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_21,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
next_subocc(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| leaf_occ(X1,esk19_0)
| next_subocc(esk15_1(X1),esk16_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_24,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk18_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
leaf(esk17_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| occurrence_of(esk17_1(X1),tptp2)
| occurrence_of(esk17_1(X1),tptp1)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_27,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk18_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,plain,
( ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( ~ min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk17_1(esk18_0),tptp1)
| ~ next_subocc(esk18_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( occurrence_of(esk17_1(esk18_0),tptp1)
| occurrence_of(esk17_1(esk18_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_35,negated_conjecture,
( ~ min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk17_1(esk18_0),tptp2)
| ~ next_subocc(esk18_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_37,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| leaf_occ(X1,esk19_0)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( ~ min_precedes(X1,esk16_1(esk18_0),tptp0)
| min_precedes(X1,esk17_1(esk18_0),tptp0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( ~ min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ next_subocc(esk18_0,X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_42,negated_conjecture,
next_subocc(esk18_0,esk15_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_43,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO014+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:42:40 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 893165 completed with status 0
% 0.13/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.13/0.45 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 893172 completed with status 0
% 0.13/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.45 % Preprocessing time : 0.001 s
% 0.13/0.45 % Presaturation interreduction done
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 46
% 0.13/0.45 % Removed by relevancy pruning/SinE : 0
% 0.13/0.45 % Initial clauses : 88
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 88
% 0.13/0.45 % Processed clauses : 499
% 0.13/0.45 % ...of these trivial : 8
% 0.13/0.45 % ...subsumed : 58
% 0.13/0.45 % ...remaining for further processing : 433
% 0.13/0.45 % Other redundant clauses eliminated : 0
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 7
% 0.13/0.45 % Backward-rewritten : 21
% 0.13/0.45 % Generated clauses : 695
% 0.13/0.45 % ...of the previous two non-redundant : 561
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 3
% 0.13/0.45 % Paramodulations : 695
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 0
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 412
% 0.13/0.45 % ...of those cached : 342
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 317
% 0.13/0.45 % Positive orientable unit clauses : 95
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 70
% 0.13/0.45 % Non-unit-clauses : 152
% 0.13/0.45 % Current number of unprocessed clauses: 228
% 0.13/0.45 % ...number of literals in the above : 533
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 116
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 10233
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 4889
% 0.13/0.45 % Non-unit clause-clause subsumptions : 28
% 0.13/0.45 % Unit Clause-clause subsumption calls : 850
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 22
% 0.13/0.45 % BW rewrite match successes : 10
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 17096
% 0.13/0.45 % Search garbage collected termcells : 1333
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.021 s
% 0.13/0.45 % System time : 0.007 s
% 0.13/0.45 % Total time : 0.028 s
% 0.13/0.45 % Maximum resident set size: 3992 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.096 s
% 0.13/0.45 % System time : 0.018 s
% 0.13/0.45 % Total time : 0.114 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------