TSTP Solution File: SWC046+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC046+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 : n003.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:00:55 EDT 2023
% Result : Theorem 7.85s 2.78s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 84
% Syntax : Number of formulae : 123 ( 15 unt; 76 typ; 0 def)
% Number of atoms : 121 ( 50 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 115 ( 41 ~; 47 |; 7 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 69 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 57 ( 57 usr; 7 con; 0-2 aty)
% Number of variables : 34 (; 30 !; 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_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_52 > #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_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_52',type,
'#skF_52': $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_1023,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( nil != V )
| ( V != X )
| ( U != W )
| ( nil = U )
| ? [Y] :
( ssItem(Y)
& ( ( ~ memberP(W,Y)
& ! [Z] :
( ssList(Z)
=> ~ segmentP(X,app(app(cons(Y,nil),Z),cons(Y,nil))) )
& memberP(X,Y) )
| ( memberP(W,Y)
& ( ~ memberP(X,Y)
| ? [Z] :
( ssList(Z)
& segmentP(X,app(app(cons(Y,nil),Z),cons(Y,nil))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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_371,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ssItem(hd(U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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_385,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ssList(tl(U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
tff(f_803,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ( cons(hd(U),tl(U)) = U ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
tff(f_512,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssList(W)
=> ( memberP(cons(V,W),U)
<=> ( ( U = V )
| memberP(W,U) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
tff(f_517,axiom,
! [U] :
( ssItem(U)
=> ~ memberP(nil,U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
tff(c_386,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1023]) ).
tff(c_388,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1023]) ).
tff(c_390,plain,
nil = '#skF_49',
inference(cnfTransformation,[status(thm)],[f_1023]) ).
tff(c_410,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_390]) ).
tff(c_384,plain,
nil != '#skF_48',
inference(cnfTransformation,[status(thm)],[f_1023]) ).
tff(c_416,plain,
'#skF_51' != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_386,c_410,c_384]) ).
tff(c_394,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1023]) ).
tff(c_330,plain,
! [U_1045] :
( ( hd(U_1045) = '#skF_46'(U_1045) )
| ( nil = U_1045 )
| ~ ssList(U_1045) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_1263,plain,
! [U_1292] :
( ( hd(U_1292) = '#skF_46'(U_1292) )
| ( U_1292 = '#skF_51' )
| ~ ssList(U_1292) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_330]) ).
tff(c_1344,plain,
( ( hd('#skF_50') = '#skF_46'('#skF_50') )
| ( '#skF_51' = '#skF_50' ) ),
inference(resolution,[status(thm)],[c_394,c_1263]) ).
tff(c_1376,plain,
hd('#skF_50') = '#skF_46'('#skF_50'),
inference(negUnitSimplification,[status(thm)],[c_416,c_1344]) ).
tff(c_184,plain,
! [U_888] :
( ssItem(hd(U_888))
| ( nil = U_888 )
| ~ ssList(U_888) ),
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_471,plain,
! [U_888] :
( ssItem(hd(U_888))
| ( U_888 = '#skF_51' )
| ~ ssList(U_888) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_184]) ).
tff(c_1382,plain,
( ssItem('#skF_46'('#skF_50'))
| ( '#skF_51' = '#skF_50' )
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_1376,c_471]) ).
tff(c_1386,plain,
( ssItem('#skF_46'('#skF_50'))
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_1382]) ).
tff(c_1387,plain,
ssItem('#skF_46'('#skF_50')),
inference(negUnitSimplification,[status(thm)],[c_416,c_1386]) ).
tff(c_334,plain,
! [U_1047] :
( ( tl(U_1047) = '#skF_47'(U_1047) )
| ( nil = U_1047 )
| ~ ssList(U_1047) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_949,plain,
! [U_1282] :
( ( tl(U_1282) = '#skF_47'(U_1282) )
| ( U_1282 = '#skF_51' )
| ~ ssList(U_1282) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_334]) ).
tff(c_1021,plain,
( ( tl('#skF_50') = '#skF_47'('#skF_50') )
| ( '#skF_51' = '#skF_50' ) ),
inference(resolution,[status(thm)],[c_394,c_949]) ).
tff(c_1050,plain,
tl('#skF_50') = '#skF_47'('#skF_50'),
inference(negUnitSimplification,[status(thm)],[c_416,c_1021]) ).
tff(c_188,plain,
! [U_892] :
( ssList(tl(U_892))
| ( nil = U_892 )
| ~ ssList(U_892) ),
inference(cnfTransformation,[status(thm)],[f_385]) ).
tff(c_470,plain,
! [U_892] :
( ssList(tl(U_892))
| ( U_892 = '#skF_51' )
| ~ ssList(U_892) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_188]) ).
tff(c_1057,plain,
( ssList('#skF_47'('#skF_50'))
| ( '#skF_51' = '#skF_50' )
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_1050,c_470]) ).
tff(c_1061,plain,
( ssList('#skF_47'('#skF_50'))
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_1057]) ).
tff(c_1062,plain,
ssList('#skF_47'('#skF_50')),
inference(negUnitSimplification,[status(thm)],[c_416,c_1061]) ).
tff(c_340,plain,
! [U_1052] :
( ( cons(hd(U_1052),tl(U_1052)) = U_1052 )
| ( nil = U_1052 )
| ~ ssList(U_1052) ),
inference(cnfTransformation,[status(thm)],[f_803]) ).
tff(c_2482,plain,
! [U_1347] :
( ( cons(hd(U_1347),tl(U_1347)) = U_1347 )
| ( U_1347 = '#skF_51' )
| ~ ssList(U_1347) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_340]) ).
tff(c_2519,plain,
( ( cons('#skF_46'('#skF_50'),tl('#skF_50')) = '#skF_50' )
| ( '#skF_51' = '#skF_50' )
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_1376,c_2482]) ).
tff(c_2534,plain,
( ( cons('#skF_46'('#skF_50'),'#skF_47'('#skF_50')) = '#skF_50' )
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_394,c_1050,c_2519]) ).
tff(c_2535,plain,
cons('#skF_46'('#skF_50'),'#skF_47'('#skF_50')) = '#skF_50',
inference(negUnitSimplification,[status(thm)],[c_416,c_2534]) ).
tff(c_226,plain,
! [V_945,W_947] :
( memberP(cons(V_945,W_947),V_945)
| ~ ssList(W_947)
| ~ ssItem(V_945) ),
inference(cnfTransformation,[status(thm)],[f_512]) ).
tff(c_2548,plain,
( memberP('#skF_50','#skF_46'('#skF_50'))
| ~ ssList('#skF_47'('#skF_50'))
| ~ ssItem('#skF_46'('#skF_50')) ),
inference(superposition,[status(thm),theory(equality)],[c_2535,c_226]) ).
tff(c_2563,plain,
memberP('#skF_50','#skF_46'('#skF_50')),
inference(demodulation,[status(thm),theory(equality)],[c_1387,c_1062,c_2548]) ).
tff(c_402,plain,
! [Y_1208] :
( memberP('#skF_51',Y_1208)
| ~ memberP('#skF_50',Y_1208)
| ~ ssItem(Y_1208) ),
inference(cnfTransformation,[status(thm)],[f_1023]) ).
tff(c_228,plain,
! [U_948] :
( ~ memberP(nil,U_948)
| ~ ssItem(U_948) ),
inference(cnfTransformation,[status(thm)],[f_517]) ).
tff(c_507,plain,
! [U_1225] :
( ~ memberP('#skF_51',U_1225)
| ~ ssItem(U_1225) ),
inference(demodulation,[status(thm),theory(equality)],[c_410,c_228]) ).
tff(c_511,plain,
! [Y_1208] :
( ~ memberP('#skF_50',Y_1208)
| ~ ssItem(Y_1208) ),
inference(resolution,[status(thm)],[c_402,c_507]) ).
tff(c_2573,plain,
~ ssItem('#skF_46'('#skF_50')),
inference(resolution,[status(thm)],[c_2563,c_511]) ).
tff(c_2577,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1387,c_2573]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC046+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.15 % 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 : n003.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:22:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.85/2.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.85/2.78
% 7.85/2.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.85/2.82
% 7.85/2.82 Inference rules
% 7.85/2.82 ----------------------
% 7.85/2.82 #Ref : 0
% 7.85/2.82 #Sup : 486
% 7.85/2.82 #Fact : 0
% 7.85/2.82 #Define : 0
% 7.85/2.82 #Split : 8
% 7.85/2.82 #Chain : 0
% 7.85/2.82 #Close : 0
% 7.85/2.82
% 7.85/2.82 Ordering : KBO
% 7.85/2.82
% 7.85/2.82 Simplification rules
% 7.85/2.82 ----------------------
% 7.85/2.82 #Subsume : 43
% 7.85/2.82 #Demod : 230
% 7.85/2.82 #Tautology : 114
% 7.85/2.82 #SimpNegUnit : 17
% 7.85/2.82 #BackRed : 7
% 7.85/2.82
% 7.85/2.82 #Partial instantiations: 0
% 7.85/2.82 #Strategies tried : 1
% 7.85/2.82
% 7.85/2.82 Timing (in seconds)
% 7.85/2.82 ----------------------
% 7.85/2.82 Preprocessing : 0.89
% 7.85/2.82 Parsing : 0.42
% 7.85/2.82 CNF conversion : 0.11
% 7.85/2.82 Main loop : 0.85
% 7.85/2.82 Inferencing : 0.26
% 7.85/2.82 Reduction : 0.28
% 7.85/2.82 Demodulation : 0.20
% 7.85/2.82 BG Simplification : 0.08
% 7.85/2.82 Subsumption : 0.17
% 7.85/2.82 Abstraction : 0.03
% 7.85/2.82 MUC search : 0.00
% 7.85/2.82 Cooper : 0.00
% 7.85/2.82 Total : 1.80
% 7.85/2.82 Index Insertion : 0.00
% 7.85/2.82 Index Deletion : 0.00
% 7.85/2.82 Index Matching : 0.00
% 7.85/2.82 BG Taut test : 0.00
%------------------------------------------------------------------------------