TSTP Solution File: SWC106+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC106+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 : n017.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:01:11 EDT 2023
% Result : Theorem 13.50s 4.09s
% Output : CNFRefutation 13.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 82
% Syntax : Number of formulae : 115 ( 20 unt; 77 typ; 0 def)
% Number of atoms : 86 ( 20 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 90 ( 42 ~; 31 |; 3 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 3 avg)
% Maximal term depth : 3 ( 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 : 58 ( 58 usr; 9 con; 0-2 aty)
% Number of variables : 19 (; 18 !; 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_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_53 > #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_53',type,
'#skF_53': $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_319,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_1018,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( ( ~ neq(V,nil)
| ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( ( cons(Y,nil) != W )
| ( app(Z,cons(Y,nil)) != X ) ) ) )
| ( neq(U,nil)
& rearsegP(V,U) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_364,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( nil != cons(V,U) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
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_120,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( rearsegP(U,V)
<=> ? [W] :
( ssList(W)
& ( app(W,V) = U ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_386,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_418,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_426,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_418]) ).
tff(c_404,plain,
( ssItem('#skF_52')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_432,plain,
ssItem('#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_404]) ).
tff(c_400,plain,
( ( cons('#skF_52',nil) = '#skF_50' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_430,plain,
cons('#skF_52',nil) = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_426,c_400]) ).
tff(c_965,plain,
! [V_1245,U_1246] :
( ( cons(V_1245,U_1246) != nil )
| ~ ssItem(V_1245)
| ~ ssList(U_1246) ),
inference(cnfTransformation,[status(thm)],[f_364]) ).
tff(c_967,plain,
( ( nil != '#skF_50' )
| ~ ssItem('#skF_52')
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_430,c_965]) ).
tff(c_969,plain,
nil != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_168,c_432,c_967]) ).
tff(c_390,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_1806,plain,
! [U_1263,V_1264] :
( neq(U_1263,V_1264)
| ( V_1264 = U_1263 )
| ~ ssList(V_1264)
| ~ ssList(U_1263) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_384,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_396,plain,
( ~ rearsegP('#skF_49','#skF_48')
| ~ neq('#skF_48',nil)
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_427,plain,
( ~ rearsegP('#skF_51','#skF_48')
| ~ neq('#skF_48',nil)
| ~ neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_396]) ).
tff(c_438,plain,
( ~ rearsegP('#skF_51','#skF_48')
| ~ neq('#skF_48',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_427]) ).
tff(c_441,plain,
( ~ rearsegP('#skF_51','#skF_50')
| ~ neq('#skF_50',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_384,c_438]) ).
tff(c_467,plain,
~ neq('#skF_50',nil),
inference(splitLeft,[status(thm)],[c_441]) ).
tff(c_1817,plain,
( ( nil = '#skF_50' )
| ~ ssList(nil)
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_1806,c_467]) ).
tff(c_1824,plain,
nil = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_390,c_168,c_1817]) ).
tff(c_1826,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_969,c_1824]) ).
tff(c_1827,plain,
~ rearsegP('#skF_51','#skF_50'),
inference(splitRight,[status(thm)],[c_441]) ).
tff(c_388,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_398,plain,
( ( app('#skF_53',cons('#skF_52',nil)) = '#skF_51' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_434,plain,
app('#skF_53',cons('#skF_52',nil)) = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_426,c_398]) ).
tff(c_439,plain,
app('#skF_53','#skF_50') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_430,c_434]) ).
tff(c_402,plain,
( ssList('#skF_53')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_436,plain,
ssList('#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_402]) ).
tff(c_9587,plain,
! [W_1549,V_1550] :
( rearsegP(app(W_1549,V_1550),V_1550)
| ~ ssList(W_1549)
| ~ ssList(V_1550)
| ~ ssList(app(W_1549,V_1550)) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_9775,plain,
( rearsegP('#skF_51','#skF_50')
| ~ ssList('#skF_53')
| ~ ssList('#skF_50')
| ~ ssList(app('#skF_53','#skF_50')) ),
inference(superposition,[status(thm),theory(equality)],[c_439,c_9587]) ).
tff(c_9898,plain,
rearsegP('#skF_51','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_439,c_390,c_436,c_9775]) ).
tff(c_9900,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1827,c_9898]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC106+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.17/0.35 % Computer : n017.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 20:47:21 EDT 2023
% 0.17/0.35 % CPUTime :
% 13.50/4.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.50/4.10
% 13.50/4.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.61/4.13
% 13.61/4.13 Inference rules
% 13.61/4.13 ----------------------
% 13.61/4.13 #Ref : 0
% 13.61/4.13 #Sup : 2070
% 13.61/4.13 #Fact : 0
% 13.61/4.13 #Define : 0
% 13.61/4.13 #Split : 43
% 13.61/4.13 #Chain : 0
% 13.61/4.13 #Close : 0
% 13.61/4.13
% 13.61/4.13 Ordering : KBO
% 13.61/4.13
% 13.61/4.13 Simplification rules
% 13.61/4.13 ----------------------
% 13.61/4.13 #Subsume : 239
% 13.61/4.13 #Demod : 1677
% 13.61/4.13 #Tautology : 828
% 13.61/4.13 #SimpNegUnit : 174
% 13.61/4.13 #BackRed : 326
% 13.61/4.13
% 13.61/4.13 #Partial instantiations: 0
% 13.61/4.13 #Strategies tried : 1
% 13.61/4.13
% 13.61/4.13 Timing (in seconds)
% 13.61/4.13 ----------------------
% 13.61/4.14 Preprocessing : 0.88
% 13.61/4.14 Parsing : 0.41
% 13.61/4.14 CNF conversion : 0.11
% 13.61/4.14 Main loop : 2.13
% 13.61/4.14 Inferencing : 0.72
% 13.61/4.14 Reduction : 0.74
% 13.61/4.14 Demodulation : 0.52
% 13.61/4.14 BG Simplification : 0.09
% 13.61/4.14 Subsumption : 0.40
% 13.61/4.14 Abstraction : 0.07
% 13.61/4.14 MUC search : 0.00
% 13.61/4.14 Cooper : 0.00
% 13.61/4.14 Total : 3.07
% 13.61/4.14 Index Insertion : 0.00
% 13.61/4.14 Index Deletion : 0.00
% 13.61/4.14 Index Matching : 0.00
% 13.61/4.14 BG Taut test : 0.00
%------------------------------------------------------------------------------