TSTP Solution File: SET793+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET793+4 : TPTP v8.1.2. Released v3.2.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 : n009.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 10:57:01 EDT 2023
% Result : Theorem 14.47s 4.61s
% Output : CNFRefutation 14.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 36
% Syntax : Number of formulae : 70 ( 12 unt; 31 typ; 0 def)
% Number of atoms : 109 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 112 ( 42 ~; 55 |; 6 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 77 ( 28 >; 49 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 3 con; 0-4 aty)
% Number of variables : 75 (; 75 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ least_upper_bound > greatest_lower_bound > upper_bound > min > max > lower_bound > least > greatest > apply > total_order > order > member > #nlpp > #skF_13 > #skF_6 > #skF_18 > #skF_17 > #skF_12 > #skF_19 > #skF_3 > #skF_15 > #skF_16 > #skF_8 > #skF_11 > #skF_9 > #skF_14 > #skF_2 > #skF_7 > #skF_1 > #skF_5 > #skF_4 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff(upper_bound,type,
upper_bound: ( $i * $i * $i ) > $o ).
tff(greatest_lower_bound,type,
greatest_lower_bound: ( $i * $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff(apply,type,
apply: ( $i * $i * $i ) > $o ).
tff('#skF_17',type,
'#skF_17': $i ).
tff(least_upper_bound,type,
least_upper_bound: ( $i * $i * $i * $i ) > $o ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': $i ).
tff(total_order,type,
total_order: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $i ).
tff(greatest,type,
greatest: ( $i * $i * $i ) > $o ).
tff(lower_bound,type,
lower_bound: ( $i * $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(min,type,
min: ( $i * $i * $i ) > $o ).
tff(least,type,
least: ( $i * $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(order,type,
order: ( $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(max,type,
max: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_182,negated_conjecture,
~ ! [R,E,M] :
( ( total_order(R,E)
& max(M,R,E) )
=> greatest(M,R,E) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV5) ).
tff(f_136,axiom,
! [R,E,M] :
( max(M,R,E)
<=> ( member(M,E)
& ! [X] :
( ( member(X,E)
& apply(R,M,X) )
=> ( M = X ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',max) ).
tff(f_100,axiom,
! [R,E,M] :
( upper_bound(M,R,E)
<=> ! [X] :
( member(X,E)
=> apply(R,X,M) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',upper_bound) ).
tff(f_93,axiom,
! [R,E] :
( total_order(R,E)
<=> ( order(R,E)
& ! [X,Y] :
( ( member(X,E)
& member(Y,E) )
=> ( apply(R,X,Y)
| apply(R,Y,X) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',total_order) ).
tff(f_116,axiom,
! [R,E,M] :
( greatest(M,R,E)
<=> ( member(M,E)
& ! [X] :
( member(X,E)
=> apply(R,X,M) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',greatest) ).
tff(c_212,plain,
~ greatest('#skF_19','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_182]) ).
tff(c_214,plain,
max('#skF_19','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_182]) ).
tff(c_224,plain,
! [M_87,E_88,R_89] :
( member(M_87,E_88)
| ~ max(M_87,R_89,E_88) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_228,plain,
member('#skF_19','#skF_18'),
inference(resolution,[status(thm)],[c_214,c_224]) ).
tff(c_216,plain,
total_order('#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_182]) ).
tff(c_144,plain,
! [R_29,E_30,M_31] :
( member('#skF_9'(R_29,E_30,M_31),E_30)
| upper_bound(M_31,R_29,E_30) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_586,plain,
! [R_246,Y_247,X_248,E_249] :
( apply(R_246,Y_247,X_248)
| apply(R_246,X_248,Y_247)
| ~ member(Y_247,E_249)
| ~ member(X_248,E_249)
| ~ total_order(R_246,E_249) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_8446,plain,
! [X_1288,E_1291,R_1287,M_1290,R_1289] :
( apply(R_1287,'#skF_9'(R_1289,E_1291,M_1290),X_1288)
| apply(R_1287,X_1288,'#skF_9'(R_1289,E_1291,M_1290))
| ~ member(X_1288,E_1291)
| ~ total_order(R_1287,E_1291)
| upper_bound(M_1290,R_1289,E_1291) ),
inference(resolution,[status(thm)],[c_144,c_586]) ).
tff(c_142,plain,
! [R_29,E_30,M_31] :
( ~ apply(R_29,'#skF_9'(R_29,E_30,M_31),M_31)
| upper_bound(M_31,R_29,E_30) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_8513,plain,
! [R_1295,X_1296,E_1297] :
( apply(R_1295,X_1296,'#skF_9'(R_1295,E_1297,X_1296))
| ~ member(X_1296,E_1297)
| ~ total_order(R_1295,E_1297)
| upper_bound(X_1296,R_1295,E_1297) ),
inference(resolution,[status(thm)],[c_8446,c_142]) ).
tff(c_168,plain,
! [X_58,M_55,R_53,E_54] :
( ( X_58 = M_55 )
| ~ apply(R_53,M_55,X_58)
| ~ member(X_58,E_54)
| ~ max(M_55,R_53,E_54) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_11947,plain,
! [R_1630,E_1631,X_1632,E_1633] :
( ( '#skF_9'(R_1630,E_1631,X_1632) = X_1632 )
| ~ member('#skF_9'(R_1630,E_1631,X_1632),E_1633)
| ~ max(X_1632,R_1630,E_1633)
| ~ member(X_1632,E_1631)
| ~ total_order(R_1630,E_1631)
| upper_bound(X_1632,R_1630,E_1631) ),
inference(resolution,[status(thm)],[c_8513,c_168]) ).
tff(c_11952,plain,
! [R_1634,E_1635,M_1636] :
( ( '#skF_9'(R_1634,E_1635,M_1636) = M_1636 )
| ~ max(M_1636,R_1634,E_1635)
| ~ member(M_1636,E_1635)
| ~ total_order(R_1634,E_1635)
| upper_bound(M_1636,R_1634,E_1635) ),
inference(resolution,[status(thm)],[c_144,c_11947]) ).
tff(c_377,plain,
! [R_173,E_174,M_175] :
( member('#skF_11'(R_173,E_174,M_175),E_174)
| greatest(M_175,R_173,E_174)
| ~ member(M_175,E_174) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_140,plain,
! [R_29,X_34,M_31,E_30] :
( apply(R_29,X_34,M_31)
| ~ member(X_34,E_30)
| ~ upper_bound(M_31,R_29,E_30) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_1677,plain,
! [R_445,E_447,R_448,M_449,M_446] :
( apply(R_448,'#skF_11'(R_445,E_447,M_446),M_449)
| ~ upper_bound(M_449,R_448,E_447)
| greatest(M_446,R_445,E_447)
| ~ member(M_446,E_447) ),
inference(resolution,[status(thm)],[c_377,c_140]) ).
tff(c_156,plain,
! [R_41,E_42,M_43] :
( ~ apply(R_41,'#skF_11'(R_41,E_42,M_43),M_43)
| greatest(M_43,R_41,E_42)
| ~ member(M_43,E_42) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_1698,plain,
! [M_449,R_445,E_447] :
( ~ upper_bound(M_449,R_445,E_447)
| greatest(M_449,R_445,E_447)
| ~ member(M_449,E_447) ),
inference(resolution,[status(thm)],[c_1677,c_156]) ).
tff(c_12038,plain,
! [M_1639,R_1640,E_1641] :
( greatest(M_1639,R_1640,E_1641)
| ( '#skF_9'(R_1640,E_1641,M_1639) = M_1639 )
| ~ max(M_1639,R_1640,E_1641)
| ~ member(M_1639,E_1641)
| ~ total_order(R_1640,E_1641) ),
inference(resolution,[status(thm)],[c_11952,c_1698]) ).
tff(c_12044,plain,
( greatest('#skF_19','#skF_17','#skF_18')
| ( '#skF_9'('#skF_17','#skF_18','#skF_19') = '#skF_19' )
| ~ member('#skF_19','#skF_18')
| ~ total_order('#skF_17','#skF_18') ),
inference(resolution,[status(thm)],[c_214,c_12038]) ).
tff(c_12048,plain,
( greatest('#skF_19','#skF_17','#skF_18')
| ( '#skF_9'('#skF_17','#skF_18','#skF_19') = '#skF_19' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_228,c_12044]) ).
tff(c_12049,plain,
'#skF_9'('#skF_17','#skF_18','#skF_19') = '#skF_19',
inference(negUnitSimplification,[status(thm)],[c_212,c_12048]) ).
tff(c_8503,plain,
! [R_1289,X_1288,E_1291] :
( apply(R_1289,X_1288,'#skF_9'(R_1289,E_1291,X_1288))
| ~ member(X_1288,E_1291)
| ~ total_order(R_1289,E_1291)
| upper_bound(X_1288,R_1289,E_1291) ),
inference(resolution,[status(thm)],[c_8446,c_142]) ).
tff(c_12071,plain,
( apply('#skF_17','#skF_19','#skF_19')
| ~ member('#skF_19','#skF_18')
| ~ total_order('#skF_17','#skF_18')
| upper_bound('#skF_19','#skF_17','#skF_18') ),
inference(superposition,[status(thm),theory(equality)],[c_12049,c_8503]) ).
tff(c_12157,plain,
( apply('#skF_17','#skF_19','#skF_19')
| upper_bound('#skF_19','#skF_17','#skF_18') ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_228,c_12071]) ).
tff(c_12182,plain,
upper_bound('#skF_19','#skF_17','#skF_18'),
inference(splitLeft,[status(thm)],[c_12157]) ).
tff(c_12193,plain,
( greatest('#skF_19','#skF_17','#skF_18')
| ~ member('#skF_19','#skF_18') ),
inference(resolution,[status(thm)],[c_12182,c_1698]) ).
tff(c_12205,plain,
greatest('#skF_19','#skF_17','#skF_18'),
inference(demodulation,[status(thm),theory(equality)],[c_228,c_12193]) ).
tff(c_12207,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_212,c_12205]) ).
tff(c_12209,plain,
~ upper_bound('#skF_19','#skF_17','#skF_18'),
inference(splitRight,[status(thm)],[c_12157]) ).
tff(c_12208,plain,
apply('#skF_17','#skF_19','#skF_19'),
inference(splitRight,[status(thm)],[c_12157]) ).
tff(c_12137,plain,
( ~ apply('#skF_17','#skF_19','#skF_19')
| upper_bound('#skF_19','#skF_17','#skF_18') ),
inference(superposition,[status(thm),theory(equality)],[c_12049,c_142]) ).
tff(c_12337,plain,
upper_bound('#skF_19','#skF_17','#skF_18'),
inference(demodulation,[status(thm),theory(equality)],[c_12208,c_12137]) ).
tff(c_12338,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12209,c_12337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET793+4 : TPTP v8.1.2. Released v3.2.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.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 16:14:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 14.47/4.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.47/4.62
% 14.47/4.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.47/4.65
% 14.47/4.65 Inference rules
% 14.47/4.65 ----------------------
% 14.47/4.65 #Ref : 0
% 14.47/4.65 #Sup : 3313
% 14.47/4.65 #Fact : 16
% 14.47/4.65 #Define : 0
% 14.47/4.65 #Split : 2
% 14.47/4.65 #Chain : 0
% 14.47/4.65 #Close : 0
% 14.47/4.65
% 14.47/4.65 Ordering : KBO
% 14.47/4.65
% 14.47/4.65 Simplification rules
% 14.47/4.65 ----------------------
% 14.47/4.65 #Subsume : 219
% 14.47/4.65 #Demod : 100
% 14.47/4.65 #Tautology : 212
% 14.47/4.65 #SimpNegUnit : 3
% 14.47/4.65 #BackRed : 0
% 14.47/4.65
% 14.47/4.65 #Partial instantiations: 0
% 14.47/4.65 #Strategies tried : 1
% 14.47/4.65
% 14.47/4.65 Timing (in seconds)
% 14.47/4.65 ----------------------
% 14.47/4.65 Preprocessing : 0.58
% 14.47/4.65 Parsing : 0.28
% 14.47/4.65 CNF conversion : 0.05
% 14.47/4.65 Main loop : 2.91
% 14.47/4.65 Inferencing : 1.09
% 14.47/4.65 Reduction : 0.57
% 14.47/4.65 Demodulation : 0.36
% 14.47/4.65 BG Simplification : 0.11
% 14.47/4.65 Subsumption : 0.88
% 14.47/4.65 Abstraction : 0.14
% 14.47/4.65 MUC search : 0.00
% 14.47/4.65 Cooper : 0.00
% 14.47/4.65 Total : 3.54
% 14.47/4.65 Index Insertion : 0.00
% 14.47/4.65 Index Deletion : 0.00
% 14.47/4.65 Index Matching : 0.00
% 14.47/4.65 BG Taut test : 0.00
%------------------------------------------------------------------------------