TSTP Solution File: SWW102+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW102+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:08:42 EDT 2023
% Result : Theorem 0.38s 0.53s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 19
% Syntax : Number of formulae : 105 ( 36 unt; 0 def)
% Number of atoms : 299 ( 137 equ)
% Maximal formula atoms : 75 ( 2 avg)
% Number of connectives : 307 ( 113 ~; 137 |; 45 &)
% ( 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 : 75 ( 4 sgn; 40 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(not1_not2,conjecture,
! [X5] : not1(X5) = not2(X5),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',not1_not2) ).
fof(not1_axiom1,axiom,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',not1_axiom1) ).
fof(def_not2,axiom,
! [X5] : not2(X5) = impl(X5,false2),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',def_not2) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',lazy_impl_axiom3) ).
fof(impl_axiom1,axiom,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',impl_axiom1) ).
fof(def_phi,axiom,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',def_phi) ).
fof(def_false2,axiom,
? [X5] :
( false2 = phi(f7(X5))
& ~ ? [X10] : forallprefers(f7(X10),f7(X5)) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',def_false2) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',def_f7) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',prop_false) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',prop_true) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',lazy_impl_axiom2) ).
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/tmp/tmp.LAypBq07d5/E---3.1_7406.p',def_forallprefers) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',def_bool) ).
fof(false_true_err_in_d,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',false_true_err_in_d) ).
fof(not1_axiom2,axiom,
not1(false) = true,
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',not1_axiom2) ).
fof(impl_axiom3,axiom,
! [X4] :
( bool(X4)
=> impl(false,X4) = true ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',impl_axiom3) ).
fof(not1_axiom3,axiom,
not1(true) = false,
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',not1_axiom3) ).
fof(impl_axiom4,axiom,
! [X4] :
( bool(X4)
=> impl(true,X4) = X4 ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',impl_axiom4) ).
fof(distinct_false_true_err,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox/tmp/tmp.LAypBq07d5/E---3.1_7406.p',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,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_22,plain,
! [X85] : not2(X85) = impl(X85,false2),
inference(variable_rename,[status(thm)],[def_not2]) ).
fof(c_0_23,plain,
! [X84] :
( bool(X84)
| not1(X84) = phi(X84) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
fof(c_0_24,plain,
! [X28] : lazy_impl(true,X28) = phi(X28),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
inference(fof_simplification,[status(thm)],[impl_axiom1]) ).
fof(c_0_26,plain,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
fof(c_0_27,plain,
! [X83] :
( false2 = phi(f7(esk7_0))
& ~ forallprefers(f7(X83),f7(esk7_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])]) ).
fof(c_0_28,plain,
! [X81] : f7(X81) = lazy_impl(prop(X81),X81),
inference(variable_rename,[status(thm)],[def_f7]) ).
cnf(c_0_29,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
not2(X1) = impl(X1,false2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( bool(X1)
| not1(X1) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X19,X20] :
( bool(X19)
| impl(X19,X20) = phi(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])]) ).
fof(c_0_34,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(variable_rename,[status(thm)],[c_0_26])]) ).
fof(c_0_35,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
cnf(c_0_36,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_38,plain,
! [X17] :
( ( prop(X17) != true
| bool(X17) )
& ( ~ bool(X17)
| prop(X17) = true ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])]) ).
cnf(c_0_39,negated_conjecture,
impl(esk8_0,false2) != not1(esk8_0),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( not1(X1) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( bool(X1)
| impl(X1,X2) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_43,plain,
( phi(X1) = err
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_44,plain,
! [X18] :
( ( prop(X18) != false
| ~ bool(X18) )
& ( bool(X18)
| prop(X18) = false ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])]) ).
fof(c_0_45,plain,
! [X27] : lazy_impl(false,X27) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
cnf(c_0_46,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_47,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_49,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]) ).
fof(c_0_50,plain,
! [X11] :
( ( ~ bool(X11)
| X11 = false
| X11 = true )
& ( X11 != false
| bool(X11) )
& ( X11 != true
| bool(X11) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])]) ).
cnf(c_0_51,negated_conjecture,
( bool(esk8_0)
| impl(esk8_0,false2) != lazy_impl(true,esk8_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,plain,
( impl(X1,X2) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_53,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_32]),c_0_37]) ).
cnf(c_0_54,plain,
( lazy_impl(true,X1) = X1
| lazy_impl(true,X1) = err ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_32]),c_0_32]) ).
cnf(c_0_55,plain,
( bool(X1)
| prop(X1) = false ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_56,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_57,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(prop(esk7_0),esk7_0))
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_58,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
inference(rw,[status(thm)],[c_0_48,c_0_32]) ).
fof(c_0_59,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])]) ).
cnf(c_0_60,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_61,negated_conjecture,
bool(esk8_0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_62,plain,
( lazy_impl(prop(esk7_0),esk7_0) = false2
| false2 = err ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_53]) ).
cnf(c_0_63,plain,
( lazy_impl(true,true) = false2
| bool(esk7_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_55]),c_0_56]) ).
cnf(c_0_64,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_65,plain,
( ~ forallprefers(X1,lazy_impl(prop(esk7_0),esk7_0))
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,plain,
( forallprefers(X1,X2)
| X1 != false
| X2 != true ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_67,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_68,negated_conjecture,
( esk8_0 = true
| esk8_0 = false ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,plain,
not1(false) = true,
inference(split_conjunct,[status(thm)],[not1_axiom2]) ).
fof(c_0_70,plain,
! [X23] :
( ~ bool(X23)
| impl(false,X23) = true ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom3])]) ).
cnf(c_0_71,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = err
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_47]) ).
cnf(c_0_72,plain,
( false2 = true
| bool(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_58]),c_0_64])]) ).
cnf(c_0_73,plain,
( bool(esk7_0)
| ~ forallprefers(X1,true)
| ~ d(X1)
| ~ bool(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_55]),c_0_56]) ).
cnf(c_0_74,plain,
forallprefers(false,true),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_66])]) ).
cnf(c_0_75,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_76,plain,
bool(false),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_77,negated_conjecture,
( esk8_0 = true
| impl(false,false2) != true ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_68]),c_0_69]) ).
cnf(c_0_78,plain,
( impl(false,X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_79,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = true
| false2 = err ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_47]) ).
cnf(c_0_81,plain,
bool(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_82,plain,
( ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(true,esk7_0))
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_83,negated_conjecture,
( esk8_0 = true
| ~ bool(false2) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_84,plain,
( false2 = true
| false2 = esk7_0
| false2 = err ),
inference(spm,[status(thm)],[c_0_54,c_0_79]) ).
cnf(c_0_85,plain,
lazy_impl(true,lazy_impl(true,esk7_0)) = false2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]) ).
cnf(c_0_86,plain,
( ~ forallprefers(lazy_impl(prop(X1),X1),esk7_0)
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_58]) ).
cnf(c_0_87,negated_conjecture,
( false2 = err
| false2 = true
| esk8_0 = true ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_72]) ).
cnf(c_0_88,plain,
not1(true) = false,
inference(split_conjunct,[status(thm)],[not1_axiom3]) ).
fof(c_0_89,plain,
! [X24] :
( ~ bool(X24)
| impl(true,X24) = X24 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])]) ).
cnf(c_0_90,plain,
( lazy_impl(true,esk7_0) = false2
| ~ d(esk7_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_58]) ).
cnf(c_0_91,plain,
( ~ forallprefers(lazy_impl(prop(X1),X1),esk7_0)
| ~ d(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_81])]) ).
cnf(c_0_92,negated_conjecture,
( false2 = true
| false2 = err
| impl(true,false2) != false ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_87]),c_0_88]) ).
cnf(c_0_93,plain,
( impl(true,X1) = X1
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_94,plain,
( false2 = esk7_0
| ~ d(esk7_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_90]) ).
cnf(c_0_95,plain,
( esk7_0 = true
| esk7_0 = false ),
inference(spm,[status(thm)],[c_0_60,c_0_81]) ).
cnf(c_0_96,plain,
( ~ forallprefers(lazy_impl(true,X1),esk7_0)
| ~ d(esk7_0)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_47]) ).
cnf(c_0_97,negated_conjecture,
( false2 = err
| false2 = true
| ~ bool(false2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_60]) ).
cnf(c_0_98,plain,
( esk7_0 = true
| false2 = false ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_75])]) ).
cnf(c_0_99,plain,
false != err,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_100,plain,
true != false,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_101,plain,
( ~ forallprefers(X1,esk7_0)
| ~ d(esk7_0)
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_96,c_0_58]) ).
cnf(c_0_102,negated_conjecture,
esk7_0 = true,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_76])]),c_0_99]),c_0_100]) ).
cnf(c_0_103,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_101,c_0_102]),c_0_102]),c_0_64])]) ).
cnf(c_0_104,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_74]),c_0_75]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW102+1 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 22:49:37 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.LAypBq07d5/E---3.1_7406.p
% 0.38/0.53 # Version: 3.1pre001
% 0.38/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.53 # Starting sh5l with 300s (1) cores
% 0.38/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7549 completed with status 0
% 0.38/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.53 # No SInE strategy applied
% 0.38/0.53 # Search class: FGHSS-FFMM21-DFFFFFNN
% 0.38/0.53 # partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.38/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.38/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.38/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.38/0.53 # Starting sh5l with 136s (1) cores
% 0.38/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7560 completed with status 0
% 0.38/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.53 # No SInE strategy applied
% 0.38/0.53 # Search class: FGHSS-FFMM21-DFFFFFNN
% 0.38/0.53 # partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.38/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.38/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.53 # Preprocessing time : 0.002 s
% 0.38/0.53 # Presaturation interreduction done
% 0.38/0.53
% 0.38/0.53 # Proof found!
% 0.38/0.53 # SZS status Theorem
% 0.38/0.53 # SZS output start CNFRefutation
% See solution above
% 0.38/0.53 # Parsed axioms : 45
% 0.38/0.53 # Removed by relevancy pruning/SinE : 0
% 0.38/0.53 # Initial clauses : 99
% 0.38/0.53 # Removed in clause preprocessing : 19
% 0.38/0.53 # Initial clauses in saturation : 80
% 0.38/0.53 # Processed clauses : 336
% 0.38/0.53 # ...of these trivial : 4
% 0.38/0.53 # ...subsumed : 79
% 0.38/0.53 # ...remaining for further processing : 253
% 0.38/0.53 # Other redundant clauses eliminated : 8
% 0.38/0.53 # Clauses deleted for lack of memory : 0
% 0.38/0.53 # Backward-subsumed : 20
% 0.38/0.53 # Backward-rewritten : 73
% 0.38/0.53 # Generated clauses : 652
% 0.38/0.53 # ...of the previous two non-redundant : 554
% 0.38/0.53 # ...aggressively subsumed : 0
% 0.38/0.53 # Contextual simplify-reflections : 10
% 0.38/0.53 # Paramodulations : 639
% 0.38/0.53 # Factorizations : 7
% 0.38/0.53 # NegExts : 0
% 0.38/0.53 # Equation resolutions : 8
% 0.38/0.53 # Total rewrite steps : 325
% 0.38/0.53 # Propositional unsat checks : 0
% 0.38/0.53 # Propositional check models : 0
% 0.38/0.53 # Propositional check unsatisfiable : 0
% 0.38/0.53 # Propositional clauses : 0
% 0.38/0.53 # Propositional clauses after purity: 0
% 0.38/0.53 # Propositional unsat core size : 0
% 0.38/0.53 # Propositional preprocessing time : 0.000
% 0.38/0.53 # Propositional encoding time : 0.000
% 0.38/0.53 # Propositional solver time : 0.000
% 0.38/0.53 # Success case prop preproc time : 0.000
% 0.38/0.53 # Success case prop encoding time : 0.000
% 0.38/0.53 # Success case prop solver time : 0.000
% 0.38/0.53 # Current number of processed clauses : 92
% 0.38/0.53 # Positive orientable unit clauses : 17
% 0.38/0.53 # Positive unorientable unit clauses: 0
% 0.38/0.53 # Negative unit clauses : 13
% 0.38/0.53 # Non-unit-clauses : 62
% 0.38/0.53 # Current number of unprocessed clauses: 359
% 0.38/0.53 # ...number of literals in the above : 976
% 0.38/0.53 # Current number of archived formulas : 0
% 0.38/0.53 # Current number of archived clauses : 171
% 0.38/0.53 # Clause-clause subsumption calls (NU) : 2469
% 0.38/0.53 # Rec. Clause-clause subsumption calls : 1931
% 0.38/0.53 # Non-unit clause-clause subsumptions : 94
% 0.38/0.53 # Unit Clause-clause subsumption calls : 121
% 0.38/0.53 # Rewrite failures with RHS unbound : 0
% 0.38/0.53 # BW rewrite match attempts : 5
% 0.38/0.53 # BW rewrite match successes : 5
% 0.38/0.53 # Condensation attempts : 0
% 0.38/0.53 # Condensation successes : 0
% 0.38/0.53 # Termbank termtop insertions : 11557
% 0.38/0.53
% 0.38/0.53 # -------------------------------------------------
% 0.38/0.53 # User time : 0.028 s
% 0.38/0.53 # System time : 0.002 s
% 0.38/0.53 # Total time : 0.030 s
% 0.38/0.53 # Maximum resident set size: 1980 pages
% 0.38/0.53
% 0.38/0.53 # -------------------------------------------------
% 0.38/0.53 # User time : 0.110 s
% 0.38/0.53 # System time : 0.010 s
% 0.38/0.53 # Total time : 0.120 s
% 0.38/0.53 # Maximum resident set size: 1724 pages
% 0.38/0.53 % E---3.1 exiting
% 0.38/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------