TSTP Solution File: SWC279+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC279+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:01:55 EDT 2023
% Result : Theorem 7.60s 2.67s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 80
% Syntax : Number of formulae : 125 ( 25 unt; 79 typ; 0 def)
% Number of atoms : 137 ( 19 equ)
% Maximal formula atoms : 24 ( 2 avg)
% Number of connectives : 170 ( 79 ~; 75 |; 8 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 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 : 60 ( 60 usr; 11 con; 0-2 aty)
% Number of variables : 44 (; 40 !; 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_55 > #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_55',type,
'#skF_55': $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_1043,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& ( app(app(Z,cons(Y,nil)),X1) = W )
& ? [X2] :
( ssItem(X2)
& ( ( ~ leq(Y,X2)
& memberP(X1,X2) )
| ( ~ leq(X2,Y)
& memberP(Z,X2) ) ) ) ) ) )
| ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ( app(app(X4,cons(X3,nil)),X5) != U )
| ! [X6] :
( ssItem(X6)
=> ( ( ~ memberP(X4,X6)
| leq(X6,X3) )
& ( ~ memberP(X5,X6)
| leq(X3,X6) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_408,plain,
( memberP('#skF_53','#skF_55')
| ~ leq('#skF_52','#skF_55') ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_430,plain,
~ leq('#skF_52','#skF_55'),
inference(splitLeft,[status(thm)],[c_408]) ).
tff(c_392,plain,
ssItem('#skF_52'),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_390,plain,
ssList('#skF_53'),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_394,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_386,plain,
app(app('#skF_53',cons('#skF_52',nil)),'#skF_54') = '#skF_48',
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_421,plain,
app(app('#skF_53',cons('#skF_52',nil)),'#skF_54') = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_394,c_386]) ).
tff(c_388,plain,
ssList('#skF_54'),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_384,plain,
ssItem('#skF_55'),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_410,plain,
( ~ leq('#skF_55','#skF_52')
| memberP('#skF_54','#skF_55') ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_438,plain,
~ leq('#skF_55','#skF_52'),
inference(splitLeft,[status(thm)],[c_410]) ).
tff(c_412,plain,
( memberP('#skF_53','#skF_55')
| memberP('#skF_54','#skF_55') ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_447,plain,
memberP('#skF_54','#skF_55'),
inference(splitLeft,[status(thm)],[c_412]) ).
tff(c_538,plain,
! [X1_1635,X2_1636,Y_1637,Z_1638] :
( ~ memberP(X1_1635,X2_1636)
| leq(Y_1637,X2_1636)
| ~ ssItem(X2_1636)
| ( app(app(Z_1638,cons(Y_1637,nil)),X1_1635) != '#skF_50' )
| ~ ssList(X1_1635)
| ~ ssList(Z_1638)
| ~ ssItem(Y_1637) ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_540,plain,
! [Y_1637,Z_1638] :
( leq(Y_1637,'#skF_55')
| ~ ssItem('#skF_55')
| ( app(app(Z_1638,cons(Y_1637,nil)),'#skF_54') != '#skF_50' )
| ~ ssList('#skF_54')
| ~ ssList(Z_1638)
| ~ ssItem(Y_1637) ),
inference(resolution,[status(thm)],[c_447,c_538]) ).
tff(c_728,plain,
! [Y_1668,Z_1669] :
( leq(Y_1668,'#skF_55')
| ( app(app(Z_1669,cons(Y_1668,nil)),'#skF_54') != '#skF_50' )
| ~ ssList(Z_1669)
| ~ ssItem(Y_1668) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_384,c_540]) ).
tff(c_731,plain,
( leq('#skF_52','#skF_55')
| ~ ssList('#skF_53')
| ~ ssItem('#skF_52') ),
inference(superposition,[status(thm),theory(equality)],[c_421,c_728]) ).
tff(c_734,plain,
leq('#skF_52','#skF_55'),
inference(demodulation,[status(thm),theory(equality)],[c_392,c_390,c_731]) ).
tff(c_736,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_430,c_734]) ).
tff(c_737,plain,
memberP('#skF_53','#skF_55'),
inference(splitRight,[status(thm)],[c_412]) ).
tff(c_823,plain,
! [Z_1677,X2_1678,Y_1679,X1_1680] :
( ~ memberP(Z_1677,X2_1678)
| leq(X2_1678,Y_1679)
| ~ ssItem(X2_1678)
| ( app(app(Z_1677,cons(Y_1679,nil)),X1_1680) != '#skF_50' )
| ~ ssList(X1_1680)
| ~ ssList(Z_1677)
| ~ ssItem(Y_1679) ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_825,plain,
! [Y_1679,X1_1680] :
( leq('#skF_55',Y_1679)
| ~ ssItem('#skF_55')
| ( app(app('#skF_53',cons(Y_1679,nil)),X1_1680) != '#skF_50' )
| ~ ssList(X1_1680)
| ~ ssList('#skF_53')
| ~ ssItem(Y_1679) ),
inference(resolution,[status(thm)],[c_737,c_823]) ).
tff(c_1018,plain,
! [Y_1712,X1_1713] :
( leq('#skF_55',Y_1712)
| ( app(app('#skF_53',cons(Y_1712,nil)),X1_1713) != '#skF_50' )
| ~ ssList(X1_1713)
| ~ ssItem(Y_1712) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_384,c_825]) ).
tff(c_1021,plain,
( leq('#skF_55','#skF_52')
| ~ ssList('#skF_54')
| ~ ssItem('#skF_52') ),
inference(superposition,[status(thm),theory(equality)],[c_421,c_1018]) ).
tff(c_1024,plain,
leq('#skF_55','#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_392,c_388,c_1021]) ).
tff(c_1026,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_438,c_1024]) ).
tff(c_1027,plain,
memberP('#skF_54','#skF_55'),
inference(splitRight,[status(thm)],[c_410]) ).
tff(c_1138,plain,
! [X1_1733,X2_1734,Y_1735,Z_1736] :
( ~ memberP(X1_1733,X2_1734)
| leq(Y_1735,X2_1734)
| ~ ssItem(X2_1734)
| ( app(app(Z_1736,cons(Y_1735,nil)),X1_1733) != '#skF_50' )
| ~ ssList(X1_1733)
| ~ ssList(Z_1736)
| ~ ssItem(Y_1735) ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_1140,plain,
! [Y_1735,Z_1736] :
( leq(Y_1735,'#skF_55')
| ~ ssItem('#skF_55')
| ( app(app(Z_1736,cons(Y_1735,nil)),'#skF_54') != '#skF_50' )
| ~ ssList('#skF_54')
| ~ ssList(Z_1736)
| ~ ssItem(Y_1735) ),
inference(resolution,[status(thm)],[c_1027,c_1138]) ).
tff(c_1246,plain,
! [Y_1755,Z_1756] :
( leq(Y_1755,'#skF_55')
| ( app(app(Z_1756,cons(Y_1755,nil)),'#skF_54') != '#skF_50' )
| ~ ssList(Z_1756)
| ~ ssItem(Y_1755) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_384,c_1140]) ).
tff(c_1249,plain,
( leq('#skF_52','#skF_55')
| ~ ssList('#skF_53')
| ~ ssItem('#skF_52') ),
inference(superposition,[status(thm),theory(equality)],[c_421,c_1246]) ).
tff(c_1252,plain,
leq('#skF_52','#skF_55'),
inference(demodulation,[status(thm),theory(equality)],[c_392,c_390,c_1249]) ).
tff(c_1254,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_430,c_1252]) ).
tff(c_1256,plain,
leq('#skF_52','#skF_55'),
inference(splitRight,[status(thm)],[c_408]) ).
tff(c_1263,plain,
~ leq('#skF_55','#skF_52'),
inference(splitLeft,[status(thm)],[c_410]) ).
tff(c_1255,plain,
memberP('#skF_53','#skF_55'),
inference(splitRight,[status(thm)],[c_408]) ).
tff(c_1312,plain,
! [Z_1776,X2_1777,Y_1778,X1_1779] :
( ~ memberP(Z_1776,X2_1777)
| leq(X2_1777,Y_1778)
| ~ ssItem(X2_1777)
| ( app(app(Z_1776,cons(Y_1778,nil)),X1_1779) != '#skF_50' )
| ~ ssList(X1_1779)
| ~ ssList(Z_1776)
| ~ ssItem(Y_1778) ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_1314,plain,
! [Y_1778,X1_1779] :
( leq('#skF_55',Y_1778)
| ~ ssItem('#skF_55')
| ( app(app('#skF_53',cons(Y_1778,nil)),X1_1779) != '#skF_50' )
| ~ ssList(X1_1779)
| ~ ssList('#skF_53')
| ~ ssItem(Y_1778) ),
inference(resolution,[status(thm)],[c_1255,c_1312]) ).
tff(c_1564,plain,
! [Y_1816,X1_1817] :
( leq('#skF_55',Y_1816)
| ( app(app('#skF_53',cons(Y_1816,nil)),X1_1817) != '#skF_50' )
| ~ ssList(X1_1817)
| ~ ssItem(Y_1816) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_384,c_1314]) ).
tff(c_1567,plain,
( leq('#skF_55','#skF_52')
| ~ ssList('#skF_54')
| ~ ssItem('#skF_52') ),
inference(superposition,[status(thm),theory(equality)],[c_421,c_1564]) ).
tff(c_1570,plain,
leq('#skF_55','#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_392,c_388,c_1567]) ).
tff(c_1572,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1263,c_1570]) ).
tff(c_1574,plain,
leq('#skF_55','#skF_52'),
inference(splitRight,[status(thm)],[c_410]) ).
tff(c_406,plain,
( ~ leq('#skF_55','#skF_52')
| ~ leq('#skF_52','#skF_55') ),
inference(cnfTransformation,[status(thm)],[f_1043]) ).
tff(c_1586,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1256,c_1574,c_406]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC279+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.36 % Computer : n007.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:06:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.60/2.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.60/2.68
% 7.60/2.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.82/2.71
% 7.82/2.71 Inference rules
% 7.82/2.71 ----------------------
% 7.82/2.71 #Ref : 0
% 7.82/2.71 #Sup : 262
% 7.82/2.71 #Fact : 0
% 7.82/2.71 #Define : 0
% 7.82/2.71 #Split : 4
% 7.82/2.71 #Chain : 0
% 7.82/2.71 #Close : 0
% 7.82/2.71
% 7.82/2.71 Ordering : KBO
% 7.82/2.71
% 7.82/2.71 Simplification rules
% 7.82/2.71 ----------------------
% 7.82/2.71 #Subsume : 12
% 7.82/2.71 #Demod : 53
% 7.82/2.71 #Tautology : 107
% 7.82/2.71 #SimpNegUnit : 4
% 7.82/2.71 #BackRed : 0
% 7.82/2.71
% 7.82/2.71 #Partial instantiations: 0
% 7.82/2.71 #Strategies tried : 1
% 7.82/2.71
% 7.82/2.71 Timing (in seconds)
% 7.82/2.71 ----------------------
% 7.82/2.71 Preprocessing : 0.87
% 7.82/2.71 Parsing : 0.40
% 7.82/2.71 CNF conversion : 0.12
% 7.82/2.71 Main loop : 0.76
% 7.82/2.71 Inferencing : 0.26
% 7.82/2.71 Reduction : 0.23
% 7.82/2.71 Demodulation : 0.15
% 7.82/2.71 BG Simplification : 0.07
% 7.82/2.71 Subsumption : 0.15
% 7.82/2.71 Abstraction : 0.03
% 7.82/2.71 MUC search : 0.00
% 7.82/2.71 Cooper : 0.00
% 7.82/2.71 Total : 1.70
% 7.82/2.71 Index Insertion : 0.00
% 7.82/2.72 Index Deletion : 0.00
% 7.82/2.72 Index Matching : 0.00
% 7.82/2.72 BG Taut test : 0.00
%------------------------------------------------------------------------------