TSTP Solution File: SET790+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET790+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 : n025.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 6.41s 2.47s
% Output : CNFRefutation 6.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 35
% Syntax : Number of formulae : 53 ( 9 unt; 32 typ; 0 def)
% Number of atoms : 60 ( 6 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 63 ( 24 ~; 20 |; 9 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 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 : 20 ( 20 usr; 4 con; 0-4 aty)
% Number of variables : 34 (; 34 !; 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_20 > #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_20',type,
'#skF_20': $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_185,negated_conjecture,
~ ! [R,E,M] :
( ( order(R,E)
& least(M,R,E) )
=> ! [X] :
( least(X,R,E)
=> ( M = X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV2) ).
tff(f_125,axiom,
! [R,E,M] :
( least(M,R,E)
<=> ( member(M,E)
& ! [X] :
( member(X,E)
=> apply(R,M,X) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',least) ).
tff(f_80,axiom,
! [R,E] :
( order(R,E)
<=> ( ! [X] :
( member(X,E)
=> apply(R,X,X) )
& ! [X,Y] :
( ( member(X,E)
& member(Y,E) )
=> ( ( apply(R,X,Y)
& apply(R,Y,X) )
=> ( X = Y ) ) )
& ! [X,Y,Z] :
( ( member(X,E)
& member(Y,E)
& member(Z,E) )
=> ( ( apply(R,X,Y)
& apply(R,Y,Z) )
=> apply(R,X,Z) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',order) ).
tff(c_214,plain,
least('#skF_20','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_221,plain,
! [M_85,E_86,R_87] :
( member(M_85,E_86)
| ~ least(M_85,R_87,E_86) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_228,plain,
member('#skF_20','#skF_18'),
inference(resolution,[status(thm)],[c_214,c_221]) ).
tff(c_216,plain,
least('#skF_19','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_229,plain,
member('#skF_19','#skF_18'),
inference(resolution,[status(thm)],[c_216,c_221]) ).
tff(c_218,plain,
order('#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_212,plain,
'#skF_20' != '#skF_19',
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_325,plain,
! [R_152,M_153,X_154,E_155] :
( apply(R_152,M_153,X_154)
| ~ member(X_154,E_155)
| ~ least(M_153,R_152,E_155) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_344,plain,
! [R_156,M_157] :
( apply(R_156,M_157,'#skF_19')
| ~ least(M_157,R_156,'#skF_18') ),
inference(resolution,[status(thm)],[c_229,c_325]) ).
tff(c_351,plain,
apply('#skF_17','#skF_20','#skF_19'),
inference(resolution,[status(thm)],[c_214,c_344]) ).
tff(c_354,plain,
! [R_161,M_162] :
( apply(R_161,M_162,'#skF_20')
| ~ least(M_162,R_161,'#skF_18') ),
inference(resolution,[status(thm)],[c_228,c_325]) ).
tff(c_362,plain,
apply('#skF_17','#skF_19','#skF_20'),
inference(resolution,[status(thm)],[c_216,c_354]) ).
tff(c_1764,plain,
! [Y_463,X_464,R_465,E_466] :
( ( Y_463 = X_464 )
| ~ apply(R_465,Y_463,X_464)
| ~ apply(R_465,X_464,Y_463)
| ~ member(Y_463,E_466)
| ~ member(X_464,E_466)
| ~ order(R_465,E_466) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_1848,plain,
! [E_466] :
( ( '#skF_20' = '#skF_19' )
| ~ apply('#skF_17','#skF_20','#skF_19')
| ~ member('#skF_19',E_466)
| ~ member('#skF_20',E_466)
| ~ order('#skF_17',E_466) ),
inference(resolution,[status(thm)],[c_362,c_1764]) ).
tff(c_1912,plain,
! [E_466] :
( ( '#skF_20' = '#skF_19' )
| ~ member('#skF_19',E_466)
| ~ member('#skF_20',E_466)
| ~ order('#skF_17',E_466) ),
inference(demodulation,[status(thm),theory(equality)],[c_351,c_1848]) ).
tff(c_1930,plain,
! [E_467] :
( ~ member('#skF_19',E_467)
| ~ member('#skF_20',E_467)
| ~ order('#skF_17',E_467) ),
inference(negUnitSimplification,[status(thm)],[c_212,c_1912]) ).
tff(c_1933,plain,
( ~ member('#skF_19','#skF_18')
| ~ member('#skF_20','#skF_18') ),
inference(resolution,[status(thm)],[c_218,c_1930]) ).
tff(c_1937,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_228,c_229,c_1933]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET790+4 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % 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.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 16:41:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.41/2.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.41/2.48
% 6.41/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.56/2.51
% 6.56/2.51 Inference rules
% 6.56/2.51 ----------------------
% 6.56/2.51 #Ref : 0
% 6.56/2.51 #Sup : 420
% 6.56/2.51 #Fact : 4
% 6.56/2.51 #Define : 0
% 6.56/2.51 #Split : 0
% 6.56/2.51 #Chain : 0
% 6.56/2.51 #Close : 0
% 6.56/2.51
% 6.56/2.51 Ordering : KBO
% 6.56/2.51
% 6.56/2.51 Simplification rules
% 6.56/2.51 ----------------------
% 6.56/2.51 #Subsume : 12
% 6.56/2.51 #Demod : 21
% 6.56/2.51 #Tautology : 41
% 6.56/2.51 #SimpNegUnit : 14
% 6.56/2.51 #BackRed : 0
% 6.56/2.51
% 6.56/2.51 #Partial instantiations: 0
% 6.56/2.51 #Strategies tried : 1
% 6.56/2.51
% 6.56/2.51 Timing (in seconds)
% 6.56/2.51 ----------------------
% 6.56/2.51 Preprocessing : 0.61
% 6.56/2.51 Parsing : 0.28
% 6.56/2.51 CNF conversion : 0.06
% 6.56/2.51 Main loop : 0.83
% 6.56/2.51 Inferencing : 0.32
% 6.56/2.51 Reduction : 0.20
% 6.56/2.51 Demodulation : 0.13
% 6.56/2.51 BG Simplification : 0.07
% 6.56/2.51 Subsumption : 0.19
% 6.56/2.51 Abstraction : 0.03
% 6.56/2.51 MUC search : 0.00
% 6.56/2.51 Cooper : 0.00
% 6.56/2.51 Total : 1.50
% 6.56/2.51 Index Insertion : 0.00
% 6.56/2.51 Index Deletion : 0.00
% 6.56/2.52 Index Matching : 0.00
% 6.56/2.52 BG Taut test : 0.00
%------------------------------------------------------------------------------