TSTP Solution File: SET804+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET804+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 : n007.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 4.75s 2.05s
% Output : CNFRefutation 4.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 36
% Syntax : Number of formulae : 61 ( 15 unt; 33 typ; 0 def)
% Number of atoms : 54 ( 8 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 50 ( 24 ~; 15 |; 5 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 21 ( 21 usr; 5 con; 0-4 aty)
% Number of variables : 35 (; 34 !; 1 ?; 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_21 > #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_21',type,
'#skF_21': $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_190,negated_conjecture,
~ ! [R,E] :
( order(R,E)
=> ! [M1,M2] :
( ( min(M1,R,E)
& min(M2,R,E)
& ( M1 != M2 ) )
=> ~ ? [M] : least(M,R,E) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV16) ).
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_147,axiom,
! [R,E,M] :
( min(M,R,E)
<=> ( member(M,E)
& ! [X] :
( ( member(X,E)
& apply(R,X,M) )
=> ( M = X ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',min) ).
tff(c_212,plain,
least('#skF_21','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_222,plain,
! [M_86,E_87,R_88] :
( member(M_86,E_87)
| ~ least(M_86,R_88,E_87) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_226,plain,
member('#skF_21','#skF_18'),
inference(resolution,[status(thm)],[c_212,c_222]) ).
tff(c_218,plain,
min('#skF_19','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_216,plain,
min('#skF_20','#skF_17','#skF_18'),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_228,plain,
! [M_92,E_93,R_94] :
( member(M_92,E_93)
| ~ min(M_92,R_94,E_93) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_235,plain,
member('#skF_20','#skF_18'),
inference(resolution,[status(thm)],[c_216,c_228]) ).
tff(c_334,plain,
! [R_161,M_162,X_163,E_164] :
( apply(R_161,M_162,X_163)
| ~ member(X_163,E_164)
| ~ least(M_162,R_161,E_164) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_363,plain,
! [R_169,M_170] :
( apply(R_169,M_170,'#skF_20')
| ~ least(M_170,R_169,'#skF_18') ),
inference(resolution,[status(thm)],[c_235,c_334]) ).
tff(c_367,plain,
apply('#skF_17','#skF_21','#skF_20'),
inference(resolution,[status(thm)],[c_212,c_363]) ).
tff(c_478,plain,
! [X_196,M_197,R_198,E_199] :
( ( X_196 = M_197 )
| ~ apply(R_198,X_196,M_197)
| ~ member(X_196,E_199)
| ~ min(M_197,R_198,E_199) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_491,plain,
! [E_199] :
( ( '#skF_20' = '#skF_21' )
| ~ member('#skF_21',E_199)
| ~ min('#skF_20','#skF_17',E_199) ),
inference(resolution,[status(thm)],[c_367,c_478]) ).
tff(c_502,plain,
! [E_200] :
( ~ member('#skF_21',E_200)
| ~ min('#skF_20','#skF_17',E_200) ),
inference(splitLeft,[status(thm)],[c_491]) ).
tff(c_509,plain,
~ member('#skF_21','#skF_18'),
inference(resolution,[status(thm)],[c_216,c_502]) ).
tff(c_514,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_226,c_509]) ).
tff(c_515,plain,
'#skF_20' = '#skF_21',
inference(splitRight,[status(thm)],[c_491]) ).
tff(c_214,plain,
'#skF_20' != '#skF_19',
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_526,plain,
'#skF_19' != '#skF_21',
inference(demodulation,[status(thm),theory(equality)],[c_515,c_214]) ).
tff(c_236,plain,
member('#skF_19','#skF_18'),
inference(resolution,[status(thm)],[c_218,c_228]) ).
tff(c_353,plain,
! [R_165,M_166] :
( apply(R_165,M_166,'#skF_19')
| ~ least(M_166,R_165,'#skF_18') ),
inference(resolution,[status(thm)],[c_236,c_334]) ).
tff(c_357,plain,
apply('#skF_17','#skF_21','#skF_19'),
inference(resolution,[status(thm)],[c_212,c_353]) ).
tff(c_494,plain,
! [E_199] :
( ( '#skF_19' = '#skF_21' )
| ~ member('#skF_21',E_199)
| ~ min('#skF_19','#skF_17',E_199) ),
inference(resolution,[status(thm)],[c_357,c_478]) ).
tff(c_566,plain,
! [E_206] :
( ~ member('#skF_21',E_206)
| ~ min('#skF_19','#skF_17',E_206) ),
inference(negUnitSimplification,[status(thm)],[c_526,c_494]) ).
tff(c_573,plain,
~ member('#skF_21','#skF_18'),
inference(resolution,[status(thm)],[c_218,c_566]) ).
tff(c_578,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_226,c_573]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET804+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.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:21:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.75/2.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.75/2.06
% 4.75/2.06 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.84/2.08
% 4.84/2.08 Inference rules
% 4.84/2.08 ----------------------
% 4.84/2.08 #Ref : 0
% 4.84/2.08 #Sup : 83
% 4.84/2.08 #Fact : 0
% 4.84/2.08 #Define : 0
% 4.84/2.08 #Split : 3
% 4.84/2.08 #Chain : 0
% 4.84/2.08 #Close : 0
% 4.84/2.08
% 4.84/2.08 Ordering : KBO
% 4.84/2.08
% 4.84/2.08 Simplification rules
% 4.84/2.08 ----------------------
% 4.84/2.08 #Subsume : 8
% 4.84/2.08 #Demod : 19
% 4.84/2.09 #Tautology : 15
% 4.84/2.09 #SimpNegUnit : 1
% 4.84/2.09 #BackRed : 11
% 4.84/2.09
% 4.84/2.09 #Partial instantiations: 0
% 4.84/2.09 #Strategies tried : 1
% 4.84/2.09
% 4.84/2.09 Timing (in seconds)
% 4.84/2.09 ----------------------
% 4.84/2.09 Preprocessing : 0.59
% 4.84/2.09 Parsing : 0.27
% 4.84/2.09 CNF conversion : 0.06
% 4.84/2.09 Main loop : 0.44
% 4.84/2.09 Inferencing : 0.14
% 4.84/2.09 Reduction : 0.12
% 4.84/2.09 Demodulation : 0.08
% 4.84/2.09 BG Simplification : 0.05
% 4.84/2.09 Subsumption : 0.11
% 4.84/2.09 Abstraction : 0.02
% 4.84/2.09 MUC search : 0.00
% 4.84/2.09 Cooper : 0.00
% 4.84/2.09 Total : 1.08
% 4.84/2.09 Index Insertion : 0.00
% 4.84/2.09 Index Deletion : 0.00
% 4.84/2.09 Index Matching : 0.00
% 4.84/2.09 BG Taut test : 0.00
%------------------------------------------------------------------------------