%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV384+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 02:54:37 PM UTC 2026
% Result : Theorem 0.31s 0.55s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 169 ( 0 equ)
% Maximal formula atoms : 42 ( 4 avg)
% Number of connectives : 238 ( 107 ~; 102 |; 11 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-3 aty)
% Number of variables : 111 ( 0 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l20_co,conjecture,
! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l20_co) ).
fof(l20_induction,axiom,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) )
=> ( ~ ok(im_succ_cpq(triple(X4,X5,X6)))
| ~ check_cpq(im_succ_cpq(triple(X4,X5,X6))) ) ) )
=> ! [X7,X8,X9] :
( ( ~ ok(triple(X7,X8,X9))
| ~ check_cpq(triple(X7,X8,X9)) )
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ( ~ check_cpq(triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l20_induction) ).
fof(l12_l13,lemma,
! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12_l13) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
inference(assume_negation,[status(cth)],[l20_co]) ).
fof(c_0_4,plain,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) )
=> ( ~ ok(im_succ_cpq(triple(X4,X5,X6)))
| ~ check_cpq(im_succ_cpq(triple(X4,X5,X6))) ) ) )
=> ! [X7,X8,X9] :
( ( ~ ok(triple(X7,X8,X9))
| ~ check_cpq(triple(X7,X8,X9)) )
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ( ~ check_cpq(triple(X10,X11,X12))
| ~ ok(triple(X10,X11,X12)) ) ) ) ),
inference(fof_simplification,[status(thm)],[l20_induction]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X132,X133,X134,X135,X136,X137] :
( ( ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134)) )
& ( ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| check_cpq(triple(X132,X133,X134)) )
& ( check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134)) )
& ( check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| check_cpq(triple(X132,X133,X134)) )
& ( ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134)) )
& ( ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| check_cpq(triple(X132,X133,X134)) )
& ( succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ok(triple(X132,X133,X134)) )
& ( succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| check_cpq(triple(X132,X133,X134)) ) ),
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])])])])])]) ).
fof(c_0_7,negated_conjecture,
( check_cpq(triple(esk10_0,esk11_0,esk12_0))
& ok(triple(esk10_0,esk11_0,esk12_0))
& succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))
& ( ~ ok(triple(esk7_0,esk8_0,esk9_0))
| ~ check_cpq(triple(esk7_0,esk8_0,esk9_0)) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,lemma,
! [X1,X2,X3] :
( ( ~ ok(triple(X1,X2,X3))
| ~ check_cpq(triple(X1,X2,X3)) )
=> ( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[l12_l13]) ).
cnf(c_0_9,plain,
( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
ok(triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
check_cpq(triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,lemma,
! [X138,X139,X140] :
( ( ~ ok(im_succ_cpq(triple(X138,X139,X140)))
| ~ check_cpq(im_succ_cpq(triple(X138,X139,X140)))
| ok(triple(X138,X139,X140)) )
& ( ~ ok(im_succ_cpq(triple(X138,X139,X140)))
| ~ check_cpq(im_succ_cpq(triple(X138,X139,X140)))
| check_cpq(triple(X138,X139,X140)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_15,plain,
( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ~ ok(triple(esk7_0,esk8_0,esk9_0))
| ~ check_cpq(triple(esk7_0,esk8_0,esk9_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ok(triple(esk7_0,esk8_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[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_18,negated_conjecture,
( check_cpq(triple(esk7_0,esk8_0,esk9_0))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_19,plain,
( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,lemma,
( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( ok(triple(esk7_0,esk8_0,esk9_0))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_22,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( check_cpq(triple(esk7_0,esk8_0,esk9_0))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_24,lemma,
( ~ ok(im_succ_cpq(triple(X1,X2,X3)))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,lemma,
( check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ok(triple(esk7_0,esk8_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,lemma,
( check_cpq(triple(esk4_0,esk5_0,esk6_0))
| check_cpq(triple(esk7_0,esk8_0,esk9_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_18]) ).
cnf(c_0_27,lemma,
( ok(triple(esk4_0,esk5_0,esk6_0))
| ok(triple(esk7_0,esk8_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_22])]) ).
cnf(c_0_28,lemma,
( check_cpq(triple(esk7_0,esk8_0,esk9_0))
| ok(triple(esk4_0,esk5_0,esk6_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_18]) ).
cnf(c_0_29,plain,
( ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_28]) ).
cnf(c_0_32,plain,
( ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ok(triple(X1,X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),c_0_31])]) ).
cnf(c_0_33,plain,
( ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
ok(triple(esk7_0,esk8_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_35,plain,
( ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| check_cpq(triple(X1,X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_30])]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
~ check_cpq(triple(esk7_0,esk8_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_10]),c_0_11]),c_0_12])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV384+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/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 : Mon Sep 21 08:44:10 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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
% 0.31/0.54 % Version: 3.5.1
% 0.31/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.54 % Starting sh5l with 300s (1) cores
% 0.31/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1501271 completed with status 0
% 0.31/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.31/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.54 % No SInE strategy applied
% 0.31/0.54 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.31/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.31/0.54 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.31/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.31/0.55 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.31/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 1501280 completed with status 0
% 0.31/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.31/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.55 % No SInE strategy applied
% 0.31/0.55 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.31/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.31/0.55 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.31/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.31/0.55 % Preprocessing time : 0.003 s
% 0.31/0.55 % Presaturation interreduction done
% 0.31/0.55
% 0.31/0.55 % Proof found!
% 0.31/0.55 % SZS status Theorem
% 0.31/0.55 % SZS output start CNFRefutation
% See solution above
% 0.31/0.55 % Parsed axioms : 44
% 0.31/0.55 % Removed by relevancy pruning/SinE : 0
% 0.31/0.55 % Initial clauses : 66
% 0.31/0.55 % Removed in clause preprocessing : 4
% 0.31/0.55 % Initial clauses in saturation : 62
% 0.31/0.55 % Processed clauses : 237
% 0.31/0.55 % ...of these trivial : 1
% 0.31/0.55 % ...subsumed : 30
% 0.31/0.55 % ...remaining for further processing : 206
% 0.31/0.55 % Other redundant clauses eliminated : 3
% 0.31/0.55 % Clauses deleted for lack of memory : 0
% 0.31/0.55 % Backward-subsumed : 20
% 0.31/0.55 % Backward-rewritten : 16
% 0.31/0.55 % Generated clauses : 306
% 0.31/0.55 % ...of the previous two non-redundant : 266
% 0.31/0.55 % ...aggressively subsumed : 0
% 0.31/0.55 % Contextual simplify-reflections : 7
% 0.31/0.55 % Paramodulations : 300
% 0.31/0.55 % Factorizations : 2
% 0.31/0.55 % NegExts : 0
% 0.31/0.55 % Equation resolutions : 3
% 0.31/0.55 % Disequality decompositions : 0
% 0.31/0.55 % Total rewrite steps : 115
% 0.31/0.55 % ...of those cached : 83
% 0.31/0.55 % Propositional unsat checks : 0
% 0.31/0.55 % Propositional check models : 0
% 0.31/0.55 % Propositional check unsatisfiable : 0
% 0.31/0.55 % Propositional clauses : 0
% 0.31/0.55 % Propositional clauses after purity: 0
% 0.31/0.55 % Propositional unsat core size : 0
% 0.31/0.55 % Propositional preprocessing time : 0.000
% 0.31/0.55 % Propositional encoding time : 0.000
% 0.31/0.55 % Propositional solver time : 0.000
% 0.31/0.55 % Success case prop preproc time : 0.000
% 0.31/0.55 % Success case prop encoding time : 0.000
% 0.31/0.55 % Success case prop solver time : 0.000
% 0.31/0.55 % Current number of processed clauses : 104
% 0.31/0.55 % Positive orientable unit clauses : 32
% 0.31/0.55 % Positive unorientable unit clauses: 0
% 0.31/0.55 % Negative unit clauses : 19
% 0.31/0.55 % Non-unit-clauses : 53
% 0.31/0.55 % Current number of unprocessed clauses: 145
% 0.31/0.55 % ...number of literals in the above : 429
% 0.31/0.55 % Current number of archived formulas : 0
% 0.31/0.55 % Current number of archived clauses : 102
% 0.31/0.55 % Clause-clause subsumption calls (NU) : 2001
% 0.31/0.55 % Rec. Clause-clause subsumption calls : 764
% 0.31/0.55 % Non-unit clause-clause subsumptions : 33
% 0.31/0.55 % Unit Clause-clause subsumption calls : 259
% 0.31/0.55 % Rewrite failures with RHS unbound : 0
% 0.31/0.55 % BW rewrite match attempts : 43
% 0.31/0.55 % BW rewrite match successes : 9
% 0.31/0.55 % Condensation attempts : 0
% 0.31/0.55 % Condensation successes : 0
% 0.31/0.55 % Termbank termtop insertions : 11213
% 0.31/0.55 % Search garbage collected termcells : 769
% 0.31/0.55
% 0.31/0.55 % -------------------------------------------------
% 0.31/0.55 % User time : 0.033 s
% 0.31/0.55 % System time : 0.010 s
% 0.31/0.55 % Total time : 0.043 s
% 0.31/0.55 % Maximum resident set size: 3696 pages
% 0.31/0.55
% 0.31/0.55 % -------------------------------------------------
% 0.31/0.55 % User time : 0.088 s
% 0.31/0.55 % System time : 0.029 s
% 0.31/0.55 % Total time : 0.117 s
% 0.31/0.55 % Maximum resident set size: 4864 pages
% 0.31/0.55 % E exiting
%------------------------------------------------------------------------------