%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET018+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 : n013.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:06 PM UTC 2026
% Result : Theorem 0.99s 0.82s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 71 ( 26 unt; 0 def)
% Number of atoms : 162 ( 102 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 121 ( 30 ~; 72 |; 14 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 7 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ordered_pair_determines_components2,conjecture,
! [X7,X1,X2,X5] :
( ( member(X1,universal_class)
& ordered_pair(X7,X1) = ordered_pair(X2,X5) )
=> X1 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_determines_components2) ).
fof(ordered_pair_defn,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
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(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(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
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(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(c_0_7,negated_conjecture,
~ ! [X7,X1,X2,X5] :
( ( member(X1,universal_class)
& ordered_pair(X7,X1) = ordered_pair(X2,X5) )
=> X1 = X5 ),
inference(assume_negation,[status(cth)],[ordered_pair_determines_components2]) ).
fof(c_0_8,plain,
! [X25,X26] : ordered_pair(X25,X26) = unordered_pair(singleton(X25),unordered_pair(X25,singleton(X26))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
fof(c_0_9,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_10,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])])])]) ).
fof(c_0_11,negated_conjecture,
( esk9_0 != esk11_0
& member(esk9_0,universal_class)
& ordered_pair(esk8_0,esk9_0) = ordered_pair(esk10_0,esk11_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
ordered_pair(esk8_0,esk9_0) = ordered_pair(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
fof(c_0_17,plain,
! [X22,X23] : member(unordered_pair(X22,X23),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
cnf(c_0_18,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))) = unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_20,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
member(unordered_pair(esk8_0,esk8_0),unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0)
| unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk8_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk8_0,esk8_0))
| unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20])]) ).
fof(c_0_27,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_28,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
fof(c_0_29,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_27])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,unordered_pair(esk10_0,esk10_0))
| X1 = esk8_0
| unordered_pair(esk11_0,esk11_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_31,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk10_0,esk10_0) = null_class
| esk6_1(unordered_pair(esk10_0,esk10_0)) = esk8_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_20])]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))))
| X1 = unordered_pair(esk8_0,esk8_0)
| X1 = unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( member(esk8_0,unordered_pair(esk10_0,esk10_0))
| unordered_pair(esk10_0,esk10_0) = null_class
| unordered_pair(esk11_0,esk11_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_18]),c_0_20])]) ).
cnf(c_0_38,negated_conjecture,
( esk8_0 = esk10_0
| unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk10_0,esk10_0) = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_36]),c_0_20])]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(X1,unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))
| X1 = esk8_0
| X1 = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( ~ member(esk8_0,universal_class)
| member(esk8_0,unordered_pair(esk10_0,esk10_0))
| unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( member(esk8_0,universal_class)
| esk8_0 = esk10_0
| unordered_pair(esk10_0,esk10_0) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( unordered_pair(esk9_0,esk9_0) = esk10_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk8_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_20])]) ).
cnf(c_0_45,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_20])]) ).
cnf(c_0_46,negated_conjecture,
( member(esk8_0,unordered_pair(esk10_0,esk10_0))
| esk8_0 = esk10_0
| unordered_pair(esk10_0,esk10_0) = null_class
| unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( member(unordered_pair(esk9_0,esk9_0),unordered_pair(esk10_0,esk10_0))
| unordered_pair(esk9_0,esk9_0) = esk10_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_20])]) ).
cnf(c_0_48,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk10_0,esk10_0)
| unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk8_0,esk8_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( esk8_0 = esk10_0
| unordered_pair(esk10_0,esk10_0) = null_class
| unordered_pair(esk8_0,esk8_0) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
fof(c_0_50,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
cnf(c_0_51,negated_conjecture,
( unordered_pair(esk9_0,esk9_0) = esk10_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0)
| unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_48]),c_0_28]) ).
cnf(c_0_53,negated_conjecture,
( member(esk8_0,unordered_pair(esk10_0,esk10_0))
| esk8_0 = esk10_0
| unordered_pair(esk10_0,esk10_0) = null_class ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_49]),c_0_42]) ).
fof(c_0_54,plain,
! [X46] : ~ member(X46,null_class),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_50])]) ).
cnf(c_0_55,negated_conjecture,
( ~ member(X1,unordered_pair(esk9_0,esk9_0))
| X1 = esk11_0
| unordered_pair(esk9_0,esk9_0) = esk10_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
member(esk9_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_57,negated_conjecture,
esk9_0 != esk11_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_58,negated_conjecture,
( member(unordered_pair(esk11_0,esk11_0),unordered_pair(esk10_0,esk10_0))
| unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_52]),c_0_20])]) ).
cnf(c_0_59,negated_conjecture,
( esk8_0 = esk10_0
| unordered_pair(esk10_0,esk10_0) = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_53]) ).
cnf(c_0_60,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
unordered_pair(esk9_0,esk9_0) = esk10_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_24]),c_0_56])]),c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( unordered_pair(esk11_0,esk11_0) = esk8_0
| unordered_pair(esk11_0,esk11_0) = unordered_pair(esk9_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( ~ member(esk10_0,universal_class)
| esk8_0 = esk10_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_59]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
member(esk10_0,universal_class),
inference(spm,[status(thm)],[c_0_20,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( unordered_pair(esk9_0,esk9_0) != esk8_0
| unordered_pair(esk11_0,esk11_0) = esk8_0 ),
inference(ef,[status(thm)],[c_0_62]) ).
cnf(c_0_66,negated_conjecture,
esk8_0 = esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).
cnf(c_0_67,negated_conjecture,
unordered_pair(esk11_0,esk11_0) = esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_61]),c_0_66]),c_0_66])]) ).
cnf(c_0_68,negated_conjecture,
( ~ member(X1,esk10_0)
| X1 = esk11_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_67]) ).
cnf(c_0_69,negated_conjecture,
member(esk9_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_61]),c_0_56])]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET018+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.50 % Computer : n013.cluster.edu
% 0.20/0.50 % Model : x86_64 x86_64
% 0.20/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.50 % Memory : 8046.5625MB
% 0.20/0.50 % OS : Linux 6.8.0-71-generic
% 0.20/0.50 % CPULimit : 300
% 0.20/0.50 % WCLimit : 300
% 0.20/0.50 % DateTime : Mon Sep 21 04:42:21 UTC 2026
% 0.20/0.51 % CPUTime :
% 0.20/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.59 Running first-order theorem proving
% 0.24/0.59 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.99/0.82 % Version: 3.5.1
% 0.99/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.82 % Starting new_bool_3 with 300s (1) cores
% 0.99/0.82 % Starting new_bool_1 with 300s (1) cores
% 0.99/0.82 % Starting sh5l with 300s (1) cores
% 0.99/0.82 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4157145 completed with status 0
% 0.99/0.82 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.99/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.82 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.99/0.82 % No SInE strategy applied
% 0.99/0.82 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.99/0.82 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.99/0.82 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.99/0.82 % Starting SubtermCWHack with 136s (1) cores
% 0.99/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.99/0.82 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.99/0.82 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.99/0.82 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.99/0.82 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4157155 completed with status 0
% 0.99/0.82 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.99/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.82 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.99/0.82 % No SInE strategy applied
% 0.99/0.82 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.99/0.82 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.99/0.82 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.99/0.82 % Starting SubtermCWHack with 136s (1) cores
% 0.99/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.99/0.82 % Preprocessing time : 0.004 s
% 0.99/0.82 % Presaturation interreduction done
% 0.99/0.82
% 0.99/0.82 % Proof found!
% 0.99/0.82 % SZS status Theorem
% 0.99/0.82 % SZS output start CNFRefutation
% See solution above
% 1.21/0.82 % Parsed axioms : 44
% 1.21/0.82 % Removed by relevancy pruning/SinE : 0
% 1.21/0.82 % Initial clauses : 92
% 1.21/0.82 % Removed in clause preprocessing : 8
% 1.21/0.82 % Initial clauses in saturation : 84
% 1.21/0.82 % Processed clauses : 1087
% 1.21/0.82 % ...of these trivial : 21
% 1.21/0.82 % ...subsumed : 474
% 1.21/0.82 % ...remaining for further processing : 592
% 1.21/0.82 % Other redundant clauses eliminated : 14
% 1.21/0.82 % Clauses deleted for lack of memory : 0
% 1.21/0.82 % Backward-subsumed : 63
% 1.21/0.82 % Backward-rewritten : 160
% 1.21/0.82 % Generated clauses : 6151
% 1.21/0.82 % ...of the previous two non-redundant : 5860
% 1.21/0.82 % ...aggressively subsumed : 0
% 1.21/0.82 % Contextual simplify-reflections : 6
% 1.21/0.82 % Paramodulations : 6115
% 1.21/0.82 % Factorizations : 22
% 1.21/0.82 % NegExts : 0
% 1.21/0.82 % Equation resolutions : 14
% 1.21/0.82 % Disequality decompositions : 0
% 1.21/0.82 % Total rewrite steps : 1400
% 1.21/0.82 % ...of those cached : 1329
% 1.21/0.82 % Propositional unsat checks : 0
% 1.21/0.82 % Propositional check models : 0
% 1.21/0.82 % Propositional check unsatisfiable : 0
% 1.21/0.82 % Propositional clauses : 0
% 1.21/0.82 % Propositional clauses after purity: 0
% 1.21/0.82 % Propositional unsat core size : 0
% 1.21/0.82 % Propositional preprocessing time : 0.000
% 1.21/0.82 % Propositional encoding time : 0.000
% 1.21/0.82 % Propositional solver time : 0.000
% 1.21/0.82 % Success case prop preproc time : 0.000
% 1.21/0.82 % Success case prop encoding time : 0.000
% 1.21/0.82 % Success case prop solver time : 0.000
% 1.21/0.82 % Current number of processed clauses : 280
% 1.21/0.82 % Positive orientable unit clauses : 49
% 1.21/0.82 % Positive unorientable unit clauses: 0
% 1.21/0.82 % Negative unit clauses : 8
% 1.21/0.82 % Non-unit-clauses : 223
% 1.21/0.82 % Current number of unprocessed clauses: 4867
% 1.21/0.82 % ...number of literals in the above : 16295
% 1.21/0.82 % Current number of archived formulas : 0
% 1.21/0.82 % Current number of archived clauses : 314
% 1.21/0.82 % Clause-clause subsumption calls (NU) : 17791
% 1.21/0.82 % Rec. Clause-clause subsumption calls : 13792
% 1.21/0.82 % Non-unit clause-clause subsumptions : 385
% 1.21/0.82 % Unit Clause-clause subsumption calls : 1130
% 1.21/0.82 % Rewrite failures with RHS unbound : 0
% 1.21/0.82 % BW rewrite match attempts : 23
% 1.21/0.82 % BW rewrite match successes : 11
% 1.21/0.82 % Condensation attempts : 0
% 1.21/0.82 % Condensation successes : 0
% 1.21/0.82 % Termbank termtop insertions : 117783
% 1.21/0.82 % Search garbage collected termcells : 997
% 1.21/0.82
% 1.21/0.82 % -------------------------------------------------
% 1.21/0.82 % User time : 0.143 s
% 1.21/0.82 % System time : 0.015 s
% 1.21/0.82 % Total time : 0.158 s
% 1.21/0.82 % Maximum resident set size: 3692 pages
% 1.21/0.82
% 1.21/0.82 % -------------------------------------------------
% 1.21/0.82 % User time : 0.420 s
% 1.21/0.82 % System time : 0.054 s
% 1.21/0.82 % Total time : 0.475 s
% 1.21/0.82 % Maximum resident set size: 4608 pages
% 1.21/0.82 % E exiting
%------------------------------------------------------------------------------