TSTP Solution File: SWC060+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC060+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n005.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 Aug 22 11:00:59 EDT 2023
% Result : Theorem 6.96s 2.59s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 79
% Syntax : Number of formulae : 135 ( 34 unt; 75 typ; 0 def)
% Number of atoms : 118 ( 36 equ)
% Maximal formula atoms : 17 ( 1 avg)
% Number of connectives : 111 ( 53 ~; 44 |; 5 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 3 avg)
% Maximal term depth : 1 ( 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 : 56 ( 56 usr; 7 con; 0-2 aty)
% Number of variables : 17 (; 16 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > cons > app > #nlpp > tl > hd > nil > #skF_36 > #skF_25 > #skF_5 > #skF_44 > #skF_21 > #skF_16 > #skF_6 > #skF_49 > #skF_18 > #skF_24 > #skF_35 > #skF_19 > #skF_31 > #skF_22 > #skF_37 > #skF_40 > #skF_48 > #skF_3 > #skF_34 > #skF_29 > #skF_15 > #skF_32 > #skF_51 > #skF_28 > #skF_10 > #skF_41 > #skF_2 > #skF_38 > #skF_43 > #skF_1 > #skF_8 > #skF_39 > #skF_23 > #skF_33 > #skF_26 > #skF_50 > #skF_13 > #skF_17 > #skF_11 > #skF_14 > #skF_27 > #skF_12 > #skF_7 > #skF_46 > #skF_42 > #skF_45 > #skF_9 > #skF_30 > #skF_4 > #skF_20 > #skF_47
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_36',type,
'#skF_36': $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff('#skF_44',type,
'#skF_44': $i > $i ).
tff('#skF_21',type,
'#skF_21': $i > $i ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_35',type,
'#skF_35': $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff('#skF_40',type,
'#skF_40': $i > $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff('#skF_51',type,
'#skF_51': $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_41',type,
'#skF_41': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_38',type,
'#skF_38': $i > $i ).
tff('#skF_43',type,
'#skF_43': $i > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': $i > $i ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_50',type,
'#skF_50': $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $i > $i ).
tff(nil,type,
nil: $i ).
tff('#skF_42',type,
'#skF_42': $i > $i ).
tff('#skF_45',type,
'#skF_45': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff('#skF_47',type,
'#skF_47': $i > $i ).
tff(f_1024,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| ( V != X )
| ( U != W )
| ( ( ( nil != V )
| ( nil = U ) )
& ( ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(V,Y)
& segmentP(U,Y) ) ) )
| ( ( ( nil != X )
| ( nil != W ) )
& ( ~ neq(W,nil)
| ~ segmentP(X,W) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_667,axiom,
! [U] :
( ssList(U)
=> segmentP(U,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
tff(f_311,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> ( U != V ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
tff(f_692,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> ( nil = U ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
tff(c_390,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_270,plain,
! [U_1014] :
( segmentP(U_1014,U_1014)
| ~ ssList(U_1014) ),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_388,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_400,plain,
( ( nil = '#skF_50' )
| neq('#skF_50',nil) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_433,plain,
neq('#skF_50',nil),
inference(splitLeft,[status(thm)],[c_400]) ).
tff(c_398,plain,
( ( nil = '#skF_51' )
| segmentP('#skF_51','#skF_50') ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_434,plain,
segmentP('#skF_51','#skF_50'),
inference(splitLeft,[status(thm)],[c_398]) ).
tff(c_384,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_386,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_406,plain,
! [Y_1148] :
( ( nil = '#skF_49' )
| ~ segmentP('#skF_48',Y_1148)
| ~ segmentP('#skF_49',Y_1148)
| ~ neq(Y_1148,nil)
| ~ ssList(Y_1148) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_415,plain,
! [Y_1148] :
( ( nil = '#skF_51' )
| ~ segmentP('#skF_48',Y_1148)
| ~ segmentP('#skF_51',Y_1148)
| ~ neq(Y_1148,nil)
| ~ ssList(Y_1148) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_386,c_406]) ).
tff(c_420,plain,
! [Y_1148] :
( ( nil = '#skF_51' )
| ~ segmentP('#skF_50',Y_1148)
| ~ segmentP('#skF_51',Y_1148)
| ~ neq(Y_1148,nil)
| ~ ssList(Y_1148) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_415]) ).
tff(c_591,plain,
! [Y_1185] :
( ~ segmentP('#skF_50',Y_1185)
| ~ segmentP('#skF_51',Y_1185)
| ~ neq(Y_1185,nil)
| ~ ssList(Y_1185) ),
inference(splitLeft,[status(thm)],[c_420]) ).
tff(c_598,plain,
( ~ segmentP('#skF_50','#skF_50')
| ~ neq('#skF_50',nil)
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_434,c_591]) ).
tff(c_608,plain,
~ segmentP('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_433,c_598]) ).
tff(c_614,plain,
~ ssList('#skF_50'),
inference(resolution,[status(thm)],[c_270,c_608]) ).
tff(c_618,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_390,c_614]) ).
tff(c_619,plain,
nil = '#skF_51',
inference(splitRight,[status(thm)],[c_420]) ).
tff(c_410,plain,
( ( nil = '#skF_49' )
| neq('#skF_49',nil) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_414,plain,
( ( nil = '#skF_51' )
| neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_386,c_410]) ).
tff(c_442,plain,
neq('#skF_51',nil),
inference(splitLeft,[status(thm)],[c_414]) ).
tff(c_623,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_619,c_442]) ).
tff(c_164,plain,
! [V_858] :
( ~ neq(V_858,V_858)
| ~ ssList(V_858) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_647,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_623,c_164]) ).
tff(c_652,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_647]) ).
tff(c_653,plain,
nil = '#skF_51',
inference(splitRight,[status(thm)],[c_414]) ).
tff(c_654,plain,
~ neq('#skF_51',nil),
inference(splitRight,[status(thm)],[c_414]) ).
tff(c_673,plain,
~ neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_653,c_654]) ).
tff(c_408,plain,
( ( nil != '#skF_48' )
| neq('#skF_49',nil) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_412,plain,
( ( nil != '#skF_48' )
| neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_408]) ).
tff(c_418,plain,
( ( nil != '#skF_50' )
| neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_412]) ).
tff(c_676,plain,
( ( '#skF_51' != '#skF_50' )
| neq('#skF_51','#skF_51') ),
inference(demodulation,[status(thm),theory(equality)],[c_653,c_653,c_418]) ).
tff(c_677,plain,
'#skF_51' != '#skF_50',
inference(negUnitSimplification,[status(thm)],[c_673,c_676]) ).
tff(c_278,plain,
! [U_1031] :
( ( nil = U_1031 )
| ~ segmentP(nil,U_1031)
| ~ ssList(U_1031) ),
inference(cnfTransformation,[status(thm)],[f_692]) ).
tff(c_902,plain,
! [U_1227] :
( ( U_1227 = '#skF_51' )
| ~ segmentP('#skF_51',U_1227)
| ~ ssList(U_1227) ),
inference(demodulation,[status(thm),theory(equality)],[c_653,c_653,c_278]) ).
tff(c_909,plain,
( ( '#skF_51' = '#skF_50' )
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_434,c_902]) ).
tff(c_920,plain,
'#skF_51' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_390,c_909]) ).
tff(c_922,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_677,c_920]) ).
tff(c_924,plain,
~ segmentP('#skF_51','#skF_50'),
inference(splitRight,[status(thm)],[c_398]) ).
tff(c_923,plain,
nil = '#skF_51',
inference(splitRight,[status(thm)],[c_398]) ).
tff(c_396,plain,
( ( nil = '#skF_50' )
| segmentP('#skF_51','#skF_50') ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_941,plain,
( ( '#skF_51' = '#skF_50' )
| segmentP('#skF_51','#skF_50') ),
inference(demodulation,[status(thm),theory(equality)],[c_923,c_396]) ).
tff(c_942,plain,
segmentP('#skF_51','#skF_50'),
inference(splitLeft,[status(thm)],[c_941]) ).
tff(c_943,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_924,c_942]) ).
tff(c_944,plain,
'#skF_51' = '#skF_50',
inference(splitRight,[status(thm)],[c_941]) ).
tff(c_973,plain,
~ segmentP('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_944,c_924]) ).
tff(c_976,plain,
~ ssList('#skF_50'),
inference(resolution,[status(thm)],[c_270,c_973]) ).
tff(c_980,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_390,c_976]) ).
tff(c_981,plain,
nil = '#skF_50',
inference(splitRight,[status(thm)],[c_400]) ).
tff(c_982,plain,
~ neq('#skF_50',nil),
inference(splitRight,[status(thm)],[c_400]) ).
tff(c_1000,plain,
~ neq('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_981,c_982]) ).
tff(c_402,plain,
( ( nil = '#skF_51' )
| neq('#skF_50',nil) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_1002,plain,
( ( '#skF_51' = '#skF_50' )
| neq('#skF_50','#skF_50') ),
inference(demodulation,[status(thm),theory(equality)],[c_981,c_981,c_402]) ).
tff(c_1003,plain,
'#skF_51' = '#skF_50',
inference(negUnitSimplification,[status(thm)],[c_1000,c_1002]) ).
tff(c_1019,plain,
neq('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_1003,c_981,c_981,c_418]) ).
tff(c_1020,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1000,c_1019]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC060+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 21:42:27 EDT 2023
% 0.14/0.35 % CPUTime :
% 6.96/2.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.96/2.60
% 6.96/2.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.32/2.63
% 7.32/2.63 Inference rules
% 7.32/2.63 ----------------------
% 7.32/2.63 #Ref : 0
% 7.32/2.63 #Sup : 106
% 7.32/2.63 #Fact : 0
% 7.32/2.63 #Define : 0
% 7.32/2.63 #Split : 8
% 7.32/2.63 #Chain : 0
% 7.32/2.63 #Close : 0
% 7.32/2.63
% 7.32/2.63 Ordering : KBO
% 7.32/2.63
% 7.32/2.63 Simplification rules
% 7.32/2.63 ----------------------
% 7.32/2.63 #Subsume : 9
% 7.32/2.63 #Demod : 143
% 7.32/2.63 #Tautology : 59
% 7.32/2.63 #SimpNegUnit : 5
% 7.32/2.63 #BackRed : 64
% 7.32/2.63
% 7.32/2.63 #Partial instantiations: 0
% 7.32/2.63 #Strategies tried : 1
% 7.32/2.63
% 7.32/2.63 Timing (in seconds)
% 7.32/2.63 ----------------------
% 7.32/2.63 Preprocessing : 0.94
% 7.32/2.63 Parsing : 0.47
% 7.32/2.63 CNF conversion : 0.10
% 7.32/2.63 Main loop : 0.58
% 7.32/2.63 Inferencing : 0.14
% 7.32/2.63 Reduction : 0.20
% 7.32/2.63 Demodulation : 0.14
% 7.32/2.63 BG Simplification : 0.06
% 7.32/2.63 Subsumption : 0.12
% 7.32/2.63 Abstraction : 0.02
% 7.32/2.63 MUC search : 0.00
% 7.32/2.63 Cooper : 0.00
% 7.32/2.63 Total : 1.57
% 7.32/2.63 Index Insertion : 0.00
% 7.32/2.63 Index Deletion : 0.00
% 7.32/2.63 Index Matching : 0.00
% 7.32/2.63 BG Taut test : 0.00
%------------------------------------------------------------------------------