TSTP Solution File: SWC019+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC019+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 : n002.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:46 EDT 2023
% Result : Theorem 6.80s 2.52s
% Output : CNFRefutation 7.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 79
% Syntax : Number of formulae : 100 ( 13 unt; 75 typ; 0 def)
% Number of atoms : 59 ( 22 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 62 ( 28 ~; 22 |; 4 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 1 ( 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 : 56 ( 56 usr; 7 con; 0-2 aty)
% Number of variables : 15 (; 14 !; 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_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_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_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_1010,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( X != W )
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& frontsegP(V,Y)
& frontsegP(U,Y) )
| ( ( nil = V )
& ( nil = U ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_548,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(c_388,plain,
'#skF_51' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_392,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_406,plain,
'#skF_49' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_392]) ).
tff(c_390,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_384,plain,
( ( nil != '#skF_48' )
| ( nil != '#skF_49' ) ),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_409,plain,
( ( nil != '#skF_50' )
| ( nil != '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_406,c_390,c_384]) ).
tff(c_422,plain,
nil != '#skF_50',
inference(splitLeft,[status(thm)],[c_409]) ).
tff(c_396,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_236,plain,
! [U_959] :
( frontsegP(U_959,U_959)
| ~ ssList(U_959) ),
inference(cnfTransformation,[status(thm)],[f_548]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_1327,plain,
! [U_1234,V_1235] :
( neq(U_1234,V_1235)
| ( V_1235 = U_1234 )
| ~ ssList(V_1235)
| ~ ssList(U_1234) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_386,plain,
! [Y_1148] :
( ~ frontsegP('#skF_48',Y_1148)
| ~ frontsegP('#skF_49',Y_1148)
| ~ neq(Y_1148,nil)
| ~ ssList(Y_1148) ),
inference(cnfTransformation,[status(thm)],[f_1010]) ).
tff(c_408,plain,
! [Y_1148] :
( ~ frontsegP('#skF_50',Y_1148)
| ~ frontsegP('#skF_50',Y_1148)
| ~ neq(Y_1148,nil)
| ~ ssList(Y_1148) ),
inference(demodulation,[status(thm),theory(equality)],[c_406,c_390,c_386]) ).
tff(c_1339,plain,
! [U_1234] :
( ~ frontsegP('#skF_50',U_1234)
| ( nil = U_1234 )
| ~ ssList(nil)
| ~ ssList(U_1234) ),
inference(resolution,[status(thm)],[c_1327,c_408]) ).
tff(c_1347,plain,
! [U_1236] :
( ~ frontsegP('#skF_50',U_1236)
| ( nil = U_1236 )
| ~ ssList(U_1236) ),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_1339]) ).
tff(c_1355,plain,
( ( nil = '#skF_50' )
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_236,c_1347]) ).
tff(c_1362,plain,
nil = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_396,c_1355]) ).
tff(c_1364,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_422,c_1362]) ).
tff(c_1365,plain,
nil != '#skF_50',
inference(splitRight,[status(thm)],[c_409]) ).
tff(c_1366,plain,
nil = '#skF_50',
inference(splitRight,[status(thm)],[c_409]) ).
tff(c_1367,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1365,c_1366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC019+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12 % 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.11/0.33 % Computer : n002.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 3 22:00:31 EDT 2023
% 0.11/0.33 % CPUTime :
% 6.80/2.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.80/2.53
% 6.80/2.53 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.08/2.55
% 7.08/2.55 Inference rules
% 7.08/2.55 ----------------------
% 7.08/2.55 #Ref : 0
% 7.08/2.55 #Sup : 212
% 7.08/2.55 #Fact : 0
% 7.08/2.55 #Define : 0
% 7.08/2.55 #Split : 4
% 7.08/2.55 #Chain : 0
% 7.08/2.55 #Close : 0
% 7.08/2.55
% 7.08/2.55 Ordering : KBO
% 7.08/2.55
% 7.08/2.55 Simplification rules
% 7.08/2.55 ----------------------
% 7.08/2.55 #Subsume : 8
% 7.08/2.55 #Demod : 41
% 7.08/2.55 #Tautology : 49
% 7.08/2.55 #SimpNegUnit : 6
% 7.08/2.55 #BackRed : 0
% 7.08/2.55
% 7.08/2.55 #Partial instantiations: 0
% 7.08/2.55 #Strategies tried : 1
% 7.08/2.55
% 7.08/2.56 Timing (in seconds)
% 7.08/2.56 ----------------------
% 7.08/2.56 Preprocessing : 0.89
% 7.08/2.56 Parsing : 0.41
% 7.08/2.56 CNF conversion : 0.11
% 7.08/2.56 Main loop : 0.62
% 7.08/2.56 Inferencing : 0.17
% 7.08/2.56 Reduction : 0.19
% 7.08/2.56 Demodulation : 0.13
% 7.08/2.56 BG Simplification : 0.07
% 7.08/2.56 Subsumption : 0.13
% 7.08/2.56 Abstraction : 0.03
% 7.08/2.56 MUC search : 0.00
% 7.08/2.56 Cooper : 0.00
% 7.08/2.56 Total : 1.56
% 7.08/2.56 Index Insertion : 0.00
% 7.08/2.56 Index Deletion : 0.00
% 7.08/2.56 Index Matching : 0.00
% 7.08/2.56 BG Taut test : 0.00
%------------------------------------------------------------------------------