TSTP Solution File: SWC076+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC076+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 : n027.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:03 EDT 2023
% Result : Theorem 88.42s 70.55s
% Output : CNFRefutation 88.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 82
% Syntax : Number of formulae : 110 ( 16 unt; 77 typ; 0 def)
% Number of atoms : 99 ( 28 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 110 ( 44 ~; 38 |; 13 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 4 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 : 32 (; 25 !; 7 ?; 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_1050,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(V,Y)
& segmentP(U,Y) )
| ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ( app(app(Z,W),X1) != X )
| ~ equalelemsP(W)
| ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ( app(X3,cons(X2,nil)) = Z )
& ? [X4] :
( ssList(X4)
& ( app(cons(X2,nil),X4) = W ) ) ) )
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ( app(cons(X5,nil),X6) = X1 )
& ? [X7] :
( ssList(X7)
& ( app(X7,cons(X5,nil)) = W ) ) ) ) ) ) )
| ( ( nil != X )
& ( nil = W ) )
| ( ( nil = V )
& ( nil = U ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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(f_667,axiom,
! [U] :
( ssList(U)
=> segmentP(U,U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
tff(f_682,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( segmentP(U,V)
=> segmentP(app(app(W,U),X),V) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
tff(c_386,plain,
( ( nil != '#skF_50' )
| ( nil = '#skF_51' ) ),
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_427,plain,
nil != '#skF_50',
inference(splitLeft,[status(thm)],[c_386]) ).
tff(c_408,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_162,plain,
! [U_856,V_858] :
( neq(U_856,V_858)
| ( V_858 = U_856 )
| ~ ssList(V_858)
| ~ ssList(U_856) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_270,plain,
! [U_1014] :
( segmentP(U_1014,U_1014)
| ~ ssList(U_1014) ),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_398,plain,
ssList('#skF_52'),
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_396,plain,
ssList('#skF_53'),
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_394,plain,
app(app('#skF_52','#skF_50'),'#skF_53') = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_191718,plain,
! [W_5436,U_5437,X_5438,V_5439] :
( segmentP(app(app(W_5436,U_5437),X_5438),V_5439)
| ~ segmentP(U_5437,V_5439)
| ~ ssList(X_5438)
| ~ ssList(W_5436)
| ~ ssList(V_5439)
| ~ ssList(U_5437) ),
inference(cnfTransformation,[status(thm)],[f_682]) ).
tff(c_191849,plain,
! [V_5439] :
( segmentP('#skF_51',V_5439)
| ~ segmentP('#skF_50',V_5439)
| ~ ssList('#skF_53')
| ~ ssList('#skF_52')
| ~ ssList(V_5439)
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_394,c_191718]) ).
tff(c_192197,plain,
! [V_5444] :
( segmentP('#skF_51',V_5444)
| ~ segmentP('#skF_50',V_5444)
| ~ ssList(V_5444) ),
inference(demodulation,[status(thm),theory(equality)],[c_408,c_398,c_396,c_191849]) ).
tff(c_404,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_402,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_400,plain,
! [Y_2033] :
( ~ segmentP('#skF_48',Y_2033)
| ~ segmentP('#skF_49',Y_2033)
| ~ neq(Y_2033,nil)
| ~ ssList(Y_2033) ),
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_417,plain,
! [Y_2033] :
( ~ segmentP('#skF_50',Y_2033)
| ~ segmentP('#skF_51',Y_2033)
| ~ neq(Y_2033,nil)
| ~ ssList(Y_2033) ),
inference(demodulation,[status(thm),theory(equality)],[c_404,c_402,c_400]) ).
tff(c_192212,plain,
! [V_5445] :
( ~ neq(V_5445,nil)
| ~ segmentP('#skF_50',V_5445)
| ~ ssList(V_5445) ),
inference(resolution,[status(thm)],[c_192197,c_417]) ).
tff(c_192220,plain,
( ~ neq('#skF_50',nil)
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_270,c_192212]) ).
tff(c_192226,plain,
~ neq('#skF_50',nil),
inference(demodulation,[status(thm),theory(equality)],[c_408,c_192220]) ).
tff(c_192232,plain,
( ( nil = '#skF_50' )
| ~ ssList(nil)
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_162,c_192226]) ).
tff(c_192238,plain,
nil = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_408,c_168,c_192232]) ).
tff(c_192240,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_427,c_192238]) ).
tff(c_192242,plain,
nil = '#skF_50',
inference(splitRight,[status(thm)],[c_386]) ).
tff(c_192241,plain,
nil = '#skF_51',
inference(splitRight,[status(thm)],[c_386]) ).
tff(c_192257,plain,
'#skF_51' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_192242,c_192241]) ).
tff(c_384,plain,
( ( nil != '#skF_48' )
| ( nil != '#skF_49' ) ),
inference(cnfTransformation,[status(thm)],[f_1050]) ).
tff(c_418,plain,
( ( nil != '#skF_50' )
| ( nil != '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_404,c_402,c_384]) ).
tff(c_192287,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_192257,c_192242,c_192242,c_418]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC076+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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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:46:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 88.42/70.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 88.42/70.56
% 88.42/70.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 88.42/70.59
% 88.42/70.59 Inference rules
% 88.42/70.59 ----------------------
% 88.42/70.59 #Ref : 19
% 88.42/70.59 #Sup : 42463
% 88.42/70.59 #Fact : 0
% 88.42/70.59 #Define : 0
% 88.42/70.59 #Split : 305
% 88.42/70.59 #Chain : 0
% 88.42/70.59 #Close : 0
% 88.42/70.59
% 88.42/70.59 Ordering : KBO
% 88.42/70.59
% 88.42/70.59 Simplification rules
% 88.42/70.59 ----------------------
% 88.42/70.59 #Subsume : 8105
% 88.42/70.59 #Demod : 43004
% 88.42/70.59 #Tautology : 7396
% 88.42/70.59 #SimpNegUnit : 4292
% 88.42/70.59 #BackRed : 722
% 88.42/70.59
% 88.42/70.59 #Partial instantiations: 0
% 88.42/70.59 #Strategies tried : 1
% 88.42/70.59
% 88.42/70.59 Timing (in seconds)
% 88.42/70.59 ----------------------
% 88.42/70.59 Preprocessing : 0.91
% 88.42/70.59 Parsing : 0.42
% 88.42/70.59 CNF conversion : 0.12
% 88.42/70.59 Main loop : 68.63
% 88.42/70.59 Inferencing : 9.97
% 88.42/70.59 Reduction : 34.59
% 88.42/70.59 Demodulation : 25.51
% 88.42/70.59 BG Simplification : 0.33
% 88.42/70.59 Subsumption : 18.03
% 88.42/70.60 Abstraction : 0.53
% 88.42/70.60 MUC search : 0.00
% 88.42/70.60 Cooper : 0.00
% 88.42/70.60 Total : 69.59
% 88.42/70.60 Index Insertion : 0.00
% 88.42/70.60 Index Deletion : 0.00
% 88.42/70.60 Index Matching : 0.00
% 88.42/70.60 BG Taut test : 0.00
%------------------------------------------------------------------------------