TSTP Solution File: SWC346+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC346+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 : n029.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:21:49 EDT 2023
% Result : Theorem 0.56s 0.61s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 86
% Syntax : Number of formulae : 124 ( 17 unt; 78 typ; 0 def)
% Number of atoms : 201 ( 61 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 237 ( 82 ~; 96 |; 41 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 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 : 48 ( 0 sgn; 29 !; 7 ?; 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] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax69) ).
fof(c_0_8,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)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& strictorderedP(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,negated_conjecture,
! [X261,X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( nil = esk51_0
| ssItem(esk52_0) )
& ( nil = esk50_0
| ssItem(esk52_0) )
& ( nil = esk51_0
| ssList(esk53_0) )
& ( nil = esk50_0
| ssList(esk53_0) )
& ( nil = esk51_0
| ssList(esk54_0) )
& ( nil = esk50_0
| ssList(esk54_0) )
& ( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk51_0
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 )
& ( nil = esk50_0
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 )
& ( nil = esk51_0
| ~ ssItem(X261)
| ~ memberP(esk53_0,X261)
| ~ lt(esk52_0,X261) )
& ( nil = esk50_0
| ~ ssItem(X261)
| ~ memberP(esk53_0,X261)
| ~ lt(esk52_0,X261) )
& ( nil = esk51_0
| ~ ssItem(X262)
| ~ memberP(esk54_0,X262)
| ~ lt(X262,esk52_0) )
& ( nil = esk50_0
| ~ ssItem(X262)
| ~ memberP(esk54_0,X262)
| ~ lt(X262,esk52_0) )
& ( ~ segmentP(esk49_0,esk48_0)
| ~ strictorderedP(esk48_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_10,plain,
! [X205] :
( ~ ssItem(X205)
| strictorderedP(cons(X205,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])]) ).
fof(c_0_11,plain,
! [X20,X22] :
( ( ssItem(esk5_1(X20))
| ~ singletonP(X20)
| ~ ssList(X20) )
& ( cons(esk5_1(X20),nil) = X20
| ~ singletonP(X20)
| ~ ssList(X20) )
& ( ~ ssItem(X22)
| cons(X22,nil) != X20
| singletonP(X20)
| ~ ssList(X20) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
fof(c_0_12,plain,
! [X31,X32,X35,X36] :
( ( ssList(esk8_2(X31,X32))
| ~ segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) )
& ( ssList(esk9_2(X31,X32))
| ~ segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) )
& ( app(app(esk8_2(X31,X32),X32),esk9_2(X31,X32)) = X31
| ~ segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) )
& ( ~ ssList(X35)
| ~ ssList(X36)
| app(app(X35,X32),X36) != X31
| segmentP(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| ~ strictorderedP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( nil = esk50_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ strictorderedP(esk50_0)
| ~ segmentP(esk51_0,esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( esk50_0 = nil
| strictorderedP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_25,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk50_0
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( nil = esk50_0
| ssList(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk50_0
| ssList(esk54_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( esk50_0 = nil
| ~ segmentP(esk51_0,esk50_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_35,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[ax39]) ).
fof(c_0_36,plain,
! [X198] :
( ( ~ segmentP(nil,X198)
| nil = X198
| ~ ssList(X198) )
& ( nil != X198
| segmentP(nil,X198)
| ~ ssList(X198) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_37,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_38,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_27])]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_39,plain,
~ singletonP(nil),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_42,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
cnf(c_0_43,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_38]),c_0_42]),c_0_38])]),c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC346+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 15:45:56 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.55 start to proof: theBenchmark
% 0.56/0.61 % Version : CSE_E---1.5
% 0.56/0.61 % Problem : theBenchmark.p
% 0.56/0.61 % Proof found
% 0.56/0.61 % SZS status Theorem for theBenchmark.p
% 0.56/0.61 % SZS output start Proof
% See solution above
% 0.56/0.61 % Total time : 0.053000 s
% 0.56/0.61 % SZS output end Proof
% 0.56/0.61 % Total time : 0.058000 s
%------------------------------------------------------------------------------