%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU017+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:23:41 PM UTC 2026
% Result : Theorem 46.26s 6.50s
% Output : CNFRefutation 46.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 13 unt; 0 def)
% Number of atoms : 242 ( 67 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 308 ( 118 ~; 124 |; 45 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-3 aty)
% Number of variables : 92 ( 1 sgn 52 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(t50_funct_1,conjecture,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( ( relation_composition(X3,X2) = X2
& one_to_one(X2)
& subset(relation_rng(X3),X1)
& relation_dom(X3) = X1
& relation_dom(X2) = X1 )
=> X3 = identity_relation(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_funct_1) ).
fof(t34_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( X2 = identity_relation(X1)
<=> ( ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 )
& relation_dom(X2) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t34_funct_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_funct_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(d8_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( apply(X1,X2) = apply(X1,X3)
& in(X3,relation_dom(X1))
& in(X2,relation_dom(X1)) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_funct_1) ).
fof(t23_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(c_0_9,plain,
! [X65,X66,X67] :
( element(X65,X67)
| ~ element(X66,powerset(X67))
| ~ in(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_10,plain,
! [X63,X64] :
( ( element(X63,powerset(X64))
| ~ subset(X63,X64) )
& ( subset(X63,X64)
| ~ element(X63,powerset(X64)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( ( relation_composition(X3,X2) = X2
& one_to_one(X2)
& subset(relation_rng(X3),X1)
& relation_dom(X3) = X1
& relation_dom(X2) = X1 )
=> X3 = identity_relation(X1) ) ) ),
inference(assume_negation,[status(cth)],[t50_funct_1]) ).
fof(c_0_12,plain,
! [X59,X60,X61] :
( ( ~ function(X60)
| ~ relation(X60)
| X60 = identity_relation(X59)
| relation_dom(X60) != X59
| apply(X60,esk15_2(X59,X60)) != esk15_2(X59,X60) )
& ( ~ function(X60)
| ~ relation(X60)
| X60 = identity_relation(X59)
| relation_dom(X60) != X59
| in(esk15_2(X59,X60),X59) )
& ( ~ function(X60)
| ~ relation(X60)
| X60 != identity_relation(X59)
| apply(X60,X61) = X61
| ~ in(X61,X59) )
& ( ~ function(X60)
| ~ relation(X60)
| X60 != identity_relation(X59)
| relation_dom(X60) = X59 ) ),
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)],[t34_funct_1])])])])])]) ).
cnf(c_0_13,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
( esk18_0 != identity_relation(esk16_0)
& relation_composition(esk18_0,esk17_0) = esk17_0
& one_to_one(esk17_0)
& subset(relation_rng(esk18_0),esk16_0)
& relation_dom(esk18_0) = esk16_0
& relation_dom(esk17_0) = esk16_0
& function(esk18_0)
& relation(esk18_0)
& function(esk17_0)
& relation(esk17_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_16,plain,
! [X9,X10,X11,X13,X14,X15,X17] :
( ( ~ function(X9)
| ~ relation(X9)
| X15 = relation_rng(X9)
| in(esk2_2(X9,X15),X15)
| esk2_2(X9,X15) = apply(X9,esk3_2(X9,X15)) )
& ( ~ function(X9)
| ~ relation(X9)
| X15 = relation_rng(X9)
| in(esk2_2(X9,X15),X15)
| in(esk3_2(X9,X15),relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| X15 = relation_rng(X9)
| esk2_2(X9,X15) != apply(X9,X17)
| ~ in(X17,relation_dom(X9))
| ~ in(esk2_2(X9,X15),X15) )
& ( ~ function(X9)
| ~ relation(X9)
| X10 != relation_rng(X9)
| in(X13,X10)
| X13 != apply(X9,X14)
| ~ in(X14,relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| X10 != relation_rng(X9)
| ~ in(X11,X10)
| X11 = apply(X9,esk1_3(X9,X10,X11)) )
& ( ~ function(X9)
| ~ relation(X9)
| X10 != relation_rng(X9)
| ~ in(X11,X10)
| in(esk1_3(X9,X10,X11),relation_dom(X9)) ) ),
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)],[d5_funct_1])])])])])])]) ).
cnf(c_0_17,plain,
( ~ function(X2)
| ~ relation(X2)
| relation_dom(X2) != X1
| X2 = identity_relation(X1)
| in(esk15_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ in(X1,X3)
| ~ subset(X3,X2)
| element(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
subset(relation_rng(esk18_0),esk16_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ function(X2)
| ~ relation(X2)
| X4 != relation_rng(X2)
| X3 != apply(X2,X1)
| ~ in(X1,relation_dom(X2))
| in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X75,X76] :
( ~ empty(X76)
| ~ in(X75,X76) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_22,plain,
( ~ function(X1)
| ~ relation(X1)
| in(esk15_2(relation_dom(X1),X1),relation_dom(X1))
| identity_relation(relation_dom(X1)) = X1 ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
relation(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
relation_dom(esk18_0) = esk16_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
function(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
esk18_0 != identity_relation(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X19,X20,X21] :
( ( ~ function(X19)
| ~ relation(X19)
| one_to_one(X19)
| esk4_1(X19) != esk5_1(X19) )
& ( ~ function(X19)
| ~ relation(X19)
| one_to_one(X19)
| apply(X19,esk4_1(X19)) = apply(X19,esk5_1(X19)) )
& ( ~ function(X19)
| ~ relation(X19)
| one_to_one(X19)
| in(esk5_1(X19),relation_dom(X19)) )
& ( ~ function(X19)
| ~ relation(X19)
| one_to_one(X19)
| in(esk4_1(X19),relation_dom(X19)) )
& ( ~ function(X19)
| ~ relation(X19)
| X20 = X21
| apply(X19,X20) != apply(X19,X21)
| ~ in(X21,relation_dom(X19))
| ~ in(X20,relation_dom(X19))
| ~ one_to_one(X19) ) ),
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)],[d8_funct_1])])])])])]) ).
fof(c_0_28,plain,
! [X54,X55,X56] :
( apply(relation_composition(X55,X56),X54) = apply(X56,apply(X55,X54))
| ~ in(X54,relation_dom(X55))
| ~ function(X56)
| ~ relation(X56)
| ~ function(X55)
| ~ relation(X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])])]) ).
fof(c_0_29,plain,
! [X57,X58] :
( in(X57,X58)
| empty(X58)
| ~ element(X57,X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ in(X1,relation_rng(esk18_0))
| element(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_31,plain,
( ~ in(X2,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| in(apply(X1,X2),relation_rng(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_32,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,negated_conjecture,
in(esk15_2(esk16_0,esk18_0),esk16_0),
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(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_24]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_34,plain,
( ~ function(X1)
| ~ relation(X1)
| apply(X1,X2) != apply(X1,X3)
| ~ in(X3,relation_dom(X1))
| ~ in(X2,relation_dom(X1))
| ~ one_to_one(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
relation_dom(esk17_0) = esk16_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
one_to_one(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_37,negated_conjecture,
relation(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,negated_conjecture,
function(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,plain,
( ~ in(X3,relation_dom(X1))
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,negated_conjecture,
relation_composition(esk18_0,esk17_0) = esk17_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( ~ in(X1,esk16_0)
| element(apply(esk18_0,X1),esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]),c_0_25]),c_0_24])]) ).
cnf(c_0_43,negated_conjecture,
~ empty(esk16_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(X1,esk16_0)
| ~ in(X2,esk16_0)
| apply(esk17_0,X1) != apply(esk17_0,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(X1,esk16_0)
| apply(esk17_0,apply(esk18_0,X1)) = apply(esk17_0,X1) ),
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(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37]),c_0_23]),c_0_38]),c_0_25]),c_0_24])]) ).
cnf(c_0_46,negated_conjecture,
( ~ in(X1,esk16_0)
| in(apply(esk18_0,X1),esk16_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
( ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != X2
| apply(X1,esk15_2(X2,X1)) != esk15_2(X2,X1)
| X1 = identity_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( ~ in(X1,esk16_0)
| ~ in(X2,esk16_0)
| apply(esk17_0,X1) != apply(esk17_0,X2)
| apply(esk18_0,X1) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_49,plain,
( ~ function(X1)
| ~ relation(X1)
| apply(X1,esk15_2(relation_dom(X1),X1)) != esk15_2(relation_dom(X1),X1)
| identity_relation(relation_dom(X1)) = X1 ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ in(X1,esk16_0)
| apply(esk18_0,X1) = X1 ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
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(spm,[status(thm)],[c_0_49,c_0_50]),c_0_24]),c_0_23]),c_0_25]),c_0_24]),c_0_33])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU017+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n009.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 05:47:13 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.54 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
% 46.26/6.50 % Version: 3.5.1
% 46.26/6.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 46.26/6.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.26/6.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 46.26/6.50 % Starting new_bool_3 with 300s (1) cores
% 46.26/6.50 % Starting new_bool_1 with 300s (1) cores
% 46.26/6.50 % Starting sh5l with 300s (1) cores
% 46.26/6.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 977257 completed with status 0
% 46.26/6.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 46.26/6.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 46.26/6.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.26/6.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 46.26/6.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 46.26/6.50 % No SInE strategy applied
% 46.26/6.50 % Search class: FGHSM-FFMM31-SFFFFFNN
% 46.26/6.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 46.26/6.50 % Starting SubtermCWHack with 136s (1) cores
% 46.26/6.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 46.26/6.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 46.26/6.50 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 46.26/6.50 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 46.26/6.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 977262 completed with status 0
% 46.26/6.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 46.26/6.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 46.26/6.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.26/6.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 46.26/6.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 46.26/6.50 % No SInE strategy applied
% 46.26/6.50 % Search class: FGHSM-FFMM31-SFFFFFNN
% 46.26/6.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 46.26/6.50 % Starting SubtermCWHack with 136s (1) cores
% 46.26/6.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 46.26/6.50 % Preprocessing time : 0.002 s
% 46.26/6.50 % Presaturation interreduction done
% 46.26/6.50
% 46.26/6.50 % Proof found!
% 46.26/6.50 % SZS status Theorem
% 46.26/6.50 % SZS output start CNFRefutation
% See solution above
% 46.26/6.50 % Parsed axioms : 40
% 46.26/6.50 % Removed by relevancy pruning/SinE : 0
% 46.26/6.50 % Initial clauses : 77
% 46.26/6.50 % Removed in clause preprocessing : 0
% 46.26/6.50 % Initial clauses in saturation : 77
% 46.26/6.50 % Processed clauses : 17475
% 46.26/6.50 % ...of these trivial : 10
% 46.26/6.50 % ...subsumed : 15554
% 46.26/6.50 % ...remaining for further processing : 1911
% 46.26/6.50 % Other redundant clauses eliminated : 86
% 46.26/6.50 % Clauses deleted for lack of memory : 0
% 46.26/6.50 % Backward-subsumed : 224
% 46.26/6.50 % Backward-rewritten : 23
% 46.26/6.50 % Generated clauses : 227328
% 46.26/6.50 % ...of the previous two non-redundant : 193365
% 46.26/6.50 % ...aggressively subsumed : 0
% 46.26/6.50 % Contextual simplify-reflections : 106
% 46.26/6.50 % Paramodulations : 227233
% 46.26/6.50 % Factorizations : 0
% 46.26/6.50 % NegExts : 0
% 46.26/6.50 % Equation resolutions : 94
% 46.26/6.50 % Disequality decompositions : 0
% 46.26/6.50 % Total rewrite steps : 177843
% 46.26/6.50 % ...of those cached : 177587
% 46.26/6.50 % Propositional unsat checks : 0
% 46.26/6.50 % Propositional check models : 0
% 46.26/6.50 % Propositional check unsatisfiable : 0
% 46.26/6.50 % Propositional clauses : 0
% 46.26/6.50 % Propositional clauses after purity: 0
% 46.26/6.50 % Propositional unsat core size : 0
% 46.26/6.50 % Propositional preprocessing time : 0.000
% 46.26/6.50 % Propositional encoding time : 0.000
% 46.26/6.50 % Propositional solver time : 0.000
% 46.26/6.50 % Success case prop preproc time : 0.000
% 46.26/6.50 % Success case prop encoding time : 0.000
% 46.26/6.50 % Success case prop solver time : 0.000
% 46.26/6.50 % Current number of processed clauses : 1583
% 46.26/6.50 % Positive orientable unit clauses : 42
% 46.26/6.50 % Positive unorientable unit clauses: 0
% 46.26/6.50 % Negative unit clauses : 28
% 46.26/6.50 % Non-unit-clauses : 1513
% 46.26/6.50 % Current number of unprocessed clauses: 173442
% 46.26/6.50 % ...number of literals in the above : 783981
% 46.26/6.50 % Current number of archived formulas : 0
% 46.26/6.50 % Current number of archived clauses : 321
% 46.26/6.50 % Clause-clause subsumption calls (NU) : 2617850
% 46.26/6.50 % Rec. Clause-clause subsumption calls : 1985547
% 46.26/6.50 % Non-unit clause-clause subsumptions : 10835
% 46.26/6.50 % Unit Clause-clause subsumption calls : 8986
% 46.26/6.50 % Rewrite failures with RHS unbound : 0
% 46.26/6.50 % BW rewrite match attempts : 20
% 46.26/6.50 % BW rewrite match successes : 14
% 46.26/6.50 % Condensation attempts : 0
% 46.26/6.50 % Condensation successes : 0
% 46.26/6.50 % Termbank termtop insertions : 3222123
% 46.26/6.50 % Search garbage collected termcells : 948
% 46.26/6.50
% 46.26/6.50 % -------------------------------------------------
% 46.26/6.50 % User time : 5.483 s
% 46.26/6.50 % System time : 0.219 s
% 46.26/6.50 % Total time : 5.702 s
% 46.26/6.50 % Maximum resident set size: 3668 pages
% 46.26/6.50
% 46.26/6.50 % -------------------------------------------------
% 46.26/6.50 % User time : 27.168 s
% 46.26/6.50 % System time : 1.165 s
% 46.26/6.50 % Total time : 28.333 s
% 46.26/6.50 % Maximum resident set size: 4864 pages
% 46.26/6.50 % E exiting
%------------------------------------------------------------------------------