TSTP Solution File: SWC364+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC364+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n002.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:02:19 EDT 2023
% Result : Theorem 20.77s 7.68s
% Output : CNFRefutation 20.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 85
% Syntax : Number of formulae : 127 ( 24 unt; 76 typ; 0 def)
% Number of atoms : 117 ( 35 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 113 ( 47 ~; 40 |; 5 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 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 : 57 ( 57 usr; 8 con; 0-2 aty)
% Number of variables : 33 (; 29 !; 4 ?; 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_52 > #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_52',type,
'#skF_52': $i ).
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_1010,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( ( ~ neq(V,nil)
| ! [Y] :
( ssItem(Y)
=> ( app(cons(Y,nil),W) != X ) )
| segmentP(V,U) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_859,axiom,
! [U] :
( ssList(U)
=> ( app(U,nil) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_318,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ssList(cons(V,U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
tff(f_779,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssList(V)
& ( tl(U) = V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax76) ).
tff(f_311,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> ( U != V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
tff(f_769,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssItem(V)
& ( hd(U) = V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax75) ).
tff(f_869,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( nil != U )
=> ( hd(app(U,V)) = hd(U) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
tff(f_135,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& ( app(app(W,V),X) = U ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
tff(c_384,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_386,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_410,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_416,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_410]) ).
tff(c_396,plain,
( ~ segmentP('#skF_49','#skF_48')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_417,plain,
( ~ segmentP('#skF_51','#skF_48')
| ~ neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_396]) ).
tff(c_424,plain,
~ segmentP('#skF_51','#skF_48'),
inference(demodulation,[status(thm),theory(equality)],[c_416,c_417]) ).
tff(c_426,plain,
~ segmentP('#skF_51','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_424]) ).
tff(c_388,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_453,plain,
! [U_1161] :
( ( app(U_1161,nil) = U_1161 )
| ~ ssList(U_1161) ),
inference(cnfTransformation,[status(thm)],[f_859]) ).
tff(c_465,plain,
app('#skF_51',nil) = '#skF_51',
inference(resolution,[status(thm)],[c_388,c_453]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_398,plain,
( ( app(cons('#skF_52',nil),'#skF_50') = '#skF_51' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_420,plain,
app(cons('#skF_52',nil),'#skF_50') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_416,c_398]) ).
tff(c_390,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_400,plain,
( ssItem('#skF_52')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_422,plain,
ssItem('#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_416,c_400]) ).
tff(c_166,plain,
! [V_861,U_859] :
( ssList(cons(V_861,U_859))
| ~ ssItem(V_861)
| ~ ssList(U_859) ),
inference(cnfTransformation,[status(thm)],[f_318]) ).
tff(c_782,plain,
! [U_1213] :
( ( tl(U_1213) = '#skF_47'(U_1213) )
| ( nil = U_1213 )
| ~ ssList(U_1213) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_887,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_782]) ).
tff(c_1280,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_887]) ).
tff(c_1312,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_1280,c_416]) ).
tff(c_164,plain,
! [V_858] :
( ~ neq(V_858,V_858)
| ~ ssList(V_858) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_1330,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_1312,c_164]) ).
tff(c_1337,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_1330]) ).
tff(c_1339,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_887]) ).
tff(c_1703,plain,
! [U_1231] :
( ( hd(U_1231) = '#skF_46'(U_1231) )
| ( nil = U_1231 )
| ~ ssList(U_1231) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_1793,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_1703]) ).
tff(c_1828,plain,
hd('#skF_51') = '#skF_46'('#skF_51'),
inference(negUnitSimplification,[status(thm)],[c_1339,c_1793]) ).
tff(c_12594,plain,
! [U_1660,V_1661] :
( ( hd(app(U_1660,V_1661)) = hd(U_1660) )
| ( nil = U_1660 )
| ~ ssList(V_1661)
| ~ ssList(U_1660) ),
inference(cnfTransformation,[status(thm)],[f_869]) ).
tff(c_12726,plain,
( ( hd(cons('#skF_52',nil)) = hd('#skF_51') )
| ( cons('#skF_52',nil) = nil )
| ~ ssList('#skF_50')
| ~ ssList(cons('#skF_52',nil)) ),
inference(superposition,[status(thm),theory(equality)],[c_420,c_12594]) ).
tff(c_12847,plain,
( ( hd(cons('#skF_52',nil)) = '#skF_46'('#skF_51') )
| ( cons('#skF_52',nil) = nil )
| ~ ssList(cons('#skF_52',nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_1828,c_12726]) ).
tff(c_12935,plain,
~ ssList(cons('#skF_52',nil)),
inference(splitLeft,[status(thm)],[c_12847]) ).
tff(c_12938,plain,
( ~ ssItem('#skF_52')
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_166,c_12935]) ).
tff(c_12942,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_168,c_422,c_12938]) ).
tff(c_12944,plain,
ssList(cons('#skF_52',nil)),
inference(splitRight,[status(thm)],[c_12847]) ).
tff(c_29138,plain,
! [W_2068,V_2069,X_2070] :
( segmentP(app(app(W_2068,V_2069),X_2070),V_2069)
| ~ ssList(X_2070)
| ~ ssList(W_2068)
| ~ ssList(V_2069)
| ~ ssList(app(app(W_2068,V_2069),X_2070)) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_29422,plain,
! [X_2070] :
( segmentP(app('#skF_51',X_2070),'#skF_50')
| ~ ssList(X_2070)
| ~ ssList(cons('#skF_52',nil))
| ~ ssList('#skF_50')
| ~ ssList(app(app(cons('#skF_52',nil),'#skF_50'),X_2070)) ),
inference(superposition,[status(thm),theory(equality)],[c_420,c_29138]) ).
tff(c_31656,plain,
! [X_2112] :
( segmentP(app('#skF_51',X_2112),'#skF_50')
| ~ ssList(X_2112)
| ~ ssList(app('#skF_51',X_2112)) ),
inference(demodulation,[status(thm),theory(equality)],[c_420,c_390,c_12944,c_29422]) ).
tff(c_31670,plain,
( segmentP('#skF_51','#skF_50')
| ~ ssList(nil)
| ~ ssList(app('#skF_51',nil)) ),
inference(superposition,[status(thm),theory(equality)],[c_465,c_31656]) ).
tff(c_31680,plain,
segmentP('#skF_51','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_465,c_168,c_31670]) ).
tff(c_31682,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_426,c_31680]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC364+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 21:47:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 20.77/7.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.77/7.69
% 20.77/7.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 20.77/7.72
% 20.77/7.72 Inference rules
% 20.77/7.72 ----------------------
% 20.77/7.72 #Ref : 5
% 20.77/7.72 #Sup : 6856
% 20.77/7.72 #Fact : 0
% 20.77/7.72 #Define : 0
% 20.77/7.72 #Split : 49
% 20.77/7.72 #Chain : 0
% 20.77/7.72 #Close : 0
% 20.77/7.72
% 20.77/7.72 Ordering : KBO
% 20.77/7.72
% 20.77/7.72 Simplification rules
% 20.77/7.72 ----------------------
% 20.77/7.72 #Subsume : 1006
% 20.77/7.72 #Demod : 5725
% 20.77/7.72 #Tautology : 2206
% 20.77/7.72 #SimpNegUnit : 618
% 20.77/7.72 #BackRed : 292
% 20.77/7.72
% 20.77/7.72 #Partial instantiations: 0
% 20.77/7.72 #Strategies tried : 1
% 20.77/7.72
% 20.77/7.72 Timing (in seconds)
% 20.77/7.72 ----------------------
% 20.77/7.72 Preprocessing : 0.86
% 20.77/7.72 Parsing : 0.40
% 20.77/7.72 CNF conversion : 0.10
% 20.77/7.72 Main loop : 5.77
% 20.77/7.72 Inferencing : 1.51
% 20.77/7.72 Reduction : 2.22
% 20.77/7.72 Demodulation : 1.59
% 20.77/7.72 BG Simplification : 0.12
% 20.77/7.72 Subsumption : 1.51
% 20.77/7.72 Abstraction : 0.11
% 20.77/7.72 MUC search : 0.00
% 20.77/7.72 Cooper : 0.00
% 20.77/7.72 Total : 6.69
% 20.77/7.72 Index Insertion : 0.00
% 20.77/7.72 Index Deletion : 0.00
% 20.77/7.72 Index Matching : 0.00
% 20.77/7.72 BG Taut test : 0.00
%------------------------------------------------------------------------------