TSTP Solution File: SEU295+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU295+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 : n031.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:19 EDT 2023
% Result : Theorem 5.80s 2.28s
% Output : CNFRefutation 5.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 52
% Syntax : Number of formulae : 57 ( 4 unt; 50 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 25 >; 4 *; 0 +; 0 <<)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 25 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > 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 > set_intersection2 > #nlpp > 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_28 > #skF_24 > #skF_27 > #skF_23 > #skF_12 > #skF_20
%Foreground sorts:
%Background operators:
%Foreground operators:
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(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_21',type,
'#skF_21': $i ).
tff(empty_set,type,
empty_set: $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_28',type,
'#skF_28': $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(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_368,negated_conjecture,
~ ! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_finset_1) ).
tff(f_130,axiom,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc11_finset_1) ).
tff(c_272,plain,
finite('#skF_27'),
inference(cnfTransformation,[status(thm)],[f_368]) ).
tff(c_731,plain,
! [A_106,B_107] :
( finite(set_intersection2(A_106,B_107))
| ~ finite(A_106) ),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_270,plain,
~ finite(set_intersection2('#skF_27','#skF_28')),
inference(cnfTransformation,[status(thm)],[f_368]) ).
tff(c_734,plain,
~ finite('#skF_27'),
inference(resolution,[status(thm)],[c_731,c_270]) ).
tff(c_753,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_272,c_734]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU295+3 : TPTP v8.1.2. Released v3.2.0.
% 0.15/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 : n031.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 12:18:29 EDT 2023
% 0.15/0.37 % CPUTime :
% 5.80/2.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.80/2.28
% 5.80/2.28 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.89/2.31
% 5.89/2.31 Inference rules
% 5.89/2.31 ----------------------
% 5.89/2.31 #Ref : 0
% 5.89/2.31 #Sup : 90
% 5.89/2.31 #Fact : 0
% 5.89/2.31 #Define : 0
% 5.89/2.31 #Split : 0
% 5.89/2.31 #Chain : 0
% 5.89/2.31 #Close : 0
% 5.89/2.31
% 5.89/2.31 Ordering : KBO
% 5.89/2.31
% 5.89/2.31 Simplification rules
% 5.89/2.31 ----------------------
% 5.89/2.31 #Subsume : 6
% 5.89/2.31 #Demod : 119
% 5.89/2.31 #Tautology : 108
% 5.89/2.31 #SimpNegUnit : 0
% 5.89/2.31 #BackRed : 40
% 5.89/2.31
% 5.89/2.31 #Partial instantiations: 0
% 5.89/2.31 #Strategies tried : 1
% 5.89/2.31
% 5.89/2.31 Timing (in seconds)
% 5.89/2.31 ----------------------
% 5.89/2.31 Preprocessing : 0.63
% 5.89/2.31 Parsing : 0.33
% 5.89/2.31 CNF conversion : 0.06
% 5.89/2.31 Main loop : 0.59
% 5.89/2.31 Inferencing : 0.20
% 5.89/2.31 Reduction : 0.21
% 5.89/2.31 Demodulation : 0.15
% 5.89/2.31 BG Simplification : 0.04
% 5.89/2.31 Subsumption : 0.10
% 5.89/2.31 Abstraction : 0.02
% 5.89/2.31 MUC search : 0.00
% 5.89/2.31 Cooper : 0.00
% 5.89/2.31 Total : 1.26
% 5.89/2.31 Index Insertion : 0.00
% 5.89/2.31 Index Deletion : 0.00
% 5.89/2.31 Index Matching : 0.00
% 5.89/2.31 BG Taut test : 0.00
%------------------------------------------------------------------------------