TSTP Solution File: SWC218+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n003.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 : Thu Aug 31 20:20:49 EDT 2023
% Result : Theorem 0.60s 0.66s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 86
% Syntax : Number of formulae : 131 ( 23 unt; 78 typ; 0 def)
% Number of atoms : 154 ( 63 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 166 ( 65 ~; 59 |; 15 &)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 68 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 59 ( 59 usr; 10 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ssItem: $i > $o ).
tff(decl_23,type,
neq: ( $i * $i ) > $o ).
tff(decl_24,type,
ssList: $i > $o ).
tff(decl_25,type,
memberP: ( $i * $i ) > $o ).
tff(decl_26,type,
cons: ( $i * $i ) > $i ).
tff(decl_27,type,
app: ( $i * $i ) > $i ).
tff(decl_28,type,
singletonP: $i > $o ).
tff(decl_29,type,
nil: $i ).
tff(decl_30,type,
frontsegP: ( $i * $i ) > $o ).
tff(decl_31,type,
rearsegP: ( $i * $i ) > $o ).
tff(decl_32,type,
segmentP: ( $i * $i ) > $o ).
tff(decl_33,type,
cyclefreeP: $i > $o ).
tff(decl_34,type,
leq: ( $i * $i ) > $o ).
tff(decl_35,type,
totalorderP: $i > $o ).
tff(decl_36,type,
strictorderP: $i > $o ).
tff(decl_37,type,
lt: ( $i * $i ) > $o ).
tff(decl_38,type,
totalorderedP: $i > $o ).
tff(decl_39,type,
strictorderedP: $i > $o ).
tff(decl_40,type,
duplicatefreeP: $i > $o ).
tff(decl_41,type,
equalelemsP: $i > $o ).
tff(decl_42,type,
hd: $i > $i ).
tff(decl_43,type,
tl: $i > $i ).
tff(decl_44,type,
geq: ( $i * $i ) > $o ).
tff(decl_45,type,
gt: ( $i * $i ) > $o ).
tff(decl_46,type,
esk1_0: $i ).
tff(decl_47,type,
esk2_0: $i ).
tff(decl_48,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk5_1: $i > $i ).
tff(decl_51,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk10_1: $i > $i ).
tff(decl_56,type,
esk11_1: $i > $i ).
tff(decl_57,type,
esk12_1: $i > $i ).
tff(decl_58,type,
esk13_1: $i > $i ).
tff(decl_59,type,
esk14_1: $i > $i ).
tff(decl_60,type,
esk15_1: $i > $i ).
tff(decl_61,type,
esk16_1: $i > $i ).
tff(decl_62,type,
esk17_1: $i > $i ).
tff(decl_63,type,
esk18_1: $i > $i ).
tff(decl_64,type,
esk19_1: $i > $i ).
tff(decl_65,type,
esk20_1: $i > $i ).
tff(decl_66,type,
esk21_1: $i > $i ).
tff(decl_67,type,
esk22_1: $i > $i ).
tff(decl_68,type,
esk23_1: $i > $i ).
tff(decl_69,type,
esk24_1: $i > $i ).
tff(decl_70,type,
esk25_1: $i > $i ).
tff(decl_71,type,
esk26_1: $i > $i ).
tff(decl_72,type,
esk27_1: $i > $i ).
tff(decl_73,type,
esk28_1: $i > $i ).
tff(decl_74,type,
esk29_1: $i > $i ).
tff(decl_75,type,
esk30_1: $i > $i ).
tff(decl_76,type,
esk31_1: $i > $i ).
tff(decl_77,type,
esk32_1: $i > $i ).
tff(decl_78,type,
esk33_1: $i > $i ).
tff(decl_79,type,
esk34_1: $i > $i ).
tff(decl_80,type,
esk35_1: $i > $i ).
tff(decl_81,type,
esk36_1: $i > $i ).
tff(decl_82,type,
esk37_1: $i > $i ).
tff(decl_83,type,
esk38_1: $i > $i ).
tff(decl_84,type,
esk39_1: $i > $i ).
tff(decl_85,type,
esk40_1: $i > $i ).
tff(decl_86,type,
esk41_1: $i > $i ).
tff(decl_87,type,
esk42_1: $i > $i ).
tff(decl_88,type,
esk43_1: $i > $i ).
tff(decl_89,type,
esk44_1: $i > $i ).
tff(decl_90,type,
esk45_1: $i > $i ).
tff(decl_91,type,
esk46_1: $i > $i ).
tff(decl_92,type,
esk47_1: $i > $i ).
tff(decl_93,type,
esk48_0: $i ).
tff(decl_94,type,
esk49_0: $i ).
tff(decl_95,type,
esk50_0: $i ).
tff(decl_96,type,
esk51_0: $i ).
tff(decl_97,type,
esk52_0: $i ).
tff(decl_98,type,
esk53_0: $i ).
tff(decl_99,type,
esk54_0: $i ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 ) ) ) )
| neq(X1,nil) ) ) ) ) ),
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 ) ) ) )
| neq(X1,nil) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& ssList(esk53_0)
& app(esk52_0,esk53_0) = esk51_0
& ssItem(esk54_0)
& app(app(esk52_0,cons(esk54_0,nil)),esk53_0) = esk50_0
& ~ neq(esk48_0,nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X226,X227] :
( ( nil = X227
| nil != app(X226,X227)
| ~ ssList(X227)
| ~ ssList(X226) )
& ( nil = X226
| nil != app(X226,X227)
| ~ ssList(X227)
| ~ ssList(X226) )
& ( nil != X227
| nil != X226
| nil = app(X226,X227)
| ~ ssList(X227)
| ~ ssList(X226) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(esk52_0,cons(esk54_0,nil)),esk53_0) = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
app(app(esk52_0,cons(esk54_0,nil)),esk53_0) = esk48_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X131,X132] :
( ~ ssList(X131)
| ~ ssList(X132)
| ssList(app(X131,X132)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_17,negated_conjecture,
( esk53_0 = nil
| esk48_0 != nil
| ~ ssList(app(esk52_0,cons(esk54_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X112,X113] :
( ~ ssList(X112)
| ~ ssItem(X113)
| ssList(cons(X113,X112)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_21,plain,
! [X110,X111] :
( ( ~ neq(X110,X111)
| X110 != X111
| ~ ssList(X111)
| ~ ssList(X110) )
& ( X110 = X111
| neq(X110,X111)
| ~ ssList(X111)
| ~ ssList(X110) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_22,negated_conjecture,
( esk53_0 = nil
| esk48_0 != nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_25,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
~ neq(esk48_0,nil),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( esk53_0 = nil
| esk48_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( app(esk52_0,cons(esk54_0,nil)) = nil
| esk48_0 != nil
| ~ ssList(app(esk52_0,cons(esk54_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_15])]) ).
fof(c_0_33,plain,
! [X228] :
( ~ ssList(X228)
| app(X228,nil) = X228 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_34,negated_conjecture,
app(esk52_0,esk53_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
esk53_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
( app(esk52_0,cons(esk54_0,nil)) = nil
| esk48_0 != nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_18]),c_0_19])]) ).
cnf(c_0_37,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
app(esk52_0,nil) = esk51_0,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( app(esk52_0,cons(esk54_0,nil)) = nil
| esk48_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_40,negated_conjecture,
esk52_0 = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_43,negated_conjecture,
app(esk51_0,cons(esk54_0,nil)) = nil,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_31])]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_43]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_47,negated_conjecture,
app(nil,cons(esk54_0,nil)) = nil,
inference(rw,[status(thm)],[c_0_43,c_0_46]) ).
fof(c_0_48,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| cons(X115,X114) != X114 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk54_0,nil) = nil
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_47]),c_0_24])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
cons(esk54_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n003.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 : 300
% 0.12/0.33 % DateTime : Mon Aug 28 18:28:25 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.41/0.62 start to proof: theBenchmark
% 0.60/0.66 % Version : CSE_E---1.5
% 0.60/0.66 % Problem : theBenchmark.p
% 0.60/0.66 % Proof found
% 0.60/0.66 % SZS status Theorem for theBenchmark.p
% 0.60/0.66 % SZS output start Proof
% See solution above
% 0.60/0.67 % Total time : 0.038000 s
% 0.60/0.67 % SZS output end Proof
% 0.60/0.67 % Total time : 0.041000 s
%------------------------------------------------------------------------------