TSTP Solution File: SET799+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET799+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 : 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 10:57:02 EDT 2023
% Result : Theorem 8.60s 2.99s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 52
% Syntax : Number of formulae : 67 ( 9 unt; 48 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 33 ( 10 ~; 8 |; 6 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 99 ( 41 >; 58 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-4 aty)
% Number of functors : 34 ( 34 usr; 7 con; 0-4 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ least_upper_bound > greatest_lower_bound > upper_bound > min > max > lower_bound > least > greatest > apply > total_order > subset > order > member > equal_set > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_13 > #skF_11 > #skF_6 > #skF_17 > #skF_20 > #skF_25 > #skF_12 > #skF_18 > #skF_19 > #skF_3 > #skF_10 > #skF_8 > #skF_21 > #skF_15 > #skF_14 > #skF_22 > #skF_2 > #skF_24 > #skF_23 > #skF_7 > #skF_1 > #skF_9 > #skF_5 > #skF_4 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(equal_set,type,
equal_set: ( $i * $i ) > $o ).
tff(upper_bound,type,
upper_bound: ( $i * $i * $i ) > $o ).
tff(power_set,type,
power_set: $i > $i ).
tff(greatest_lower_bound,type,
greatest_lower_bound: ( $i * $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(product,type,
product: $i > $i ).
tff('#skF_20',type,
'#skF_20': $i ).
tff(apply,type,
apply: ( $i * $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff(least_upper_bound,type,
least_upper_bound: ( $i * $i * $i * $i ) > $o ).
tff(sum,type,
sum: $i > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i * $i ) > $i ).
tff(total_order,type,
total_order: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(greatest,type,
greatest: ( $i * $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(lower_bound,type,
lower_bound: ( $i * $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_15',type,
'#skF_15': ( $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_22',type,
'#skF_22': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_23',type,
'#skF_23': $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_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_282,negated_conjecture,
~ ! [R,E] :
( order(R,E)
=> ! [X1,X2] :
( ( subset(X1,E)
& subset(X2,E)
& subset(X1,X2) )
=> ! [M1,M2] :
( ( least_upper_bound(M1,X1,R,E)
& least_upper_bound(M2,X2,R,E) )
=> apply(R,M1,M2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV11) ).
tff(f_250,axiom,
! [A,X,R,E] :
( least_upper_bound(A,X,R,E)
<=> ( member(A,X)
& upper_bound(A,R,X)
& ! [M] :
( ( member(M,E)
& upper_bound(M,R,X) )
=> apply(R,A,M) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',least_upper_bound) ).
tff(f_57,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
tff(f_190,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(c_270,plain,
~ apply('#skF_20','#skF_24','#skF_25'),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_272,plain,
least_upper_bound('#skF_25','#skF_23','#skF_20','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_381,plain,
! [A_183,R_184,X_185,E_186] :
( upper_bound(A_183,R_184,X_185)
| ~ least_upper_bound(A_183,X_185,R_184,E_186) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_389,plain,
upper_bound('#skF_25','#skF_20','#skF_23'),
inference(resolution,[status(thm)],[c_272,c_381]) ).
tff(c_276,plain,
subset('#skF_22','#skF_23'),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_274,plain,
least_upper_bound('#skF_24','#skF_22','#skF_20','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_310,plain,
! [A_163,X_164,R_165,E_166] :
( member(A_163,X_164)
| ~ least_upper_bound(A_163,X_164,R_165,E_166) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_317,plain,
member('#skF_24','#skF_22'),
inference(resolution,[status(thm)],[c_274,c_310]) ).
tff(c_391,plain,
! [X_191,B_192,A_193] :
( member(X_191,B_192)
| ~ member(X_191,A_193)
| ~ subset(A_193,B_192) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_443,plain,
! [B_195] :
( member('#skF_24',B_195)
| ~ subset('#skF_22',B_195) ),
inference(resolution,[status(thm)],[c_317,c_391]) ).
tff(c_466,plain,
member('#skF_24','#skF_23'),
inference(resolution,[status(thm)],[c_276,c_443]) ).
tff(c_3556,plain,
! [R_361,X_362,M_363,E_364] :
( apply(R_361,X_362,M_363)
| ~ member(X_362,E_364)
| ~ upper_bound(M_363,R_361,E_364) ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_5912,plain,
! [R_465,M_466] :
( apply(R_465,'#skF_24',M_466)
| ~ upper_bound(M_466,R_465,'#skF_23') ),
inference(resolution,[status(thm)],[c_466,c_3556]) ).
tff(c_5915,plain,
apply('#skF_20','#skF_24','#skF_25'),
inference(resolution,[status(thm)],[c_389,c_5912]) ).
tff(c_5919,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_270,c_5915]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET799+4 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.15 % 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.15/0.36 % Computer : n002.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 17:14:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 8.60/2.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.60/2.99
% 8.60/2.99 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.60/3.02
% 8.60/3.02 Inference rules
% 8.60/3.02 ----------------------
% 8.60/3.02 #Ref : 0
% 8.60/3.02 #Sup : 1294
% 8.60/3.02 #Fact : 0
% 8.60/3.02 #Define : 0
% 8.60/3.02 #Split : 21
% 8.60/3.02 #Chain : 0
% 8.60/3.02 #Close : 0
% 8.60/3.02
% 8.60/3.02 Ordering : KBO
% 8.60/3.02
% 8.60/3.02 Simplification rules
% 8.60/3.02 ----------------------
% 8.60/3.02 #Subsume : 94
% 8.60/3.02 #Demod : 152
% 8.60/3.02 #Tautology : 181
% 8.60/3.02 #SimpNegUnit : 1
% 8.60/3.02 #BackRed : 0
% 8.60/3.02
% 8.60/3.02 #Partial instantiations: 0
% 8.60/3.02 #Strategies tried : 1
% 8.60/3.02
% 8.60/3.02 Timing (in seconds)
% 8.60/3.02 ----------------------
% 8.60/3.03 Preprocessing : 0.67
% 8.60/3.03 Parsing : 0.30
% 8.60/3.03 CNF conversion : 0.07
% 8.60/3.03 Main loop : 1.34
% 8.60/3.03 Inferencing : 0.41
% 8.60/3.03 Reduction : 0.43
% 8.60/3.03 Demodulation : 0.29
% 8.60/3.03 BG Simplification : 0.07
% 8.60/3.03 Subsumption : 0.34
% 8.60/3.03 Abstraction : 0.05
% 8.60/3.03 MUC search : 0.00
% 8.60/3.03 Cooper : 0.00
% 8.60/3.03 Total : 2.06
% 8.60/3.03 Index Insertion : 0.00
% 8.60/3.03 Index Deletion : 0.00
% 8.60/3.03 Index Matching : 0.00
% 8.60/3.03 BG Taut test : 0.00
%------------------------------------------------------------------------------