TSTP Solution File: SWC217+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC217+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 : n011.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:40 EDT 2023
% Result : Theorem 7.39s 2.63s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 81
% Syntax : Number of formulae : 105 ( 17 unt; 76 typ; 0 def)
% Number of atoms : 63 ( 24 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 59 ( 25 ~; 19 |; 3 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 3 avg)
% Maximal term depth : 2 ( 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 : 57 ( 57 usr; 8 con; 0-2 aty)
% Number of variables : 16 (; 15 !; 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_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_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_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_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_1015,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ~ neq(V,nil)
| neq(U,nil)
| ( ( nil != W )
& ( nil = X ) )
| ( ! [Y] :
( ssItem(Y)
=> ( ( cons(Y,nil) != W )
| ~ memberP(X,Y) ) )
& neq(X,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_327,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( cons(V,U) != U ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_311,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> ( U != V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
tff(c_396,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_392,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_388,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_411,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_392,c_388]) ).
tff(c_406,plain,
( ssItem('#skF_52')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_417,plain,
ssItem('#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_411,c_406]) ).
tff(c_809,plain,
! [U_1213] :
( ( hd(U_1213) = '#skF_46'(U_1213) )
| ( nil = U_1213 )
| ~ ssList(U_1213) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_916,plain,
( ( hd('#skF_50') = '#skF_46'('#skF_50') )
| ( nil = '#skF_50' ) ),
inference(resolution,[status(thm)],[c_396,c_809]) ).
tff(c_927,plain,
nil = '#skF_50',
inference(splitLeft,[status(thm)],[c_916]) ).
tff(c_404,plain,
( ( cons('#skF_52',nil) = '#skF_50' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_415,plain,
cons('#skF_52',nil) = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_411,c_404]) ).
tff(c_956,plain,
cons('#skF_52','#skF_50') = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_927,c_415]) ).
tff(c_1004,plain,
! [V_1216,U_1217] :
( ( cons(V_1216,U_1217) != U_1217 )
| ~ ssItem(V_1216)
| ~ ssList(U_1217) ),
inference(cnfTransformation,[status(thm)],[f_327]) ).
tff(c_1006,plain,
( ~ ssItem('#skF_52')
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_956,c_1004]) ).
tff(c_1010,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_396,c_417,c_1006]) ).
tff(c_1012,plain,
nil != '#skF_50',
inference(splitRight,[status(thm)],[c_916]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_1547,plain,
! [U_1232,V_1233] :
( neq(U_1232,V_1233)
| ( V_1233 = U_1232 )
| ~ ssList(V_1233)
| ~ ssList(U_1232) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_390,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_386,plain,
~ neq('#skF_48',nil),
inference(cnfTransformation,[status(thm)],[f_1015]) ).
tff(c_418,plain,
~ neq('#skF_50',nil),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_386]) ).
tff(c_1558,plain,
( ( nil = '#skF_50' )
| ~ ssList(nil)
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_1547,c_418]) ).
tff(c_1565,plain,
nil = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_396,c_168,c_1558]) ).
tff(c_1567,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1012,c_1565]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC217+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.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 21:20:06 EDT 2023
% 0.15/0.36 % CPUTime :
% 7.39/2.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.51/2.63
% 7.51/2.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.51/2.66
% 7.51/2.66 Inference rules
% 7.51/2.66 ----------------------
% 7.51/2.66 #Ref : 0
% 7.51/2.66 #Sup : 256
% 7.51/2.66 #Fact : 0
% 7.51/2.66 #Define : 0
% 7.51/2.66 #Split : 5
% 7.51/2.66 #Chain : 0
% 7.51/2.66 #Close : 0
% 7.51/2.66
% 7.51/2.66 Ordering : KBO
% 7.51/2.66
% 7.51/2.66 Simplification rules
% 7.51/2.66 ----------------------
% 7.51/2.66 #Subsume : 10
% 7.51/2.66 #Demod : 127
% 7.51/2.66 #Tautology : 81
% 7.51/2.66 #SimpNegUnit : 8
% 7.51/2.66 #BackRed : 41
% 7.51/2.66
% 7.51/2.66 #Partial instantiations: 0
% 7.51/2.66 #Strategies tried : 1
% 7.51/2.66
% 7.51/2.66 Timing (in seconds)
% 7.51/2.66 ----------------------
% 7.51/2.67 Preprocessing : 0.88
% 7.51/2.67 Parsing : 0.42
% 7.51/2.67 CNF conversion : 0.11
% 7.51/2.67 Main loop : 0.71
% 7.51/2.67 Inferencing : 0.20
% 7.51/2.67 Reduction : 0.24
% 7.51/2.67 Demodulation : 0.16
% 7.51/2.67 BG Simplification : 0.07
% 7.51/2.67 Subsumption : 0.15
% 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.64
% 7.51/2.67 Index Insertion : 0.00
% 7.51/2.67 Index Deletion : 0.00
% 7.51/2.67 Index Matching : 0.00
% 7.51/2.67 BG Taut test : 0.00
%------------------------------------------------------------------------------