TSTP Solution File: SWC187+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC187+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 04:28:12 EDT 2024
% Result : Theorem 0.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 18
% Syntax : Number of formulae : 113 ( 21 unt; 0 def)
% Number of atoms : 413 ( 151 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 497 ( 197 ~; 205 |; 32 &)
% ( 4 <=>; 59 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn 88 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) )
| ( ! [X8] :
( ssItem(X8)
=> ( cons(X8,nil) != X3
| ~ memberP(X4,X8) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) )
| ( ! [X8] :
( ssItem(X8)
=> ( cons(X8,nil) != X3
| ~ memberP(X4,X8) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_19,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssList(esk53_0)
& ssList(esk54_0)
& app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0
& ( memberP(esk53_0,esk52_0)
| memberP(esk54_0,esk52_0) )
& ( nil = esk51_0
| ssItem(esk55_0) )
& ( nil = esk50_0
| ssItem(esk55_0) )
& ( nil = esk51_0
| cons(esk55_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk55_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk55_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk55_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
fof(c_0_20,plain,
! [X227,X228] :
( ( nil = X228
| nil != app(X227,X228)
| ~ ssList(X228)
| ~ ssList(X227) )
& ( nil = X227
| nil != app(X227,X228)
| ~ ssList(X228)
| ~ ssList(X227) )
& ( nil != X228
| nil != X227
| nil = app(X227,X228)
| ~ ssList(X228)
| ~ ssList(X227) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_21,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk50_0,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X132,X133] :
( ~ ssList(X132)
| ~ ssList(X133)
| ssList(app(X132,X133)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_27,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( esk54_0 = nil
| esk50_0 != nil
| ~ ssList(app(esk53_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X113,X114] :
( ~ ssList(X113)
| ~ ssItem(X114)
| ssList(cons(X114,X113)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_32,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(esk53_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
( esk54_0 = nil
| esk50_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_36,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_30])]) ).
fof(c_0_38,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_39,negated_conjecture,
( memberP(esk53_0,esk52_0)
| memberP(esk54_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_40,negated_conjecture,
( esk54_0 = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_41,negated_conjecture,
( esk53_0 = nil
| esk50_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_37]),c_0_30])]) ).
fof(c_0_42,plain,
! [X159] :
( ~ ssItem(X159)
| ~ memberP(nil,X159) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])]) ).
cnf(c_0_43,negated_conjecture,
( memberP(nil,esk52_0)
| memberP(esk53_0,esk52_0)
| esk50_0 != nil ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( esk53_0 = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_35]),c_0_36])]) ).
fof(c_0_45,plain,
! [X224,X225,X226] :
( ~ ssList(X224)
| ~ ssList(X225)
| ~ ssList(X226)
| app(app(X224,X225),X226) = app(X224,app(X225,X226)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( memberP(nil,esk52_0)
| esk50_0 != nil ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_48,plain,
! [X13,X14,X17,X18] :
( ( ssList(esk3_2(X13,X14))
| ~ memberP(X13,X14)
| ~ ssItem(X14)
| ~ ssList(X13) )
& ( ssList(esk4_2(X13,X14))
| ~ memberP(X13,X14)
| ~ ssItem(X14)
| ~ ssList(X13) )
& ( app(esk3_2(X13,X14),cons(X14,esk4_2(X13,X14))) = X13
| ~ memberP(X13,X14)
| ~ ssItem(X14)
| ~ ssList(X13) )
& ( ~ ssList(X17)
| ~ ssList(X18)
| app(X17,cons(X14,X18)) != X13
| memberP(X13,X14)
| ~ ssItem(X14)
| ~ ssList(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])])]) ).
cnf(c_0_49,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_50,plain,
! [X222,X223] :
( ~ ssList(X222)
| ~ ssItem(X223)
| cons(X223,X222) = app(cons(X223,nil),X222) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_51,plain,
! [X156,X157,X158] :
( ( ~ memberP(cons(X157,X158),X156)
| X156 = X157
| memberP(X158,X156)
| ~ ssList(X158)
| ~ ssItem(X157)
| ~ ssItem(X156) )
& ( X156 != X157
| memberP(cons(X157,X158),X156)
| ~ ssList(X158)
| ~ ssItem(X157)
| ~ ssItem(X156) )
& ( ~ memberP(X158,X156)
| memberP(cons(X157,X158),X156)
| ~ ssList(X158)
| ~ ssItem(X157)
| ~ ssItem(X156) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
cnf(c_0_52,negated_conjecture,
( nil = esk50_0
| cons(esk55_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_53,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_36])]) ).
cnf(c_0_54,negated_conjecture,
( nil = esk50_0
| ssItem(esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_55,plain,
( memberP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,cons(X3,X2)) != X4
| ~ ssItem(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_49]),c_0_25]),c_0_30])]) ).
cnf(c_0_57,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_59,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,negated_conjecture,
cons(esk55_0,nil) = esk50_0,
inference(sr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
ssItem(esk55_0),
inference(sr,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_62,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_63,negated_conjecture,
( app(esk53_0,cons(esk52_0,esk54_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_25]),c_0_36])]) ).
cnf(c_0_64,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_58,c_0_22]) ).
cnf(c_0_65,negated_conjecture,
( esk55_0 = X1
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_35]),c_0_61])]),c_0_46]) ).
cnf(c_0_66,negated_conjecture,
( memberP(esk50_0,esk52_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_25]),c_0_30]),c_0_36])]) ).
fof(c_0_67,plain,
! [X216,X217,X218] :
( ~ ssList(X216)
| ~ ssList(X217)
| ~ ssList(X218)
| app(X218,X217) != app(X216,X217)
| X218 = X216 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_68,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
cnf(c_0_69,negated_conjecture,
( esk52_0 = esk55_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_36])]) ).
fof(c_0_70,plain,
! [X130,X131] :
( ~ ssList(X130)
| ~ ssItem(X131)
| tl(cons(X131,X130)) = X130 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_71,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( app(esk50_0,X1) = cons(esk55_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_60]),c_0_61])]) ).
fof(c_0_73,plain,
! [X232,X233] :
( ~ ssList(X232)
| ~ ssList(X233)
| nil = X232
| tl(app(X232,X233)) = app(tl(X232),X233) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])])]) ).
cnf(c_0_74,negated_conjecture,
esk52_0 = esk55_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_75,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( X1 = esk50_0
| app(X1,X2) != cons(esk55_0,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_64])]) ).
fof(c_0_77,plain,
! [X219,X220,X221] :
( ~ ssList(X219)
| ~ ssList(X220)
| ~ ssList(X221)
| app(X220,X221) != app(X220,X219)
| X221 = X219 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_78,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_79,negated_conjecture,
app(esk53_0,app(esk50_0,esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_74]),c_0_60]),c_0_60]),c_0_64])]) ).
cnf(c_0_80,negated_conjecture,
tl(esk50_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_60]),c_0_35]),c_0_61])]) ).
fof(c_0_81,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_82,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| cons(esk55_0,esk54_0) != esk50_0
| ~ ssList(app(esk53_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_24]),c_0_25])]) ).
cnf(c_0_83,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
fof(c_0_84,plain,
! [X229] :
( ~ ssList(X229)
| app(X229,nil) = X229 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_85,negated_conjecture,
( app(tl(esk53_0),app(esk50_0,esk54_0)) = nil
| esk53_0 = nil
| ~ ssList(app(esk50_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_30])]) ).
fof(c_0_86,plain,
! [X129] :
( ~ ssList(X129)
| nil = X129
| ssList(tl(X129)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_81])])]) ).
cnf(c_0_87,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| cons(esk55_0,esk54_0) != esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_29]),c_0_30])]) ).
cnf(c_0_88,negated_conjecture,
( X1 = esk54_0
| app(app(esk53_0,cons(esk52_0,nil)),X1) != esk50_0
| ~ ssList(app(esk53_0,cons(esk52_0,nil)))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_24]),c_0_25])]) ).
cnf(c_0_89,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( app(esk50_0,esk54_0) = nil
| esk53_0 = nil
| ~ ssList(app(esk50_0,esk54_0))
| ~ ssList(tl(esk53_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_85]) ).
cnf(c_0_91,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_92,negated_conjecture,
app(app(esk53_0,esk50_0),esk54_0) = esk50_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_74]),c_0_60]) ).
cnf(c_0_93,negated_conjecture,
( app(esk53_0,esk50_0) = esk50_0
| cons(esk55_0,esk54_0) != esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_74]),c_0_60]),c_0_60]),c_0_64])]) ).
cnf(c_0_94,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,cons(esk52_0,nil)) != esk50_0
| ~ ssList(app(esk53_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_35])]) ).
cnf(c_0_95,negated_conjecture,
( app(esk50_0,esk54_0) = nil
| esk53_0 = nil
| ~ ssList(app(esk50_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_30])]) ).
fof(c_0_96,plain,
! [X153,X154,X155] :
( ( ~ memberP(app(X154,X155),X153)
| memberP(X154,X153)
| memberP(X155,X153)
| ~ ssList(X155)
| ~ ssList(X154)
| ~ ssItem(X153) )
& ( ~ memberP(X154,X153)
| memberP(app(X154,X155),X153)
| ~ ssList(X155)
| ~ ssList(X154)
| ~ ssItem(X153) )
& ( ~ memberP(X155,X153)
| memberP(app(X154,X155),X153)
| ~ ssList(X155)
| ~ ssList(X154)
| ~ ssItem(X153) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_97,negated_conjecture,
( app(esk50_0,esk54_0) = esk50_0
| cons(esk55_0,esk54_0) != esk50_0 ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,cons(esk52_0,nil)) != esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_29]),c_0_30])]) ).
cnf(c_0_99,negated_conjecture,
( app(esk50_0,esk54_0) = nil
| esk53_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_29]),c_0_25]),c_0_64])]) ).
cnf(c_0_100,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_101,negated_conjecture,
( app(nil,esk54_0) = nil
| cons(esk55_0,esk54_0) != esk50_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_97]),c_0_80]),c_0_80]),c_0_25]),c_0_64])]),c_0_53]) ).
cnf(c_0_102,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,esk50_0) != esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_74]),c_0_60]),c_0_60]),c_0_64])]) ).
cnf(c_0_103,negated_conjecture,
esk53_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_99]),c_0_25]),c_0_64])]),c_0_53]) ).
fof(c_0_104,plain,
! [X137] :
( ~ ssList(X137)
| app(nil,X137) = X137 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_105,negated_conjecture,
( cons(esk55_0,esk54_0) != esk50_0
| ~ memberP(esk54_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_35]),c_0_25])]),c_0_46]) ).
cnf(c_0_106,negated_conjecture,
( memberP(esk54_0,esk55_0)
| memberP(esk53_0,esk55_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_74]),c_0_74]) ).
cnf(c_0_107,negated_conjecture,
( esk54_0 = nil
| app(nil,esk50_0) != esk50_0 ),
inference(rw,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_109,negated_conjecture,
( memberP(esk53_0,esk55_0)
| cons(esk55_0,esk54_0) != esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_61])]) ).
cnf(c_0_110,negated_conjecture,
esk54_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_64])]) ).
cnf(c_0_111,negated_conjecture,
memberP(nil,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_103]),c_0_110]),c_0_60])]) ).
cnf(c_0_112,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_111]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SWC187+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Sun May 19 02:43:23 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.13/0.37 Running first-order model finding
% 0.13/0.37 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.48 # Version: 3.1.0
% 0.13/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 # Starting sh5l with 300s (1) cores
% 0.13/0.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31294 completed with status 0
% 0.13/0.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 # No SInE strategy applied
% 0.13/0.48 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.13/0.48 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.13/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.48 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.13/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.13/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.13/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 31304 completed with status 0
% 0.13/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.13/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 # No SInE strategy applied
% 0.13/0.48 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.13/0.48 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.13/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.48 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.13/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.13/0.48 # Preprocessing time : 0.002 s
% 0.13/0.48 # Presaturation interreduction done
% 0.13/0.48
% 0.13/0.48 # Proof found!
% 0.13/0.48 # SZS status Theorem
% 0.13/0.48 # SZS output start CNFRefutation
% See solution above
% 0.13/0.48 # Parsed axioms : 96
% 0.13/0.48 # Removed by relevancy pruning/SinE : 0
% 0.13/0.48 # Initial clauses : 207
% 0.13/0.48 # Removed in clause preprocessing : 2
% 0.13/0.48 # Initial clauses in saturation : 205
% 0.13/0.48 # Processed clauses : 1293
% 0.13/0.48 # ...of these trivial : 16
% 0.13/0.48 # ...subsumed : 449
% 0.13/0.48 # ...remaining for further processing : 828
% 0.13/0.48 # Other redundant clauses eliminated : 105
% 0.13/0.48 # Clauses deleted for lack of memory : 0
% 0.13/0.48 # Backward-subsumed : 86
% 0.13/0.48 # Backward-rewritten : 151
% 0.13/0.48 # Generated clauses : 3565
% 0.13/0.48 # ...of the previous two non-redundant : 3176
% 0.13/0.48 # ...aggressively subsumed : 0
% 0.13/0.48 # Contextual simplify-reflections : 100
% 0.13/0.48 # Paramodulations : 3447
% 0.13/0.48 # Factorizations : 0
% 0.13/0.48 # NegExts : 0
% 0.13/0.48 # Equation resolutions : 110
% 0.13/0.48 # Disequality decompositions : 0
% 0.13/0.48 # Total rewrite steps : 4251
% 0.13/0.48 # ...of those cached : 4201
% 0.13/0.48 # Propositional unsat checks : 0
% 0.13/0.48 # Propositional check models : 0
% 0.13/0.48 # Propositional check unsatisfiable : 0
% 0.13/0.48 # Propositional clauses : 0
% 0.13/0.48 # Propositional clauses after purity: 0
% 0.13/0.48 # Propositional unsat core size : 0
% 0.13/0.48 # Propositional preprocessing time : 0.000
% 0.13/0.48 # Propositional encoding time : 0.000
% 0.13/0.48 # Propositional solver time : 0.000
% 0.13/0.48 # Success case prop preproc time : 0.000
% 0.13/0.48 # Success case prop encoding time : 0.000
% 0.13/0.48 # Success case prop solver time : 0.000
% 0.13/0.48 # Current number of processed clauses : 359
% 0.13/0.48 # Positive orientable unit clauses : 49
% 0.13/0.48 # Positive unorientable unit clauses: 0
% 0.13/0.48 # Negative unit clauses : 8
% 0.13/0.48 # Non-unit-clauses : 302
% 0.13/0.48 # Current number of unprocessed clauses: 2188
% 0.13/0.48 # ...number of literals in the above : 13701
% 0.13/0.48 # Current number of archived formulas : 0
% 0.13/0.48 # Current number of archived clauses : 446
% 0.13/0.48 # Clause-clause subsumption calls (NU) : 39424
% 0.13/0.48 # Rec. Clause-clause subsumption calls : 11616
% 0.13/0.48 # Non-unit clause-clause subsumptions : 466
% 0.13/0.48 # Unit Clause-clause subsumption calls : 1170
% 0.13/0.48 # Rewrite failures with RHS unbound : 0
% 0.13/0.48 # BW rewrite match attempts : 23
% 0.13/0.48 # BW rewrite match successes : 23
% 0.13/0.48 # Condensation attempts : 0
% 0.13/0.48 # Condensation successes : 0
% 0.13/0.48 # Termbank termtop insertions : 82901
% 0.13/0.48 # Search garbage collected termcells : 4327
% 0.13/0.48
% 0.13/0.48 # -------------------------------------------------
% 0.13/0.48 # User time : 0.089 s
% 0.13/0.48 # System time : 0.009 s
% 0.13/0.48 # Total time : 0.098 s
% 0.13/0.48 # Maximum resident set size: 2488 pages
% 0.13/0.48
% 0.13/0.48 # -------------------------------------------------
% 0.13/0.48 # User time : 0.438 s
% 0.13/0.48 # System time : 0.019 s
% 0.13/0.48 # Total time : 0.457 s
% 0.13/0.48 # Maximum resident set size: 1828 pages
% 0.13/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------