TSTP Solution File: SEU303+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU303+3 : 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 : n016.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:58:20 EDT 2023
% Result : Theorem 7.41s 2.67s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 55
% Syntax : Number of formulae : 64 ( 5 unt; 52 typ; 0 def)
% Number of atoms : 29 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 10 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 28 >; 4 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 24 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > with_non_empty_elements > transfinite_sequence > relation_non_empty > relation_empty_yielding > relation > ordinal_yielding > ordinal > one_to_one > natural > function_yielding > function > finite > epsilon_transitive > epsilon_connected > empty > being_limit_ordinal > relation_image > #nlpp > relation_rng > relation_dom > powerset > positive_rationals > empty_set > #skF_9 > #skF_18 > #skF_11 > #skF_15 > #skF_1 > #skF_25 > #skF_19 > #skF_7 > #skF_10 > #skF_16 > #skF_26 > #skF_14 > #skF_5 > #skF_6 > #skF_13 > #skF_2 > #skF_3 > #skF_21 > #skF_8 > #skF_4 > #skF_17 > #skF_22 > #skF_24 > #skF_27 > #skF_23 > #skF_12 > #skF_20
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(with_non_empty_elements,type,
with_non_empty_elements: $i > $o ).
tff(epsilon_connected,type,
epsilon_connected: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(positive_rationals,type,
positive_rationals: $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(relation_non_empty,type,
relation_non_empty: $i > $o ).
tff('#skF_15',type,
'#skF_15': $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff(epsilon_transitive,type,
epsilon_transitive: $i > $o ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(finite,type,
finite: $i > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(ordinal_yielding,type,
ordinal_yielding: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_19',type,
'#skF_19': $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(ordinal,type,
ordinal: $i > $o ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(relation_image,type,
relation_image: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_21',type,
'#skF_21': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff(function_yielding,type,
function_yielding: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(being_limit_ordinal,type,
being_limit_ordinal: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff(natural,type,
natural: $i > $o ).
tff(transfinite_sequence,type,
transfinite_sequence: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(f_420,negated_conjecture,
~ ! [A] :
( ( relation(A)
& function(A) )
=> ( finite(relation_dom(A))
=> finite(relation_rng(A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finset_1) ).
tff(f_399,axiom,
! [A] :
( relation(A)
=> ( relation_image(A,relation_dom(A)) = relation_rng(A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t146_relat_1) ).
tff(f_407,axiom,
! [A,B] :
( ( relation(B)
& function(B) )
=> ( finite(A)
=> finite(relation_image(B,A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_finset_1) ).
tff(c_292,plain,
relation('#skF_27'),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_290,plain,
function('#skF_27'),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_288,plain,
finite(relation_dom('#skF_27')),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_280,plain,
! [A_39] :
( ( relation_image(A_39,relation_dom(A_39)) = relation_rng(A_39) )
| ~ relation(A_39) ),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_1439,plain,
! [B_170,A_171] :
( finite(relation_image(B_170,A_171))
| ~ finite(A_171)
| ~ function(B_170)
| ~ relation(B_170) ),
inference(cnfTransformation,[status(thm)],[f_407]) ).
tff(c_2193,plain,
! [A_226] :
( finite(relation_rng(A_226))
| ~ finite(relation_dom(A_226))
| ~ function(A_226)
| ~ relation(A_226)
| ~ relation(A_226) ),
inference(superposition,[status(thm),theory(equality)],[c_280,c_1439]) ).
tff(c_286,plain,
~ finite(relation_rng('#skF_27')),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_2196,plain,
( ~ finite(relation_dom('#skF_27'))
| ~ function('#skF_27')
| ~ relation('#skF_27') ),
inference(resolution,[status(thm)],[c_2193,c_286]) ).
tff(c_2227,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_292,c_290,c_288,c_2196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU303+3 : 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.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 12:09:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 7.41/2.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.41/2.67
% 7.41/2.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.41/2.70
% 7.41/2.70 Inference rules
% 7.41/2.70 ----------------------
% 7.41/2.70 #Ref : 0
% 7.41/2.70 #Sup : 462
% 7.41/2.70 #Fact : 0
% 7.41/2.70 #Define : 0
% 7.41/2.70 #Split : 11
% 7.41/2.70 #Chain : 0
% 7.41/2.70 #Close : 0
% 7.41/2.70
% 7.41/2.70 Ordering : KBO
% 7.41/2.70
% 7.41/2.70 Simplification rules
% 7.41/2.70 ----------------------
% 7.41/2.70 #Subsume : 130
% 7.41/2.70 #Demod : 245
% 7.41/2.70 #Tautology : 162
% 7.41/2.70 #SimpNegUnit : 7
% 7.41/2.70 #BackRed : 38
% 7.41/2.70
% 7.41/2.70 #Partial instantiations: 0
% 7.41/2.70 #Strategies tried : 1
% 7.41/2.70
% 7.41/2.70 Timing (in seconds)
% 7.41/2.70 ----------------------
% 7.41/2.70 Preprocessing : 0.62
% 7.41/2.70 Parsing : 0.33
% 7.41/2.70 CNF conversion : 0.06
% 7.41/2.70 Main loop : 0.94
% 7.41/2.70 Inferencing : 0.31
% 7.41/2.70 Reduction : 0.31
% 7.41/2.70 Demodulation : 0.22
% 7.41/2.70 BG Simplification : 0.04
% 7.41/2.70 Subsumption : 0.20
% 7.41/2.70 Abstraction : 0.02
% 7.41/2.70 MUC search : 0.00
% 7.41/2.70 Cooper : 0.00
% 7.41/2.70 Total : 1.61
% 7.41/2.70 Index Insertion : 0.00
% 7.41/2.70 Index Deletion : 0.00
% 7.41/2.70 Index Matching : 0.00
% 7.41/2.70 BG Taut test : 0.00
%------------------------------------------------------------------------------