%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG210+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 : n004.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 11:55:36 AM UTC 2026
% Result : Theorem 11.16s 2.15s
% Output : CNFRefutation 11.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 44 ( 16 unt; 0 def)
% Number of atoms : 84 ( 40 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 74 ( 34 ~; 30 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X2] :
( element(X2)
<=> ? [X3] :
( times(X2,X2) = X3
& times(X2,X3) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_1,axiom,
! [X1,X2,X3] : times(times(X1,X2),X3) = times(X2,times(X3,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(conjecture_1,conjecture,
! [X1,X2] :
( ( element(X2)
& element(X1) )
=> element(times(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
fof(c_0_3,plain,
! [X7,X9,X10] :
( ( element(X9)
| times(X9,X9) != X10
| times(X9,X10) != X9 )
& ( ~ element(X7)
| times(X7,X7) = esk1_1(X7) )
& ( ~ element(X7)
| times(X7,esk1_1(X7)) = X7 ) ),
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])])])])])])]) ).
fof(c_0_4,plain,
! [X4,X5,X6] : times(times(X4,X5),X6) = times(X5,times(X6,X4)),
inference(variable_rename,[status(thm)],[axiom_1]) ).
cnf(c_0_5,plain,
( ~ element(X1)
| times(X1,esk1_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
times(times(X1,X2),X3) = times(X2,times(X3,X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ element(times(X2,X1))
| times(X1,times(esk1_1(times(X2,X1)),X2)) = times(X2,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( ~ element(X1)
| times(X1,X1) = esk1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( ~ element(X1)
| times(esk1_1(X1),times(X2,X1)) = times(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,plain,
times(X1,times(X2,times(X3,X4))) = times(X3,times(X4,times(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_11,plain,
( ~ element(X1)
| times(esk1_1(X1),times(esk1_1(X1),X1)) = X1 ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_12,plain,
( ~ element(X1)
| times(X1,times(X1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_13,plain,
( times(X1,X1) != X2
| times(X1,X2) != X1
| element(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,plain,
( ~ element(X1)
| times(X1,times(X2,times(esk1_1(X1),X3))) = times(X1,times(X2,X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_10]) ).
cnf(c_0_15,plain,
( ~ element(X1)
| times(X1,times(esk1_1(X1),times(esk1_1(X1),X2))) = times(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_6]),c_0_6]) ).
cnf(c_0_16,plain,
( ~ element(X1)
| times(X1,times(X1,times(X2,X1))) = times(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,plain,
( ~ element(X1)
| times(esk1_1(X1),X2) = times(X1,times(X2,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1,X2] :
( ( element(X2)
& element(X1) )
=> element(times(X1,X2)) ),
inference(assume_negation,[status(cth)],[conjecture_1]) ).
cnf(c_0_19,plain,
( times(X1,times(X1,X1)) != X1
| element(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ element(X1)
| times(esk1_1(X1),esk1_1(X1)) = times(X1,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_21,plain,
( ~ element(X1)
| times(X1,times(esk1_1(X1),X2)) = times(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ element(X1)
| times(X1,times(esk1_1(X1),X2)) = times(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_23,negated_conjecture,
( ~ element(times(esk2_0,esk3_0))
& element(esk3_0)
& element(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_24,plain,
( ~ element(X1)
| times(esk1_1(X1),times(X1,X1)) != esk1_1(X1)
| element(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ element(X2)
| times(X1,X2) = times(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
element(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
( ~ element(X1)
| element(esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_9]),c_0_8]) ).
cnf(c_0_28,plain,
( ~ element(X1)
| times(X1,times(X1,times(X1,X2))) = times(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_12]),c_0_6]),c_0_6]) ).
cnf(c_0_29,negated_conjecture,
times(X1,esk3_0) = times(esk3_0,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
element(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( ~ element(X1)
| times(esk1_1(X1),times(X1,X1)) = esk1_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_27]) ).
cnf(c_0_32,plain,
( times(X2,times(X1,times(X1,times(X2,times(X2,X1))))) != times(X1,X2)
| element(times(X1,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_19,c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_33,negated_conjecture,
times(esk3_0,times(esk3_0,times(X1,esk3_0))) = times(X1,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
times(X1,esk2_0) = times(esk2_0,X1),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_35,plain,
( ~ element(X1)
| times(X1,times(X1,times(X1,X1))) = esk1_1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_6]) ).
cnf(c_0_36,negated_conjecture,
times(esk3_0,times(esk3_0,esk3_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_29]),c_0_26])]) ).
cnf(c_0_37,negated_conjecture,
~ element(times(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( ~ element(X1)
| times(esk1_1(X1),times(X1,times(X2,times(esk1_1(X1),times(X1,times(X2,times(X1,X2))))))) != times(X1,times(esk1_1(X1),X2))
| element(times(X1,times(esk1_1(X1),X2))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_32,c_0_9]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_39,negated_conjecture,
times(esk3_0,times(esk3_0,times(esk3_0,esk2_0))) = times(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
esk1_1(esk3_0) = times(esk3_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
~ element(times(esk3_0,esk2_0)),
inference(rw,[status(thm)],[c_0_37,c_0_29]) ).
cnf(c_0_42,negated_conjecture,
times(esk2_0,times(esk2_0,esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_34]),c_0_30])]) ).
cnf(c_0_43,negated_conjecture,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_38,c_0_39]),c_0_40]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_36]),c_0_29]),c_0_39]),c_0_40]),c_0_40]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_36]),c_0_29]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_36]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_36]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_29]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_40]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_36]),c_0_29]),c_0_39]),c_0_26])]),c_0_41]),c_0_10]),c_0_10]),c_0_29]),c_0_6]),c_0_6]),c_0_29]),c_0_10]),c_0_42]),c_0_39]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG210+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.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 13:01:50 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 11.16/2.15 % Version: 3.5.1
% 11.16/2.15 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.16/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.16/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.16/2.15 % Starting new_bool_3 with 300s (1) cores
% 11.16/2.15 % Starting new_bool_1 with 300s (1) cores
% 11.16/2.15 % Starting sh5l with 300s (1) cores
% 11.16/2.15 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3182016 completed with status 0
% 11.16/2.15 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.16/2.15 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.16/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.16/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.16/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.16/2.15 % No SInE strategy applied
% 11.16/2.15 % Search class: FHUSF-FFSF21-SFFFFFNN
% 11.16/2.15 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.16/2.15 % Starting SubtermCWHack with 136s (1) cores
% 11.16/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.16/2.15 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 11.16/2.15 % Starting new_bool_3 with 136s (1) cores
% 11.16/2.15 % Starting new_bool_1 with 136s (1) cores
% 11.16/2.15 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3182022 completed with status 0
% 11.16/2.15 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 11.16/2.15 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.16/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.16/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.16/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.16/2.15 % No SInE strategy applied
% 11.16/2.15 % Search class: FHUSF-FFSF21-SFFFFFNN
% 11.16/2.15 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.16/2.15 % Starting SubtermCWHack with 136s (1) cores
% 11.16/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.16/2.15 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 11.16/2.15 % Preprocessing time : 0.002 s
% 11.16/2.15 % Presaturation interreduction done
% 11.16/2.15
% 11.16/2.15 % Proof found!
% 11.16/2.15 % SZS status Theorem
% 11.16/2.15 % SZS output start CNFRefutation
% See solution above
% 11.16/2.15 % Parsed axioms : 3
% 11.16/2.15 % Removed by relevancy pruning/SinE : 0
% 11.16/2.15 % Initial clauses : 7
% 11.16/2.15 % Removed in clause preprocessing : 0
% 11.16/2.15 % Initial clauses in saturation : 7
% 11.16/2.15 % Processed clauses : 811
% 11.16/2.15 % ...of these trivial : 144
% 11.16/2.15 % ...subsumed : 507
% 11.16/2.15 % ...remaining for further processing : 159
% 11.16/2.15 % Other redundant clauses eliminated : 1
% 11.16/2.15 % Clauses deleted for lack of memory : 0
% 11.16/2.15 % Backward-subsumed : 5
% 11.16/2.15 % Backward-rewritten : 4
% 11.16/2.15 % Generated clauses : 8521
% 11.16/2.15 % ...of the previous two non-redundant : 8031
% 11.16/2.15 % ...aggressively subsumed : 0
% 11.16/2.15 % Contextual simplify-reflections : 19
% 11.16/2.15 % Paramodulations : 8520
% 11.16/2.15 % Factorizations : 0
% 11.16/2.15 % NegExts : 0
% 11.16/2.15 % Equation resolutions : 1
% 11.16/2.15 % Disequality decompositions : 0
% 11.16/2.15 % Total rewrite steps : 2355540
% 11.16/2.15 % ...of those cached : 2192956
% 11.16/2.15 % Propositional unsat checks : 0
% 11.16/2.15 % Propositional check models : 0
% 11.16/2.15 % Propositional check unsatisfiable : 0
% 11.16/2.15 % Propositional clauses : 0
% 11.16/2.15 % Propositional clauses after purity: 0
% 11.16/2.15 % Propositional unsat core size : 0
% 11.16/2.15 % Propositional preprocessing time : 0.000
% 11.16/2.15 % Propositional encoding time : 0.000
% 11.16/2.15 % Propositional solver time : 0.000
% 11.16/2.15 % Success case prop preproc time : 0.000
% 11.16/2.15 % Success case prop encoding time : 0.000
% 11.16/2.15 % Success case prop solver time : 0.000
% 11.16/2.15 % Current number of processed clauses : 142
% 11.16/2.15 % Positive orientable unit clauses : 13
% 11.16/2.15 % Positive unorientable unit clauses: 3
% 11.16/2.15 % Negative unit clauses : 1
% 11.16/2.15 % Non-unit-clauses : 125
% 11.16/2.15 % Current number of unprocessed clauses: 7230
% 11.16/2.15 % ...number of literals in the above : 20960
% 11.16/2.15 % Current number of archived formulas : 0
% 11.16/2.15 % Current number of archived clauses : 16
% 11.16/2.15 % Clause-clause subsumption calls (NU) : 7810
% 11.16/2.15 % Rec. Clause-clause subsumption calls : 7745
% 11.16/2.15 % Non-unit clause-clause subsumptions : 531
% 11.16/2.15 % Unit Clause-clause subsumption calls : 1
% 11.16/2.15 % Rewrite failures with RHS unbound : 0
% 11.16/2.15 % BW rewrite match attempts : 18
% 11.16/2.15 % BW rewrite match successes : 15
% 11.16/2.15 % Condensation attempts : 0
% 11.16/2.15 % Condensation successes : 0
% 11.16/2.15 % Termbank termtop insertions : 1639257
% 11.16/2.15 % Search garbage collected termcells : 94
% 11.16/2.15
% 11.16/2.15 % -------------------------------------------------
% 11.16/2.15 % User time : 1.400 s
% 11.16/2.15 % System time : 0.209 s
% 11.16/2.15 % Total time : 1.609 s
% 11.16/2.15 % Maximum resident set size: 3372 pages
% 11.16/2.15
% 11.16/2.15 % -------------------------------------------------
% 11.16/2.15 % User time : 7.057 s
% 11.16/2.15 % System time : 0.958 s
% 11.16/2.15 % Total time : 8.015 s
% 11.16/2.15 % Maximum resident set size: 4608 pages
% 11.16/2.15 % E exiting
%------------------------------------------------------------------------------