TSTP Solution File: SWW102+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW102+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : 600s
% DateTime : Thu Jul 21 00:10:07 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of formulae : 104 ( 34 unt; 0 def)
% Number of atoms : 293 ( 139 equ)
% Maximal formula atoms : 75 ( 2 avg)
% Number of connectives : 303 ( 114 ~; 143 |; 38 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 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 : 78 ( 9 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(not1_not2,conjecture,
! [X5] : not1(X5) = not2(X5),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',not1_not2) ).
fof(def_not2,axiom,
! [X5] : not2(X5) = impl(X5,false2),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_not2) ).
fof(not1_axiom1,axiom,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',not1_axiom1) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom3) ).
fof(impl_axiom1,axiom,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',impl_axiom1) ).
fof(def_false2,axiom,
? [X5] :
( false2 = phi(f7(X5))
& ~ ? [X10] : forallprefers(f7(X10),f7(X5)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_false2) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_f7) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',prop_true) ).
fof(def_phi,axiom,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_phi) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_bool) ).
fof(not1_axiom2,axiom,
not1(false) = true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',not1_axiom2) ).
fof(impl_axiom3,axiom,
! [X4] :
( bool(X4)
=> impl(false,X4) = true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',impl_axiom3) ).
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/sandbox2/benchmark/Axioms/SWV012+0.ax',def_forallprefers) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',prop_false) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
fof(not1_axiom3,axiom,
not1(true) = false,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',not1_axiom3) ).
fof(impl_axiom4,axiom,
! [X4] :
( bool(X4)
=> impl(true,X4) = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',impl_axiom4) ).
fof(false_true_err_in_d,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
fof(distinct_false_true_err,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox2/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,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_21,plain,
! [X6] : not2(X6) = impl(X6,false2),
inference(variable_rename,[status(thm)],[def_not2]) ).
fof(c_0_22,plain,
! [X4] :
( bool(X4)
| not1(X4) = phi(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[not1_axiom1])])]) ).
fof(c_0_23,plain,
! [X5] : lazy_impl(true,X5) = phi(X5),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_24,plain,
! [X5,X6] :
( bool(X5)
| impl(X5,X6) = phi(X5) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[impl_axiom1])])])])]) ).
fof(c_0_25,plain,
! [X12] :
( false2 = phi(f7(esk7_0))
& ~ forallprefers(f7(X12),f7(esk7_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])])])]) ).
fof(c_0_26,plain,
! [X6] : f7(X6) = lazy_impl(prop(X6),X6),
inference(variable_rename,[status(thm)],[def_f7]) ).
cnf(c_0_27,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
not2(X1) = impl(X1,false2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( not1(X1) = phi(X1)
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( impl(X1,X2) = phi(X1)
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_34,plain,
! [X2,X2] :
( ( prop(X2) != true
| bool(X2) )
& ( ~ bool(X2)
| prop(X2) = true ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])])])]) ).
fof(c_0_35,plain,
! [X2] :
( ( ~ d(X2)
| d(X2) )
& ( phi(X2) = err
| d(X2) )
& ( ~ d(X2)
| phi(X2) = X2 )
& ( phi(X2) = err
| phi(X2) = X2 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[def_phi])])]) ).
fof(c_0_36,plain,
! [X2,X2] :
( ( ~ bool(X2)
| X2 = false
| X2 = true )
& ( X2 != false
| bool(X2) )
& ( X2 != true
| bool(X2) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])])])]) ).
cnf(c_0_37,negated_conjecture,
impl(esk8_0,false2) != not1(esk8_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_38,plain,
( not1(X1) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( impl(X1,X2) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_40,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_41,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_30]),c_0_33]) ).
cnf(c_0_42,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
( X1 = true
| X1 = false
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,negated_conjecture,
bool(esk8_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
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_40,c_0_33]),c_0_33]) ).
cnf(c_0_47,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
inference(rw,[status(thm)],[c_0_43,c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( esk8_0 = false
| esk8_0 = true ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
not1(false) = true,
inference(split_conjunct,[status(thm)],[not1_axiom2]) ).
fof(c_0_51,plain,
! [X5] :
( ~ bool(X5)
| impl(false,X5) = true ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom3])]) ).
cnf(c_0_52,plain,
( phi(X1) = X1
| phi(X1) = err ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(prop(esk7_0),esk7_0))
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_54,plain,
( lazy_impl(true,esk7_0) = false2
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( esk8_0 = true
| impl(false,false2) != true ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_49]),c_0_50]) ).
cnf(c_0_56,plain,
( impl(false,X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
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_52,c_0_30]),c_0_30]) ).
cnf(c_0_58,plain,
( ~ forallprefers(false2,lazy_impl(prop(esk7_0),esk7_0))
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
fof(c_0_59,plain,
! [X3,X4,X3,X4] :
( ( X3 = false
| d(X3)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| d(X3)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| d(X4)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| d(X4)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| ~ bool(X3)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| ~ bool(X3)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| bool(X4)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| bool(X4)
| ~ d(X3)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| d(X3)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| d(X3)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| d(X4)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| d(X4)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| ~ bool(X3)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| ~ bool(X3)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X3 = false
| bool(X4)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( X4 = true
| bool(X4)
| d(X4)
| ~ forallprefers(X3,X4) )
& ( d(X3)
| ~ d(X4)
| forallprefers(X3,X4) )
& ( ~ d(X3)
| ~ d(X4)
| bool(X3)
| ~ bool(X4)
| forallprefers(X3,X4) )
& ( X3 != false
| X4 != true
| forallprefers(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[def_forallprefers])])])])])]) ).
cnf(c_0_60,negated_conjecture,
( esk8_0 = true
| ~ bool(false2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_62,plain,
! [X2,X2] :
( ( prop(X2) != false
| ~ bool(X2) )
& ( bool(X2)
| prop(X2) = false ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[prop_false])])])])]) ).
fof(c_0_63,plain,
! [X5] : lazy_impl(false,X5) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
cnf(c_0_64,plain,
( lazy_impl(true,X1) = err
| X1 != err ),
inference(ef,[status(thm)],[c_0_57]) ).
cnf(c_0_65,plain,
( ~ forallprefers(false2,lazy_impl(true,esk7_0))
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_42]) ).
cnf(c_0_66,plain,
( forallprefers(X1,X2)
| bool(X1)
| ~ bool(X2)
| ~ d(X2)
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_67,plain,
( forallprefers(X1,X2)
| d(X1)
| ~ d(X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( esk8_0 = true
| false2 != false ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,plain,
not1(true) = false,
inference(split_conjunct,[status(thm)],[not1_axiom3]) ).
fof(c_0_70,plain,
! [X5] :
( ~ bool(X5)
| impl(true,X5) = X5 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])]) ).
cnf(c_0_71,plain,
( prop(X1) = false
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_72,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_73,plain,
( false2 = err
| lazy_impl(prop(esk7_0),esk7_0) != err ),
inference(spm,[status(thm)],[c_0_41,c_0_64]) ).
cnf(c_0_74,plain,
( d(X1)
| phi(X1) = err ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_75,plain,
( ~ forallprefers(false2,esk7_0)
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_48]) ).
cnf(c_0_76,plain,
( forallprefers(X1,X2)
| bool(X1)
| ~ d(X2)
| ~ bool(X2) ),
inference(csr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_77,negated_conjecture,
( impl(true,false2) != false
| false2 != false ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_68]),c_0_69]) ).
cnf(c_0_78,plain,
( impl(true,X1) = X1
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_79,plain,
( lazy_impl(true,true) = false2
| bool(esk7_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_71]),c_0_72]) ).
cnf(c_0_80,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_81,plain,
( false2 = err
| lazy_impl(true,esk7_0) != err
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_42]) ).
cnf(c_0_82,plain,
( lazy_impl(true,X1) = err
| d(X1) ),
inference(rw,[status(thm)],[c_0_74,c_0_30]) ).
cnf(c_0_83,plain,
( bool(false2)
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,negated_conjecture,
false2 != false,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_61]) ).
cnf(c_0_85,plain,
( false2 = true
| bool(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_79]),c_0_80])]) ).
cnf(c_0_86,plain,
( false2 = err
| d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
( forallprefers(X1,X2)
| X2 != true
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_88,plain,
( false2 = true
| ~ d(esk7_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_83]),c_0_84]),c_0_85]) ).
cnf(c_0_89,plain,
( false2 = true
| false2 = err
| d(esk7_0) ),
inference(spm,[status(thm)],[c_0_86,c_0_85]) ).
cnf(c_0_90,plain,
( lazy_impl(prop(esk7_0),esk7_0) != true
| lazy_impl(prop(X1),X1) != false ),
inference(spm,[status(thm)],[c_0_46,c_0_87]) ).
cnf(c_0_91,plain,
( lazy_impl(prop(esk7_0),esk7_0) = false2
| false2 = err ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_57]),c_0_41]) ).
cnf(c_0_92,plain,
( false2 = err
| false2 = true ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,plain,
( false2 = err
| lazy_impl(prop(X1),X1) != false ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
cnf(c_0_94,plain,
( false2 = err
| lazy_impl(true,X1) != false
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_93,c_0_42]) ).
cnf(c_0_95,plain,
( false2 = err
| X1 != false
| ~ d(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_48]),c_0_61]) ).
cnf(c_0_96,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_97,plain,
false2 = err,
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,plain,
true != err,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_99,plain,
( false2 = true
| esk7_0 = false
| esk7_0 = true ),
inference(spm,[status(thm)],[c_0_44,c_0_85]) ).
cnf(c_0_100,plain,
~ d(esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_97]),c_0_98]) ).
cnf(c_0_101,plain,
( esk7_0 = true
| esk7_0 = false ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_97]),c_0_98]) ).
cnf(c_0_102,plain,
esk7_0 = true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_96])]) ).
cnf(c_0_103,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_102]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW102+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 5 10:25:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Failure: Out of unprocessed clauses!
% 0.22/1.41 # OLD status GaveUp
% 0.22/1.41 # Parsed axioms : 45
% 0.22/1.41 # Removed by relevancy pruning/SinE : 28
% 0.22/1.41 # Initial clauses : 22
% 0.22/1.41 # Removed in clause preprocessing : 3
% 0.22/1.41 # Initial clauses in saturation : 19
% 0.22/1.41 # Processed clauses : 1180
% 0.22/1.41 # ...of these trivial : 59
% 0.22/1.41 # ...subsumed : 852
% 0.22/1.41 # ...remaining for further processing : 269
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 28
% 0.22/1.41 # Backward-rewritten : 15
% 0.22/1.41 # Generated clauses : 2499
% 0.22/1.41 # ...of the previous two non-trivial : 1376
% 0.22/1.41 # Contextual simplify-reflections : 498
% 0.22/1.41 # Paramodulations : 2497
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 2
% 0.22/1.41 # Current number of processed clauses : 226
% 0.22/1.41 # Positive orientable unit clauses : 6
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 5
% 0.22/1.41 # Non-unit-clauses : 215
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 46
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 45064
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 23616
% 0.22/1.41 # Non-unit clause-clause subsumptions : 1373
% 0.22/1.41 # Unit Clause-clause subsumption calls : 45
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 36683
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.106 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.110 s
% 0.22/1.41 # Maximum resident set size: 3560 pages
% 0.22/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.018 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 104
% 0.22/1.41 # Proof object clause steps : 69
% 0.22/1.41 # Proof object formula steps : 35
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 26
% 0.22/1.41 # Proof object initial formulas used : 19
% 0.22/1.41 # Proof object generating inferences : 32
% 0.22/1.41 # Proof object simplifying inferences : 32
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 45
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 99
% 0.22/1.41 # Removed in clause preprocessing : 19
% 0.22/1.41 # Initial clauses in saturation : 80
% 0.22/1.41 # Processed clauses : 490
% 0.22/1.41 # ...of these trivial : 10
% 0.22/1.41 # ...subsumed : 246
% 0.22/1.41 # ...remaining for further processing : 234
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 50
% 0.22/1.41 # Backward-rewritten : 93
% 0.22/1.41 # Generated clauses : 1577
% 0.22/1.41 # ...of the previous two non-trivial : 1298
% 0.22/1.41 # Contextual simplify-reflections : 196
% 0.22/1.41 # Paramodulations : 1566
% 0.22/1.41 # Factorizations : 11
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 91
% 0.22/1.41 # Positive orientable unit clauses : 15
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 10
% 0.22/1.41 # Non-unit-clauses : 66
% 0.22/1.41 # Current number of unprocessed clauses: 455
% 0.22/1.41 # ...number of literals in the above : 1390
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 157
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 8474
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 4550
% 0.22/1.41 # Non-unit clause-clause subsumptions : 379
% 0.22/1.41 # Unit Clause-clause subsumption calls : 156
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 7
% 0.22/1.41 # BW rewrite match successes : 7
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 25660
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.055 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.058 s
% 0.22/1.41 # Maximum resident set size: 4100 pages
%------------------------------------------------------------------------------