TSTP Solution File: SWW102+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW102+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 06:41:39 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 113 ( 36 unt; 0 def)
% Number of atoms : 321 ( 142 equ)
% Maximal formula atoms : 75 ( 2 avg)
% Number of connectives : 342 ( 134 ~; 147 |; 49 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 4 sgn 40 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(not1_not2,conjecture,
! [X5] : not1(X5) = not2(X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_not2) ).
fof(not1_axiom1,axiom,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom1) ).
fof(def_false2,axiom,
? [X5] :
( false2 = phi(f7(X5))
& ~ ? [X10] : forallprefers(f7(X10),f7(X5)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false2) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_f7) ).
fof(def_phi,axiom,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_phi) ).
fof(def_not2,axiom,
! [X5] : not2(X5) = impl(X5,false2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_not2) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom3) ).
fof(impl_axiom1,axiom,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom1) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_true) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_false) ).
fof(def_forallprefers,axiom,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_forallprefers) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_bool) ).
fof(false_true_err_in_d,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
fof(not1_axiom2,axiom,
not1(false) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom2) ).
fof(impl_axiom3,axiom,
! [X4] :
( bool(X4)
=> impl(false,X4) = true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom3) ).
fof(not1_axiom3,axiom,
not1(true) = false,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom3) ).
fof(impl_axiom4,axiom,
! [X4] :
( bool(X4)
=> impl(true,X4) = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom4) ).
fof(distinct_false_true_err,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',distinct_false_true_err) ).
fof(c_0_19,negated_conjecture,
~ ! [X5] : not1(X5) = not2(X5),
inference(assume_negation,[status(cth)],[not1_not2]) ).
fof(c_0_20,plain,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
inference(fof_simplification,[status(thm)],[not1_axiom1]) ).
fof(c_0_21,plain,
! [X83] :
( false2 = phi(f7(esk7_0))
& ~ forallprefers(f7(X83),f7(esk7_0)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])])]) ).
fof(c_0_22,plain,
! [X81] : f7(X81) = lazy_impl(prop(X81),X81),
inference(variable_rename,[status(thm)],[def_f7]) ).
fof(c_0_23,plain,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
fof(c_0_24,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_25,plain,
! [X85] : not2(X85) = impl(X85,false2),
inference(variable_rename,[status(thm)],[def_not2]) ).
fof(c_0_26,plain,
! [X84] :
( bool(X84)
| not1(X84) = phi(X84) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
fof(c_0_27,plain,
! [X28] : lazy_impl(true,X28) = phi(X28),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
inference(fof_simplification,[status(thm)],[impl_axiom1]) ).
cnf(c_0_29,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_31,plain,
! [X17] :
( ( prop(X17) != true
| bool(X17) )
& ( ~ bool(X17)
| prop(X17) = true ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])])]) ).
fof(c_0_32,plain,
! [X16] :
( ( ~ d(X16)
| d(X16) )
& ( phi(X16) = err
| d(X16) )
& ( ~ d(X16)
| phi(X16) = X16 )
& ( phi(X16) = err
| phi(X16) = X16 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])])]) ).
cnf(c_0_33,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
not2(X1) = impl(X1,false2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( bool(X1)
| not1(X1) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_37,plain,
! [X19,X20] :
( bool(X19)
| impl(X19,X20) = phi(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_38,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_39,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_41,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
fof(c_0_42,plain,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
inference(fof_simplification,[status(thm)],[def_forallprefers]) ).
cnf(c_0_43,negated_conjecture,
impl(esk8_0,false2) != not1(esk8_0),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
( not1(X1) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
( bool(X1)
| impl(X1,X2) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_47,plain,
( phi(X1) = err
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_48,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(prop(esk7_0),esk7_0))
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_49,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
inference(rw,[status(thm)],[c_0_40,c_0_36]) ).
fof(c_0_50,plain,
! [X18] :
( ( prop(X18) != false
| ~ bool(X18) )
& ( bool(X18)
| prop(X18) = false ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])]) ).
fof(c_0_51,plain,
! [X27] : lazy_impl(false,X27) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
fof(c_0_52,plain,
! [X12,X13] :
( ( X12 = false
| d(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| ~ bool(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| ~ bool(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| bool(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| bool(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| ~ bool(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| ~ bool(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| bool(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| bool(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( d(X12)
| ~ d(X13)
| forallprefers(X12,X13) )
& ( ~ d(X12)
| ~ d(X13)
| bool(X12)
| ~ bool(X13)
| forallprefers(X12,X13) )
& ( X12 != false
| X13 != true
| forallprefers(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])])]) ).
fof(c_0_53,plain,
! [X11] :
( ( ~ bool(X11)
| X11 = false
| X11 = true )
& ( X11 != false
| bool(X11) )
& ( X11 != true
| bool(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])])]) ).
cnf(c_0_54,negated_conjecture,
( bool(esk8_0)
| impl(esk8_0,false2) != lazy_impl(true,esk8_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_55,plain,
( impl(X1,X2) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_56,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_36]),c_0_30]) ).
cnf(c_0_57,plain,
( lazy_impl(true,X1) = X1
| lazy_impl(true,X1) = err ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_36]),c_0_36]) ).
cnf(c_0_58,plain,
( ~ forallprefers(X1,lazy_impl(prop(esk7_0),esk7_0))
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,plain,
( bool(X1)
| prop(X1) = false ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( forallprefers(X1,X2)
| X1 != false
| X2 != true ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_64,negated_conjecture,
bool(esk8_0),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_65,plain,
( lazy_impl(prop(esk7_0),esk7_0) = false2
| false2 = err ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_56]) ).
cnf(c_0_66,plain,
( bool(esk7_0)
| ~ forallprefers(X1,true)
| ~ d(X1)
| ~ bool(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_67,plain,
forallprefers(false,true),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_61])]) ).
cnf(c_0_68,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_69,plain,
bool(false),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_70,negated_conjecture,
( esk8_0 = true
| esk8_0 = false ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,plain,
not1(false) = true,
inference(split_conjunct,[status(thm)],[not1_axiom2]) ).
fof(c_0_72,plain,
! [X23] :
( ~ bool(X23)
| impl(false,X23) = true ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom3])])]) ).
cnf(c_0_73,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = err
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_39]) ).
cnf(c_0_74,plain,
bool(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69])]) ).
cnf(c_0_75,negated_conjecture,
( esk8_0 = true
| impl(false,false2) != true ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_70]),c_0_71]) ).
cnf(c_0_76,plain,
( impl(false,X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_77,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = err ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_78,negated_conjecture,
( esk8_0 = true
| ~ bool(false2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,plain,
( false2 = esk7_0
| false2 = err ),
inference(spm,[status(thm)],[c_0_57,c_0_77]) ).
cnf(c_0_80,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(true,esk7_0))
| ~ bool(esk7_0)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_81,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_39]) ).
cnf(c_0_82,negated_conjecture,
( false2 = err
| esk8_0 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_74])]) ).
cnf(c_0_83,plain,
not1(true) = false,
inference(split_conjunct,[status(thm)],[not1_axiom3]) ).
fof(c_0_84,plain,
! [X24] :
( ~ bool(X24)
| impl(true,X24) = X24 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])])]) ).
cnf(c_0_85,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(true,esk7_0))
| ~ bool(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_74])]) ).
cnf(c_0_86,plain,
lazy_impl(true,lazy_impl(true,esk7_0)) = false2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_74])]) ).
cnf(c_0_87,negated_conjecture,
( false2 = err
| impl(true,false2) != false ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_82]),c_0_83]) ).
cnf(c_0_88,plain,
( impl(true,X1) = X1
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_89,plain,
( ~ forallprefers(false2,lazy_impl(true,esk7_0))
| ~ bool(lazy_impl(true,esk7_0)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( false2 = err
| false2 != false
| ~ bool(false2) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_91,plain,
( false2 = err
| esk7_0 != err ),
inference(ef,[status(thm)],[c_0_79]) ).
cnf(c_0_92,plain,
( ~ forallprefers(false2,esk7_0)
| ~ d(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_49]),c_0_74])]) ).
cnf(c_0_93,plain,
( esk7_0 = true
| esk7_0 = false ),
inference(spm,[status(thm)],[c_0_63,c_0_74]) ).
cnf(c_0_94,negated_conjecture,
( false2 = err
| esk7_0 != false ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_79]),c_0_74])]),c_0_91]) ).
cnf(c_0_95,plain,
( esk7_0 = true
| ~ forallprefers(false2,false) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_68])]) ).
cnf(c_0_96,negated_conjecture,
( esk7_0 = true
| false2 = err ),
inference(spm,[status(thm)],[c_0_94,c_0_93]) ).
cnf(c_0_97,plain,
( bool(X1)
| forallprefers(X1,X2)
| ~ d(X1)
| ~ d(X2)
| ~ bool(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_98,plain,
( d(X1)
| forallprefers(X1,X2)
| ~ d(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
fof(c_0_99,plain,
( true != false
& true != err
& false != err ),
inference(fof_simplification,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_100,plain,
( ~ forallprefers(X1,lazy_impl(true,esk7_0))
| ~ d(X1)
| ~ bool(esk7_0)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_39]) ).
cnf(c_0_101,negated_conjecture,
( esk7_0 = true
| ~ forallprefers(err,false) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_102,plain,
( forallprefers(X1,X2)
| bool(X1)
| ~ d(X2)
| ~ bool(X2) ),
inference(csr,[status(thm)],[c_0_97,c_0_98]) ).
fof(c_0_103,plain,
( true != false
& true != err
& false != err ),
inference(fof_nnf,[status(thm)],[c_0_99]) ).
cnf(c_0_104,plain,
( ~ forallprefers(X1,lazy_impl(true,esk7_0))
| ~ d(X1)
| ~ bool(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_74])]) ).
cnf(c_0_105,negated_conjecture,
( esk7_0 = true
| bool(err) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_68]),c_0_69])]) ).
cnf(c_0_106,plain,
false != err,
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_107,plain,
true != err,
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_108,plain,
( ~ forallprefers(X1,esk7_0)
| ~ d(esk7_0)
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_49]) ).
cnf(c_0_109,negated_conjecture,
esk7_0 = true,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_105]),c_0_106]),c_0_107]) ).
cnf(c_0_110,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_111,plain,
( ~ forallprefers(X1,true)
| ~ d(X1)
| ~ bool(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_109]),c_0_109]),c_0_110])]) ).
cnf(c_0_112,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_67]),c_0_68]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW102+1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 20:02:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19860 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSS-FFMM21-DFFFFFNN
% 0.21/0.52 # partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.52 # Starting sh5l with 136s (1) cores
% 0.21/0.52 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 19867 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSS-FFMM21-DFFFFFNN
% 0.21/0.52 # partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 45
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 99
% 0.21/0.52 # Removed in clause preprocessing : 19
% 0.21/0.52 # Initial clauses in saturation : 80
% 0.21/0.52 # Processed clauses : 303
% 0.21/0.52 # ...of these trivial : 4
% 0.21/0.52 # ...subsumed : 66
% 0.21/0.52 # ...remaining for further processing : 233
% 0.21/0.52 # Other redundant clauses eliminated : 8
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 18
% 0.21/0.52 # Backward-rewritten : 63
% 0.21/0.52 # Generated clauses : 596
% 0.21/0.52 # ...of the previous two non-redundant : 496
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 4
% 0.21/0.52 # Paramodulations : 582
% 0.21/0.52 # Factorizations : 8
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 8
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 319
% 0.21/0.52 # ...of those cached : 287
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 84
% 0.21/0.52 # Positive orientable unit clauses : 19
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 14
% 0.21/0.52 # Non-unit-clauses : 51
% 0.21/0.52 # Current number of unprocessed clauses: 284
% 0.21/0.52 # ...number of literals in the above : 741
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 159
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 1693
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 1324
% 0.21/0.52 # Non-unit clause-clause subsumptions : 53
% 0.21/0.52 # Unit Clause-clause subsumption calls : 216
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 8
% 0.21/0.52 # BW rewrite match successes : 8
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 11290
% 0.21/0.52 # Search garbage collected termcells : 703
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.024 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.028 s
% 0.21/0.52 # Maximum resident set size: 1956 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.104 s
% 0.21/0.52 # System time : 0.009 s
% 0.21/0.52 # Total time : 0.113 s
% 0.21/0.52 # Maximum resident set size: 1744 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------