TSTP Solution File: SWC252+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC252+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 : n029.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:47 EDT 2023
% Result : Theorem 7.51s 2.63s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 82
% Syntax : Number of formulae : 110 ( 12 unt; 77 typ; 0 def)
% Number of atoms : 100 ( 34 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 128 ( 61 ~; 53 |; 5 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 88 ( 69 >; 19 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 58 ( 58 usr; 8 con; 0-3 aty)
% Number of variables : 39 (; 36 !; 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_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_52 > #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_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_52',type,
'#skF_52': ( $i * $i * $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 )
| ( nil = U )
| ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& ( app(app(Z,cons(Y,nil)),X1) = U )
& ! [X2] :
( ssItem(X2)
=> ( ~ memberP(Z,X2)
| ~ memberP(X1,X2)
| ~ lt(Y,X2)
| leq(Y,X2) ) ) ) ) )
| ( ! [X3] :
( ssItem(X3)
=> ( ( cons(X3,nil) != W )
| ~ memberP(X,X3) ) )
& ( ( nil != X )
| ( nil != W ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_859,axiom,
! [U] :
( ssList(U)
=> ( app(U,nil) = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_413,axiom,
! [U] :
( ssList(U)
=> ( app(nil,U) = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
tff(f_517,axiom,
! [U] :
( ssItem(U)
=> ~ memberP(nil,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
tff(c_392,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_500,plain,
! [U_1410] :
( ( app(U_1410,nil) = U_1410 )
| ~ ssList(U_1410) ),
inference(cnfTransformation,[status(thm)],[f_859]) ).
tff(c_512,plain,
app('#skF_50',nil) = '#skF_50',
inference(resolution,[status(thm)],[c_392,c_500]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_542,plain,
! [U_1416] :
( ( app(nil,U_1416) = U_1416 )
| ~ ssList(U_1416) ),
inference(cnfTransformation,[status(thm)],[f_413]) ).
tff(c_555,plain,
app(nil,'#skF_50') = '#skF_50',
inference(resolution,[status(thm)],[c_392,c_542]) ).
tff(c_386,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_384,plain,
nil != '#skF_48',
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_428,plain,
nil != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_386,c_384]) ).
tff(c_402,plain,
( ssItem('#skF_53')
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_429,plain,
ssItem('#skF_53'),
inference(negUnitSimplification,[status(thm)],[c_428,c_402]) ).
tff(c_400,plain,
( ( cons('#skF_53',nil) = '#skF_50' )
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_431,plain,
cons('#skF_53',nil) = '#skF_50',
inference(negUnitSimplification,[status(thm)],[c_428,c_400]) ).
tff(c_418,plain,
! [Y_1373,Z_1381,X1_1385] :
( ssItem('#skF_52'(Y_1373,Z_1381,X1_1385))
| ( app(app(Z_1381,cons(Y_1373,nil)),X1_1385) != '#skF_48' )
| ~ ssList(X1_1385)
| ~ ssList(Z_1381)
| ~ ssItem(Y_1373) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_456,plain,
! [Y_1396,Z_1397,X1_1398] :
( ssItem('#skF_52'(Y_1396,Z_1397,X1_1398))
| ( app(app(Z_1397,cons(Y_1396,nil)),X1_1398) != '#skF_50' )
| ~ ssList(X1_1398)
| ~ ssList(Z_1397)
| ~ ssItem(Y_1396) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_418]) ).
tff(c_459,plain,
! [Z_1397,X1_1398] :
( ssItem('#skF_52'('#skF_53',Z_1397,X1_1398))
| ( app(app(Z_1397,'#skF_50'),X1_1398) != '#skF_50' )
| ~ ssList(X1_1398)
| ~ ssList(Z_1397)
| ~ ssItem('#skF_53') ),
inference(superposition,[status(thm),theory(equality)],[c_431,c_456]) ).
tff(c_461,plain,
! [Z_1397,X1_1398] :
( ssItem('#skF_52'('#skF_53',Z_1397,X1_1398))
| ( app(app(Z_1397,'#skF_50'),X1_1398) != '#skF_50' )
| ~ ssList(X1_1398)
| ~ ssList(Z_1397) ),
inference(demodulation,[status(thm),theory(equality)],[c_429,c_459]) ).
tff(c_416,plain,
! [Z_1381,Y_1373,X1_1385] :
( memberP(Z_1381,'#skF_52'(Y_1373,Z_1381,X1_1385))
| ( app(app(Z_1381,cons(Y_1373,nil)),X1_1385) != '#skF_48' )
| ~ ssList(X1_1385)
| ~ ssList(Z_1381)
| ~ ssItem(Y_1373) ),
inference(cnfTransformation,[status(thm)],[f_1036]) ).
tff(c_591,plain,
! [Z_1420,Y_1421,X1_1422] :
( memberP(Z_1420,'#skF_52'(Y_1421,Z_1420,X1_1422))
| ( app(app(Z_1420,cons(Y_1421,nil)),X1_1422) != '#skF_50' )
| ~ ssList(X1_1422)
| ~ ssList(Z_1420)
| ~ ssItem(Y_1421) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_416]) ).
tff(c_593,plain,
! [Z_1420,X1_1422] :
( memberP(Z_1420,'#skF_52'('#skF_53',Z_1420,X1_1422))
| ( app(app(Z_1420,'#skF_50'),X1_1422) != '#skF_50' )
| ~ ssList(X1_1422)
| ~ ssList(Z_1420)
| ~ ssItem('#skF_53') ),
inference(superposition,[status(thm),theory(equality)],[c_431,c_591]) ).
tff(c_811,plain,
! [Z_1466,X1_1467] :
( memberP(Z_1466,'#skF_52'('#skF_53',Z_1466,X1_1467))
| ( app(app(Z_1466,'#skF_50'),X1_1467) != '#skF_50' )
| ~ ssList(X1_1467)
| ~ ssList(Z_1466) ),
inference(demodulation,[status(thm),theory(equality)],[c_429,c_593]) ).
tff(c_228,plain,
! [U_948] :
( ~ memberP(nil,U_948)
| ~ ssItem(U_948) ),
inference(cnfTransformation,[status(thm)],[f_517]) ).
tff(c_815,plain,
! [X1_1467] :
( ~ ssItem('#skF_52'('#skF_53',nil,X1_1467))
| ( app(app(nil,'#skF_50'),X1_1467) != '#skF_50' )
| ~ ssList(X1_1467)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_811,c_228]) ).
tff(c_1372,plain,
! [X1_1487] :
( ~ ssItem('#skF_52'('#skF_53',nil,X1_1487))
| ( app('#skF_50',X1_1487) != '#skF_50' )
| ~ ssList(X1_1487) ),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_555,c_815]) ).
tff(c_1376,plain,
! [X1_1398] :
( ( app('#skF_50',X1_1398) != '#skF_50' )
| ( app(app(nil,'#skF_50'),X1_1398) != '#skF_50' )
| ~ ssList(X1_1398)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_461,c_1372]) ).
tff(c_1380,plain,
! [X1_1488] :
( ( app('#skF_50',X1_1488) != '#skF_50' )
| ~ ssList(X1_1488) ),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_555,c_1376]) ).
tff(c_1458,plain,
app('#skF_50',nil) != '#skF_50',
inference(resolution,[status(thm)],[c_168,c_1380]) ).
tff(c_1490,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_512,c_1458]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC252+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:37:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.51/2.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.51/2.64
% 7.51/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.51/2.67
% 7.51/2.67 Inference rules
% 7.51/2.67 ----------------------
% 7.51/2.67 #Ref : 0
% 7.51/2.67 #Sup : 227
% 7.51/2.67 #Fact : 0
% 7.51/2.67 #Define : 0
% 7.51/2.67 #Split : 2
% 7.51/2.67 #Chain : 0
% 7.51/2.67 #Close : 0
% 7.51/2.67
% 7.51/2.67 Ordering : KBO
% 7.51/2.67
% 7.51/2.67 Simplification rules
% 7.51/2.67 ----------------------
% 7.51/2.67 #Subsume : 10
% 7.51/2.67 #Demod : 128
% 7.51/2.67 #Tautology : 63
% 7.51/2.67 #SimpNegUnit : 7
% 7.51/2.67 #BackRed : 44
% 7.51/2.67
% 7.51/2.67 #Partial instantiations: 0
% 7.51/2.67 #Strategies tried : 1
% 7.51/2.67
% 7.51/2.67 Timing (in seconds)
% 7.51/2.67 ----------------------
% 7.51/2.67 Preprocessing : 0.89
% 7.51/2.67 Parsing : 0.40
% 7.51/2.67 CNF conversion : 0.12
% 7.51/2.67 Main loop : 0.72
% 7.51/2.67 Inferencing : 0.21
% 7.51/2.67 Reduction : 0.22
% 7.51/2.67 Demodulation : 0.15
% 7.51/2.67 BG Simplification : 0.07
% 7.51/2.67 Subsumption : 0.16
% 7.51/2.67 Abstraction : 0.03
% 7.51/2.67 MUC search : 0.00
% 7.51/2.67 Cooper : 0.00
% 7.51/2.67 Total : 1.66
% 7.51/2.67 Index Insertion : 0.00
% 7.51/2.67 Index Deletion : 0.00
% 7.51/2.68 Index Matching : 0.00
% 7.51/2.68 BG Taut test : 0.00
%------------------------------------------------------------------------------