%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET098+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:13:34 PM UTC 2026
% Result : Theorem 49.33s 7.55s
% Output : CNFRefutation 49.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 22 unt; 0 def)
% Number of atoms : 198 ( 42 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 204 ( 80 ~; 83 |; 31 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 137 ( 18 sgn 56 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(corollary_1_to_number_of_elements_in_class,conjecture,
! [X1] :
( ? [X4] :
( ? [X7] :
( member(X7,X1)
& member(X7,intersection(complement(singleton(X4)),X1)) )
& member(X4,X1) )
| ? [X2] : singleton(X2) = X1
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_1_to_number_of_elements_in_class) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X2)
& member(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( ~ member(X5,X1)
& member(X5,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',complement) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( disjoint(X3,X1)
& member(X3,X1)
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( ( X3 = X2
| X3 = X1 )
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(sum_class_defn,axiom,
! [X3,X1] :
( member(X3,sum_class(X1))
<=> ? [X2] :
( member(X2,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',sum_class_defn) ).
fof(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X2,X1)
& subclass(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ? [X4] :
( ? [X7] :
( member(X7,X1)
& member(X7,intersection(complement(singleton(X4)),X1)) )
& member(X4,X1) )
| ? [X2] : singleton(X2) = X1
| X1 = null_class ),
inference(assume_negation,[status(cth)],[corollary_1_to_number_of_elements_in_class]) ).
fof(c_0_13,negated_conjecture,
! [X108,X109,X110] :
( ( ~ member(X110,esk8_0)
| ~ member(X110,intersection(complement(singleton(X109)),esk8_0))
| ~ member(X109,esk8_0) )
& singleton(X108) != esk8_0
& esk8_0 != null_class ),
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_12])])])])]) ).
fof(c_0_14,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(X2,esk8_0)
| ~ member(X2,intersection(complement(singleton(X1)),esk8_0))
| ~ member(X1,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X38,X39,X40] :
( ( member(X40,intersection(X38,X39))
| ~ member(X40,X39)
| ~ member(X40,X38) )
& ( ~ member(X40,intersection(X38,X39))
| member(X40,X39) )
& ( ~ member(X40,intersection(X38,X39))
| member(X40,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
fof(c_0_18,plain,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( ~ member(X5,X1)
& member(X5,universal_class) ) ),
inference(fof_simplification,[status(thm)],[complement]) ).
fof(c_0_19,plain,
! [X10,X11,X12,X13,X14] :
( ( subclass(X13,X14)
| ~ member(esk1_2(X13,X14),X14) )
& ( subclass(X13,X14)
| member(esk1_2(X13,X14),X13) )
& ( member(X12,X11)
| ~ member(X12,X10)
| ~ subclass(X10,X11) ) ),
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)],[subclass_defn])])])])])])]) ).
fof(c_0_20,plain,
! [X16] : subclass(X16,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk8_0))
| ~ member(X1,esk8_0)
| ~ member(X2,esk8_0) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X41,X42] :
( ( member(X42,complement(X41))
| member(X42,X41)
| ~ member(X42,universal_class) )
& ( ~ member(X42,complement(X41))
| ~ member(X42,X41) )
& ( ~ member(X42,complement(X41))
| member(X42,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_24,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X1] :
( X1 != null_class
=> ? [X3] :
( disjoint(X3,X1)
& member(X3,X1)
& member(X3,universal_class) ) ),
inference(fof_simplification,[status(thm)],[regularity]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(X2,esk8_0)
| ~ member(X1,esk8_0)
| ~ member(X1,complement(unordered_pair(X2,X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ member(X1,universal_class)
| member(X1,complement(X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X101] :
( ( X101 = null_class
| disjoint(esk6_1(X101),X101) )
& ( X101 = null_class
| member(esk6_1(X101),X101) )
& ( X101 = null_class
| member(esk6_1(X101),universal_class) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
fof(c_0_31,plain,
! [X19,X20,X21] :
( ( member(X19,unordered_pair(X20,X21))
| ~ member(X19,universal_class)
| X19 != X21 )
& ( member(X19,unordered_pair(X20,X21))
| ~ member(X19,universal_class)
| X19 != X20 )
& ( ~ member(X19,unordered_pair(X20,X21))
| X19 = X21
| X19 = X20 )
& ( ~ member(X19,unordered_pair(X20,X21))
| member(X19,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(X2,esk8_0)
| ~ member(X1,esk8_0)
| member(X1,unordered_pair(X2,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(X1,esk8_0)
| member(esk6_1(esk8_0),unordered_pair(X1,X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(X1,esk8_0)
| esk6_1(esk8_0) = X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( member(esk6_1(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
fof(c_0_40,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
fof(c_0_41,plain,
! [X72,X73,X75,X76,X77] :
( ( member(X75,sum_class(X76))
| ~ member(X77,X76)
| ~ member(X75,X77) )
& ( ~ member(X72,sum_class(X73))
| member(esk3_2(X72,X73),X73) )
& ( ~ member(X72,sum_class(X73))
| member(X72,esk3_2(X72,X73)) ) ),
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)],[sum_class_defn])])])])])])]) ).
fof(c_0_42,plain,
! [X22,X23] : member(unordered_pair(X22,X23),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
cnf(c_0_43,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_44,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(X1,esk8_0)
| member(esk6_1(esk8_0),universal_class) ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| esk6_1(intersection(X1,esk8_0)) = esk6_1(esk8_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_47,plain,
! [X46] : ~ member(X46,null_class),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_40])]) ).
cnf(c_0_48,plain,
( ~ member(X2,X3)
| ~ member(X1,X2)
| member(X1,sum_class(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( ~ member(esk1_2(X1,X2),X2)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_51,negated_conjecture,
( subclass(esk8_0,X1)
| esk1_2(esk8_0,X1) = esk6_1(esk8_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_52,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_53,negated_conjecture,
member(esk6_1(esk8_0),universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_33]),c_0_34]) ).
cnf(c_0_54,negated_conjecture,
( member(esk6_1(esk8_0),esk8_0)
| intersection(X1,esk8_0) = null_class ),
inference(spm,[status(thm)],[c_0_39,c_0_46]) ).
cnf(c_0_55,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,plain,
( ~ member(X1,unordered_pair(X2,X3))
| member(X1,sum_class(universal_class)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
fof(c_0_57,plain,
! [X17,X18] :
( ( X17 = X18
| ~ subclass(X18,X17)
| ~ subclass(X17,X18) )
& ( X17 != X18
| subclass(X18,X17) )
& ( X17 != X18
| subclass(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])]) ).
cnf(c_0_58,negated_conjecture,
( ~ member(esk6_1(esk8_0),X1)
| subclass(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
member(esk6_1(esk8_0),unordered_pair(esk6_1(esk8_0),X1)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( subclass(unordered_pair(X1,X2),X3)
| esk1_2(unordered_pair(X1,X2),X3) = X2
| esk1_2(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_43]) ).
cnf(c_0_61,negated_conjecture,
( ~ member(X1,X2)
| ~ member(X1,esk8_0)
| member(esk6_1(esk8_0),esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_54]),c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( ~ member(X1,esk8_0)
| member(esk6_1(esk8_0),sum_class(universal_class)) ),
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_63,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_64,negated_conjecture,
subclass(esk8_0,unordered_pair(esk6_1(esk8_0),X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,plain,
( subclass(unordered_pair(X1,X1),X2)
| esk1_2(unordered_pair(X1,X1),X2) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_60])]) ).
cnf(c_0_66,negated_conjecture,
( ~ member(esk6_1(esk8_0),X1)
| member(esk6_1(esk8_0),esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_33]),c_0_34]) ).
cnf(c_0_67,negated_conjecture,
member(esk6_1(esk8_0),sum_class(universal_class)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_33]),c_0_34]) ).
cnf(c_0_68,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_69,negated_conjecture,
( ~ subclass(unordered_pair(esk6_1(esk8_0),X1),esk8_0)
| unordered_pair(esk6_1(esk8_0),X1) = esk8_0 ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
member(esk6_1(esk8_0),esk8_0),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_68,c_0_16]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET098+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % 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 04:54:15 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 49.33/7.55 % Version: 3.5.1
% 49.33/7.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 49.33/7.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.33/7.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 49.33/7.55 % Starting new_bool_3 with 300s (1) cores
% 49.33/7.55 % Starting new_bool_1 with 300s (1) cores
% 49.33/7.55 % Starting sh5l with 300s (1) cores
% 49.33/7.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3451300 completed with status 0
% 49.33/7.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 49.33/7.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 49.33/7.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.33/7.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 49.33/7.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 49.33/7.55 % No SInE strategy applied
% 49.33/7.55 % Search class: FGHSM-FFMS21-DFFFFFNN
% 49.33/7.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 49.33/7.55 % Starting SubtermCWHack with 136s (1) cores
% 49.33/7.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 49.33/7.55 % Starting sh3 with 271s (1) cores
% 49.33/7.55 % Starting ho_unfolding_3 with 271s (1) cores
% 49.33/7.55 % Starting new_ho_10_cnf2 with 271s (1) cores
% 49.33/7.55 % sh3 with pid 3451309 completed with status 0
% 49.33/7.55 % Result found by sh3
% 49.33/7.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 49.33/7.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.33/7.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 49.33/7.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 49.33/7.55 % No SInE strategy applied
% 49.33/7.55 % Search class: FGHSM-FFMS21-DFFFFFNN
% 49.33/7.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 49.33/7.55 % Starting SubtermCWHack with 136s (1) cores
% 49.33/7.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 49.33/7.55 % Starting sh3 with 271s (1) cores
% 49.33/7.55 % Preprocessing time : 0.004 s
% 49.33/7.55 % Presaturation interreduction done
% 49.33/7.55
% 49.33/7.55 % Proof found!
% 49.33/7.55 % SZS status Theorem
% 49.33/7.55 % SZS output start CNFRefutation
% See solution above
% 49.33/7.55 % Parsed axioms : 44
% 49.33/7.55 % Removed by relevancy pruning/SinE : 0
% 49.33/7.55 % Initial clauses : 92
% 49.33/7.55 % Removed in clause preprocessing : 8
% 49.33/7.55 % Initial clauses in saturation : 84
% 49.33/7.55 % Processed clauses : 19170
% 49.33/7.55 % ...of these trivial : 109
% 49.33/7.55 % ...subsumed : 15948
% 49.33/7.55 % ...remaining for further processing : 3113
% 49.33/7.55 % Other redundant clauses eliminated : 64
% 49.33/7.55 % Clauses deleted for lack of memory : 0
% 49.33/7.55 % Backward-subsumed : 398
% 49.33/7.55 % Backward-rewritten : 203
% 49.33/7.55 % Generated clauses : 197745
% 49.33/7.55 % ...of the previous two non-redundant : 171202
% 49.33/7.55 % ...aggressively subsumed : 0
% 49.33/7.55 % Contextual simplify-reflections : 55
% 49.33/7.55 % Paramodulations : 197436
% 49.33/7.55 % Factorizations : 245
% 49.33/7.55 % NegExts : 0
% 49.33/7.55 % Equation resolutions : 64
% 49.33/7.55 % Disequality decompositions : 0
% 49.33/7.55 % Total rewrite steps : 103132
% 49.33/7.55 % ...of those cached : 101546
% 49.33/7.55 % Propositional unsat checks : 0
% 49.33/7.55 % Propositional check models : 0
% 49.33/7.55 % Propositional check unsatisfiable : 0
% 49.33/7.55 % Propositional clauses : 0
% 49.33/7.55 % Propositional clauses after purity: 0
% 49.33/7.55 % Propositional unsat core size : 0
% 49.33/7.55 % Propositional preprocessing time : 0.000
% 49.33/7.55 % Propositional encoding time : 0.000
% 49.33/7.55 % Propositional solver time : 0.000
% 49.33/7.55 % Success case prop preproc time : 0.000
% 49.33/7.55 % Success case prop encoding time : 0.000
% 49.33/7.55 % Success case prop solver time : 0.000
% 49.33/7.55 % Current number of processed clauses : 2423
% 49.33/7.55 % Positive orientable unit clauses : 158
% 49.33/7.55 % Positive unorientable unit clauses: 0
% 49.33/7.55 % Negative unit clauses : 32
% 49.33/7.55 % Non-unit-clauses : 2233
% 49.33/7.55 % Current number of unprocessed clauses: 150425
% 49.33/7.55 % ...number of literals in the above : 537888
% 49.33/7.55 % Current number of archived formulas : 0
% 49.33/7.55 % Current number of archived clauses : 692
% 49.33/7.55 % Clause-clause subsumption calls (NU) : 867126
% 49.33/7.55 % Rec. Clause-clause subsumption calls : 536991
% 49.33/7.55 % Non-unit clause-clause subsumptions : 5184
% 49.33/7.55 % Unit Clause-clause subsumption calls : 50331
% 49.33/7.55 % Rewrite failures with RHS unbound : 0
% 49.33/7.55 % BW rewrite match attempts : 248
% 49.33/7.55 % BW rewrite match successes : 50
% 49.33/7.55 % Condensation attempts : 0
% 49.33/7.55 % Condensation successes : 0
% 49.33/7.55 % Termbank termtop insertions : 3700883
% 49.33/7.55 % Search garbage collected termcells : 1022
% 49.33/7.55
% 49.33/7.55 % -------------------------------------------------
% 49.33/7.55 % User time : 6.787 s
% 49.33/7.55 % System time : 0.203 s
% 49.33/7.55 % Total time : 6.990 s
% 49.33/7.55 % Maximum resident set size: 3948 pages
% 49.33/7.55
% 49.33/7.55 % -------------------------------------------------
% 49.33/7.55 % User time : 33.495 s
% 49.33/7.55 % System time : 1.042 s
% 49.33/7.55 % Total time : 34.537 s
% 49.33/7.55 % Maximum resident set size: 4864 pages
% 49.33/7.55 % E exiting
%------------------------------------------------------------------------------