%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW102+1 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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 5 05:29:26 PM UTC 2026
% Result : Theorem 1.98s 1.93s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 20
% Syntax : Number of formulae : 107 ( 35 unt; 0 def)
% Number of atoms : 299 ( 152 equ)
% Maximal formula atoms : 75 ( 2 avg)
% Number of connectives : 295 ( 103 ~; 133 |; 45 &)
% ( 6 <=>; 8 =>; 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 : 86 ( 8 sgn 46 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(not1_axiom1,axiom,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom1) ).
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(not1_not2,conjecture,
! [X5] : not1(X5) = not2(X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_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(def_not2,axiom,
! [X5] : not2(X5) = impl(X5,false2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_not2) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_bool) ).
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_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(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_false) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_true) ).
fof(lazy_impl_axiom1,axiom,
! [X3,X4] :
( ~ bool(X3)
=> lazy_impl(X3,X4) = phi(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom1) ).
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(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
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(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(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(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_20,plain,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
inference(fof_simplification,[status(thm)],[not1_axiom1]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
inference(fof_simplification,[status(thm)],[impl_axiom1]) ).
fof(c_0_22,negated_conjecture,
~ ! [X5] : not1(X5) = not2(X5),
inference(assume_negation,[status(cth)],[not1_not2]) ).
fof(c_0_23,plain,
! [X160] :
( bool(X160)
| not1(X160) = phi(X160) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
fof(c_0_24,plain,
! [X104] : lazy_impl(true,X104) = phi(X104),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_25,plain,
! [X95,X96] :
( bool(X95)
| impl(X95,X96) = phi(X95) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
fof(c_0_26,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_27,plain,
! [X161] : not2(X161) = impl(X161,false2),
inference(variable_rename,[status(thm)],[def_not2]) ).
cnf(c_0_28,plain,
( bool(X1)
| not1(X1) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( bool(X1)
| impl(X1,X2) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
not2(X1) = impl(X1,false2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
( not1(X1) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( impl(X1,X2) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
fof(c_0_35,plain,
! [X87] :
( ( ~ bool(X87)
| X87 = false
| X87 = true )
& ( X87 != false
| bool(X87) )
& ( X87 != true
| bool(X87) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])]) ).
cnf(c_0_36,negated_conjecture,
impl(esk8_0,false2) != not1(esk8_0),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( impl(X1,X2) = not1(X1)
| bool(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_38,plain,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
fof(c_0_39,plain,
! [X159] :
( false2 = phi(f7(esk7_0))
& ~ forallprefers(f7(X159),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_40,plain,
! [X157] : f7(X157) = lazy_impl(prop(X157),X157),
inference(variable_rename,[status(thm)],[def_f7]) ).
cnf(c_0_41,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
bool(esk8_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_43,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
fof(c_0_44,plain,
! [X92] :
( ( ~ d(X92)
| d(X92) )
& ( phi(X92) = err
| d(X92) )
& ( ~ d(X92)
| phi(X92) = X92 )
& ( phi(X92) = err
| phi(X92) = X92 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
cnf(c_0_45,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_47,plain,
! [X93] :
( ( prop(X93) != true
| bool(X93) )
& ( ~ bool(X93)
| prop(X93) = true ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])]) ).
fof(c_0_48,plain,
! [X3,X4] :
( ~ bool(X3)
=> lazy_impl(X3,X4) = phi(X3) ),
inference(fof_simplification,[status(thm)],[lazy_impl_axiom1]) ).
cnf(c_0_49,negated_conjecture,
( esk8_0 = true
| esk8_0 = false ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
not1(true) = false,
inference(split_conjunct,[status(thm)],[not1_axiom3]) ).
fof(c_0_51,plain,
! [X100] :
( ~ bool(X100)
| impl(true,X100) = X100 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])]) ).
fof(c_0_52,plain,
! [X94] :
( ( prop(X94) != false
| ~ bool(X94) )
& ( bool(X94)
| prop(X94) = false ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])]) ).
fof(c_0_53,plain,
! [X103] : lazy_impl(false,X103) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
cnf(c_0_54,plain,
( phi(X1) = err
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_55,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_29]),c_0_46]) ).
cnf(c_0_56,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_57,plain,
! [X101,X102] :
( bool(X101)
| lazy_impl(X101,X102) = phi(X101) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).
cnf(c_0_58,negated_conjecture,
( esk8_0 = false
| impl(true,false2) != false ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_49]),c_0_50]) ).
cnf(c_0_59,plain,
( impl(true,X1) = X1
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_61,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_62,plain,
( bool(X1)
| prop(X1) = false ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_63,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_64,plain,
( lazy_impl(true,X1) = X1
| lazy_impl(true,X1) = err ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_29]),c_0_29]) ).
cnf(c_0_65,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,plain,
( bool(X1)
| lazy_impl(X1,X2) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_67,negated_conjecture,
( esk8_0 = false
| false2 != false ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_68,plain,
not1(false) = true,
inference(split_conjunct,[status(thm)],[not1_axiom2]) ).
fof(c_0_69,plain,
! [X99] :
( ~ bool(X99)
| impl(false,X99) = true ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom3])]) ).
fof(c_0_70,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_71,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
inference(rw,[status(thm)],[c_0_61,c_0_29]) ).
cnf(c_0_72,plain,
( lazy_impl(true,true) = false2
| bool(esk7_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_62]),c_0_63]) ).
cnf(c_0_73,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_74,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = err
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_75,plain,
( lazy_impl(X1,X2) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_66,c_0_29]) ).
cnf(c_0_76,negated_conjecture,
( impl(false,false2) != true
| false2 != false ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_67]),c_0_68]) ).
cnf(c_0_77,plain,
( impl(false,X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_78,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_79,plain,
! [X88,X89] :
( ( X88 = false
| d(X88)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| d(X88)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| d(X89)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| d(X89)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| ~ bool(X88)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| ~ bool(X88)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| bool(X89)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| bool(X89)
| ~ d(X88)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| d(X88)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| d(X88)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| d(X89)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| d(X89)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| ~ bool(X88)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| ~ bool(X88)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X88 = false
| bool(X89)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( X89 = true
| bool(X89)
| d(X89)
| ~ forallprefers(X88,X89) )
& ( d(X88)
| ~ d(X89)
| forallprefers(X88,X89) )
& ( ~ d(X88)
| ~ d(X89)
| bool(X88)
| ~ bool(X89)
| forallprefers(X88,X89) )
& ( X88 != false
| X89 != true
| forallprefers(X88,X89) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])])]) ).
cnf(c_0_80,plain,
( false2 = true
| bool(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_81,plain,
( esk7_0 = false2
| false2 = err
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_74]) ).
cnf(c_0_82,plain,
( lazy_impl(X1,X2) = not1(X1)
| bool(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_75]) ).
cnf(c_0_83,negated_conjecture,
false2 != false,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_60]) ).
cnf(c_0_84,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_46]),c_0_46]) ).
cnf(c_0_85,plain,
( forallprefers(X1,X2)
| X1 != false
| X2 != true ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_86,plain,
( false2 = true
| esk7_0 = true
| esk7_0 = false ),
inference(spm,[status(thm)],[c_0_41,c_0_80]) ).
cnf(c_0_87,plain,
( false2 = true
| false2 = err
| esk7_0 = false2 ),
inference(spm,[status(thm)],[c_0_81,c_0_80]) ).
cnf(c_0_88,plain,
( lazy_impl(true,esk7_0) = false2
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_71]) ).
cnf(c_0_89,plain,
bool(true),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_82]),c_0_50]),c_0_83]) ).
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_84,c_0_85]) ).
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_55,c_0_64]),c_0_55]) ).
cnf(c_0_92,plain,
( false2 = err
| false2 = true ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_83]) ).
cnf(c_0_93,plain,
( lazy_impl(true,true) = false2
| esk7_0 = false
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_86]),c_0_73]),c_0_89])]) ).
cnf(c_0_94,plain,
( not1(X1) = X1
| bool(X1)
| ~ d(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_33]) ).
cnf(c_0_95,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_96,plain,
true != false,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_97,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_98,plain,
( esk7_0 = false2
| ~ d(esk7_0)
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_71,c_0_88]) ).
cnf(c_0_99,plain,
( esk7_0 = false
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_93]),c_0_73])]) ).
cnf(c_0_100,plain,
bool(false),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_94]),c_0_95])]),c_0_96]) ).
cnf(c_0_101,plain,
( false2 = err
| lazy_impl(true,X1) != false
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_56]) ).
cnf(c_0_102,plain,
false2 = true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_95]),c_0_100])]),c_0_83]) ).
cnf(c_0_103,plain,
true != err,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_104,plain,
( lazy_impl(true,X1) != false
| ~ bool(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102]),c_0_103]) ).
cnf(c_0_105,plain,
( X1 != false
| ~ d(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_71]),c_0_60]) ).
cnf(c_0_106,plain,
$false,
inference(spm,[status(thm)],[c_0_105,c_0_95]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW102+1 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n020.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 06:23:05 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.98/1.93 % Version : CSE_E---1.7
% 1.98/1.93 % Problem : theBenchmark.p
% 1.98/1.93 % SZS status Theorem for theBenchmark.p
% 1.98/1.93 % SZS output start CNFRefutation
% See solution above
% 1.98/1.94 % Total time : 1.369s
%------------------------------------------------------------------------------