TSTP Solution File: SWC384+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC384+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 : n007.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:25 EDT 2023
% Result : Theorem 80.22s 63.55s
% Output : CNFRefutation 80.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 84
% Syntax : Number of formulae : 143 ( 37 unt; 78 typ; 0 def)
% Number of atoms : 134 ( 35 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 121 ( 52 ~; 42 |; 7 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 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 : 59 ( 59 usr; 10 con; 0-2 aty)
% Number of variables : 32 (; 29 !; 3 ?; 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_54 > #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_54',type,
'#skF_54': $i ).
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_1036,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)
=> ! [X1] :
( ssList(X1)
=> ( ( cons(Y,nil) != W )
| ( app(app(Z,W),X1) != X )
| ? [X2] :
( ssItem(X2)
& memberP(Z,X2)
& lt(Y,X2) )
| ? [X3] :
( ssItem(X3)
& memberP(X1,X3)
& lt(X3,Y) ) ) ) ) )
& ( ( nil != X )
| ( nil != W ) ) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
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_327,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( cons(V,U) != U ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
tff(f_682,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( segmentP(U,V)
=> segmentP(app(app(W,U),X),V) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
tff(f_96,axiom,
! [U] :
( ssList(U)
=> ( singletonP(U)
<=> ? [V] :
( ssItem(V)
& ( cons(V,nil) = U ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
tff(c_394,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_270,plain,
! [U_1014] :
( segmentP(U_1014,U_1014)
| ~ ssList(U_1014) ),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_392,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_422,plain,
( ssList('#skF_54')
| ( nil = '#skF_51' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_947,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_422]) ).
tff(c_390,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_386,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_431,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_386]) ).
tff(c_949,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_947,c_431]) ).
tff(c_971,plain,
! [V_1570] :
( ~ neq(V_1570,V_1570)
| ~ ssList(V_1570) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_974,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_949,c_971]) ).
tff(c_978,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_392,c_974]) ).
tff(c_980,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_422]) ).
tff(c_424,plain,
( ssList('#skF_53')
| ( nil = '#skF_51' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_983,plain,
ssList('#skF_53'),
inference(negUnitSimplification,[status(thm)],[c_980,c_424]) ).
tff(c_979,plain,
ssList('#skF_54'),
inference(splitRight,[status(thm)],[c_422]) ).
tff(c_412,plain,
( ssItem('#skF_52')
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_441,plain,
nil = '#skF_50',
inference(splitLeft,[status(thm)],[c_412]) ).
tff(c_426,plain,
( ssItem('#skF_52')
| ( nil = '#skF_51' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_457,plain,
( ssItem('#skF_52')
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_441,c_426]) ).
tff(c_458,plain,
'#skF_51' = '#skF_50',
inference(splitLeft,[status(thm)],[c_457]) ).
tff(c_442,plain,
neq('#skF_51','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_441,c_431]) ).
tff(c_471,plain,
neq('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_458,c_442]) ).
tff(c_477,plain,
! [V_1499] :
( ~ neq(V_1499,V_1499)
| ~ ssList(V_1499) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_480,plain,
~ ssList('#skF_50'),
inference(resolution,[status(thm)],[c_471,c_477]) ).
tff(c_484,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_394,c_480]) ).
tff(c_485,plain,
ssItem('#skF_52'),
inference(splitRight,[status(thm)],[c_457]) ).
tff(c_486,plain,
'#skF_51' != '#skF_50',
inference(splitRight,[status(thm)],[c_457]) ).
tff(c_487,plain,
( ssList('#skF_53')
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_441,c_424]) ).
tff(c_488,plain,
'#skF_51' = '#skF_50',
inference(splitLeft,[status(thm)],[c_487]) ).
tff(c_489,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_486,c_488]) ).
tff(c_491,plain,
'#skF_51' != '#skF_50',
inference(splitRight,[status(thm)],[c_487]) ).
tff(c_420,plain,
( ( cons('#skF_52',nil) = '#skF_50' )
| ( nil = '#skF_51' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_507,plain,
( ( cons('#skF_52','#skF_50') = '#skF_50' )
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_441,c_441,c_420]) ).
tff(c_508,plain,
cons('#skF_52','#skF_50') = '#skF_50',
inference(negUnitSimplification,[status(thm)],[c_491,c_507]) ).
tff(c_938,plain,
! [V_1567,U_1568] :
( ( cons(V_1567,U_1568) != U_1568 )
| ~ ssItem(V_1567)
| ~ ssList(U_1568) ),
inference(cnfTransformation,[status(thm)],[f_327]) ).
tff(c_940,plain,
( ~ ssItem('#skF_52')
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_508,c_938]) ).
tff(c_944,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_394,c_485,c_940]) ).
tff(c_946,plain,
nil != '#skF_50',
inference(splitRight,[status(thm)],[c_412]) ).
tff(c_404,plain,
( ( app(app('#skF_53','#skF_50'),'#skF_54') = '#skF_51' )
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_9784,plain,
app(app('#skF_53','#skF_50'),'#skF_54') = '#skF_51',
inference(negUnitSimplification,[status(thm)],[c_946,c_404]) ).
tff(c_214738,plain,
! [W_5409,U_5410,X_5411,V_5412] :
( segmentP(app(app(W_5409,U_5410),X_5411),V_5412)
| ~ segmentP(U_5410,V_5412)
| ~ ssList(X_5411)
| ~ ssList(W_5409)
| ~ ssList(V_5412)
| ~ ssList(U_5410) ),
inference(cnfTransformation,[status(thm)],[f_682]) ).
tff(c_214983,plain,
! [V_5412] :
( segmentP('#skF_51',V_5412)
| ~ segmentP('#skF_50',V_5412)
| ~ ssList('#skF_54')
| ~ ssList('#skF_53')
| ~ ssList(V_5412)
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_9784,c_214738]) ).
tff(c_215145,plain,
! [V_5413] :
( segmentP('#skF_51',V_5413)
| ~ segmentP('#skF_50',V_5413)
| ~ ssList(V_5413) ),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_983,c_979,c_214983]) ).
tff(c_388,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_384,plain,
( ~ segmentP('#skF_49','#skF_48')
| ~ singletonP('#skF_48') ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_432,plain,
( ~ segmentP('#skF_51','#skF_50')
| ~ singletonP('#skF_50') ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_388,c_390,c_384]) ).
tff(c_1002,plain,
~ singletonP('#skF_50'),
inference(splitLeft,[status(thm)],[c_432]) ).
tff(c_945,plain,
ssItem('#skF_52'),
inference(splitRight,[status(thm)],[c_412]) ).
tff(c_997,plain,
cons('#skF_52',nil) = '#skF_50',
inference(negUnitSimplification,[status(thm)],[c_980,c_420]) ).
tff(c_9718,plain,
! [V_1925] :
( singletonP(cons(V_1925,nil))
| ~ ssItem(V_1925)
| ~ ssList(cons(V_1925,nil)) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_9728,plain,
( singletonP(cons('#skF_52',nil))
| ~ ssItem('#skF_52')
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_997,c_9718]) ).
tff(c_9733,plain,
singletonP('#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_945,c_997,c_9728]) ).
tff(c_9735,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1002,c_9733]) ).
tff(c_9736,plain,
~ segmentP('#skF_51','#skF_50'),
inference(splitRight,[status(thm)],[c_432]) ).
tff(c_215152,plain,
( ~ segmentP('#skF_50','#skF_50')
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_215145,c_9736]) ).
tff(c_215161,plain,
~ segmentP('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_215152]) ).
tff(c_215164,plain,
~ ssList('#skF_50'),
inference(resolution,[status(thm)],[c_270,c_215161]) ).
tff(c_215168,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_394,c_215164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC384+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 : n007.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 21:27:09 EDT 2023
% 0.17/0.35 % CPUTime :
% 80.22/63.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 80.22/63.56
% 80.22/63.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 80.22/63.59
% 80.22/63.59 Inference rules
% 80.22/63.59 ----------------------
% 80.22/63.59 #Ref : 33
% 80.22/63.59 #Sup : 46827
% 80.22/63.59 #Fact : 0
% 80.22/63.59 #Define : 0
% 80.22/63.59 #Split : 335
% 80.22/63.59 #Chain : 0
% 80.22/63.59 #Close : 0
% 80.22/63.59
% 80.22/63.59 Ordering : KBO
% 80.22/63.59
% 80.22/63.59 Simplification rules
% 80.22/63.59 ----------------------
% 80.22/63.59 #Subsume : 7405
% 80.22/63.59 #Demod : 44257
% 80.22/63.59 #Tautology : 10406
% 80.22/63.59 #SimpNegUnit : 5286
% 80.22/63.59 #BackRed : 878
% 80.22/63.59
% 80.22/63.59 #Partial instantiations: 0
% 80.22/63.59 #Strategies tried : 1
% 80.22/63.59
% 80.22/63.59 Timing (in seconds)
% 80.22/63.59 ----------------------
% 80.46/63.59 Preprocessing : 0.99
% 80.46/63.59 Parsing : 0.47
% 80.46/63.60 CNF conversion : 0.12
% 80.46/63.60 Main loop : 61.45
% 80.46/63.60 Inferencing : 9.69
% 80.46/63.60 Reduction : 30.60
% 80.46/63.60 Demodulation : 22.16
% 80.46/63.60 BG Simplification : 0.33
% 80.46/63.60 Subsumption : 15.92
% 80.46/63.60 Abstraction : 0.54
% 80.46/63.60 MUC search : 0.00
% 80.46/63.60 Cooper : 0.00
% 80.46/63.60 Total : 62.50
% 80.46/63.60 Index Insertion : 0.00
% 80.46/63.60 Index Deletion : 0.00
% 80.46/63.60 Index Matching : 0.00
% 80.46/63.60 BG Taut test : 0.00
%------------------------------------------------------------------------------