TSTP Solution File: SWC322+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC322+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 : n022.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:02:08 EDT 2023
% Result : Theorem 6.56s 2.49s
% Output : CNFRefutation 6.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 78
% Syntax : Number of formulae : 119 ( 18 unt; 77 typ; 0 def)
% Number of atoms : 88 ( 58 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 80 ( 34 ~; 35 |; 5 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 3 avg)
% Maximal term depth : 3 ( 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 : 58 ( 58 usr; 9 con; 0-2 aty)
% Number of variables : 12 (; 10 !; 2 ?; 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_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_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_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_1026,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ( app(cons(Y,nil),Z) != W )
& ( app(Z,cons(Y,nil)) = X ) ) )
| ( ( nil != W )
& ( nil = X ) )
| ( ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( app(X2,cons(X1,nil)) != V )
| ( app(cons(X1,nil),X2) = U ) ) ) )
& ( ( nil != V )
| ( nil = U ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(c_390,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_414,plain,
( ssItem('#skF_52')
| ( nil = '#skF_49' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_419,plain,
( ssItem('#skF_52')
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_414]) ).
tff(c_437,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_419]) ).
tff(c_384,plain,
( ( nil != '#skF_51' )
| ( nil = '#skF_50' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_453,plain,
'#skF_51' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_437,c_437,c_384]) ).
tff(c_455,plain,
nil = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_453,c_437]) ).
tff(c_388,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_400,plain,
( ( app(cons('#skF_52',nil),'#skF_53') != '#skF_48' )
| ( nil != '#skF_48' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_427,plain,
( ( app(cons('#skF_52',nil),'#skF_53') != '#skF_50' )
| ( nil != '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_388,c_400]) ).
tff(c_493,plain,
app(cons('#skF_52','#skF_50'),'#skF_53') != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_455,c_455,c_427]) ).
tff(c_406,plain,
( ssItem('#skF_52')
| ( nil != '#skF_48' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_424,plain,
( ssItem('#skF_52')
| ( nil != '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_406]) ).
tff(c_484,plain,
ssItem('#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_455,c_424]) ).
tff(c_404,plain,
( ssList('#skF_53')
| ( nil != '#skF_48' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_423,plain,
( ssList('#skF_53')
| ( nil != '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_404]) ).
tff(c_482,plain,
ssList('#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_455,c_423]) ).
tff(c_402,plain,
( ( app('#skF_53',cons('#skF_52',nil)) = '#skF_49' )
| ( nil != '#skF_48' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_417,plain,
( ( app('#skF_53',cons('#skF_52',nil)) = '#skF_51' )
| ( nil != '#skF_48' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_402]) ).
tff(c_425,plain,
( ( app('#skF_53',cons('#skF_52',nil)) = '#skF_51' )
| ( nil != '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_417]) ).
tff(c_548,plain,
app('#skF_53',cons('#skF_52','#skF_50')) = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_455,c_455,c_453,c_425]) ).
tff(c_386,plain,
! [Z_1225,Y_1223] :
( ( app(Z_1225,cons(Y_1223,nil)) != '#skF_51' )
| ( app(cons(Y_1223,nil),Z_1225) = '#skF_50' )
| ~ ssList(Z_1225)
| ~ ssItem(Y_1223) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_477,plain,
! [Z_1225,Y_1223] :
( ( app(Z_1225,cons(Y_1223,'#skF_50')) != '#skF_50' )
| ( app(cons(Y_1223,'#skF_50'),Z_1225) = '#skF_50' )
| ~ ssList(Z_1225)
| ~ ssItem(Y_1223) ),
inference(demodulation,[status(thm),theory(equality)],[c_455,c_455,c_453,c_386]) ).
tff(c_551,plain,
( ( app(cons('#skF_52','#skF_50'),'#skF_53') = '#skF_50' )
| ~ ssList('#skF_53')
| ~ ssItem('#skF_52') ),
inference(superposition,[status(thm),theory(equality)],[c_548,c_477]) ).
tff(c_556,plain,
app(cons('#skF_52','#skF_50'),'#skF_53') = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_484,c_482,c_551]) ).
tff(c_558,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_493,c_556]) ).
tff(c_560,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_419]) ).
tff(c_559,plain,
ssItem('#skF_52'),
inference(splitRight,[status(thm)],[c_419]) ).
tff(c_412,plain,
( ssList('#skF_53')
| ( nil = '#skF_49' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_416,plain,
( ssList('#skF_53')
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_412]) ).
tff(c_561,plain,
ssList('#skF_53'),
inference(negUnitSimplification,[status(thm)],[c_560,c_416]) ).
tff(c_410,plain,
( ( app('#skF_53',cons('#skF_52',nil)) = '#skF_49' )
| ( nil = '#skF_49' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_420,plain,
( ( app('#skF_53',cons('#skF_52',nil)) = '#skF_51' )
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_390,c_410]) ).
tff(c_657,plain,
app('#skF_53',cons('#skF_52',nil)) = '#skF_51',
inference(negUnitSimplification,[status(thm)],[c_560,c_420]) ).
tff(c_660,plain,
( ( app(cons('#skF_52',nil),'#skF_53') = '#skF_50' )
| ~ ssList('#skF_53')
| ~ ssItem('#skF_52') ),
inference(superposition,[status(thm),theory(equality)],[c_657,c_386]) ).
tff(c_665,plain,
app(cons('#skF_52',nil),'#skF_53') = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_559,c_561,c_660]) ).
tff(c_408,plain,
( ( app(cons('#skF_52',nil),'#skF_53') != '#skF_48' )
| ( nil = '#skF_49' ) ),
inference(cnfTransformation,[status(thm)],[f_1026]) ).
tff(c_418,plain,
( ( app(cons('#skF_52',nil),'#skF_53') != '#skF_48' )
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_408]) ).
tff(c_426,plain,
( ( app(cons('#skF_52',nil),'#skF_53') != '#skF_50' )
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_418]) ).
tff(c_770,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_665,c_426]) ).
tff(c_771,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_560,c_770]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC322+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/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.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 21:28:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 6.56/2.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.56/2.49
% 6.56/2.49 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.95/2.52
% 6.95/2.52 Inference rules
% 6.95/2.52 ----------------------
% 6.95/2.52 #Ref : 0
% 6.95/2.52 #Sup : 70
% 6.95/2.52 #Fact : 0
% 6.95/2.52 #Define : 0
% 6.95/2.52 #Split : 2
% 6.95/2.52 #Chain : 0
% 6.95/2.52 #Close : 0
% 6.95/2.52
% 6.95/2.52 Ordering : KBO
% 6.95/2.52
% 6.95/2.52 Simplification rules
% 6.95/2.52 ----------------------
% 6.95/2.52 #Subsume : 10
% 6.95/2.52 #Demod : 81
% 6.95/2.52 #Tautology : 53
% 6.95/2.53 #SimpNegUnit : 4
% 6.95/2.53 #BackRed : 13
% 6.95/2.53
% 6.95/2.53 #Partial instantiations: 0
% 6.95/2.53 #Strategies tried : 1
% 6.95/2.53
% 6.95/2.53 Timing (in seconds)
% 6.95/2.53 ----------------------
% 6.95/2.53 Preprocessing : 0.90
% 6.95/2.53 Parsing : 0.42
% 6.95/2.53 CNF conversion : 0.10
% 6.95/2.53 Main loop : 0.54
% 6.95/2.53 Inferencing : 0.13
% 6.95/2.53 Reduction : 0.19
% 6.95/2.53 Demodulation : 0.13
% 6.95/2.53 BG Simplification : 0.07
% 6.95/2.53 Subsumption : 0.12
% 6.95/2.53 Abstraction : 0.02
% 6.95/2.53 MUC search : 0.00
% 6.95/2.53 Cooper : 0.00
% 6.95/2.53 Total : 1.50
% 6.95/2.53 Index Insertion : 0.00
% 6.95/2.53 Index Deletion : 0.00
% 6.95/2.53 Index Matching : 0.00
% 6.95/2.53 BG Taut test : 0.00
%------------------------------------------------------------------------------