TSTP Solution File: SEU387+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU387+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n027.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:36 EDT 2023
% Result : Theorem 12.01s 3.86s
% Output : CNFRefutation 12.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 79
% Syntax : Number of formulae : 100 ( 18 unt; 73 typ; 0 def)
% Number of atoms : 84 ( 6 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 88 ( 31 ~; 23 |; 28 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 68 ( 54 >; 14 *; 0 +; 0 <<)
% Number of predicates : 37 ( 35 usr; 1 prp; 0-3 aty)
% Number of functors : 38 ( 38 usr; 19 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relation_of2_as_subset > relation_of2 > upper_relstr_subset > subset > proper_element > in > filtered_subset > element > with_suprema_relstr > with_infima_relstr > v1_yellow_3 > upper_bounded_relstr > up_complete_relstr > trivial_carrier > transitive_relstr > strict_rel_str > relation_empty_yielding > relation > rel_str > reflexive_relstr > one_sorted_str > lower_bounded_relstr > join_complete_relstr > heyting_relstr > finite > empty_carrier > empty > distributive_relstr > directed_relstr > connected_relstr > complete_relstr > complemented_relstr > bounded_relstr > boolean_relstr > antisymmetric_relstr > rel_str_of > cartesian_product2 > #nlpp > the_carrier > the_InternalRel > powerset > bottom_of_relstr > boole_POSet > empty_set > #skF_25 > #skF_4 > #skF_18 > #skF_24 > #skF_11 > #skF_15 > #skF_19 > #skF_7 > #skF_3 > #skF_10 > #skF_16 > #skF_26 > #skF_14 > #skF_13 > #skF_2 > #skF_1 > #skF_21 > #skF_9 > #skF_23 > #skF_8 > #skF_30 > #skF_17 > #skF_22 > #skF_29 > #skF_28 > #skF_27 > #skF_12 > #skF_5 > #skF_6 > #skF_20
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff(bottom_of_relstr,type,
bottom_of_relstr: $i > $i ).
tff(empty_carrier,type,
empty_carrier: $i > $o ).
tff(directed_relstr,type,
directed_relstr: $i > $o ).
tff(relation,type,
relation: $i > $o ).
tff(the_InternalRel,type,
the_InternalRel: $i > $i ).
tff(complete_relstr,type,
complete_relstr: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff(with_suprema_relstr,type,
with_suprema_relstr: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(upper_relstr_subset,type,
upper_relstr_subset: ( $i * $i ) > $o ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(the_carrier,type,
the_carrier: $i > $i ).
tff(filtered_subset,type,
filtered_subset: ( $i * $i ) > $o ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(finite,type,
finite: $i > $o ).
tff(proper_element,type,
proper_element: ( $i * $i ) > $o ).
tff(heyting_relstr,type,
heyting_relstr: $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_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(antisymmetric_relstr,type,
antisymmetric_relstr: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(up_complete_relstr,type,
up_complete_relstr: $i > $o ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(strict_rel_str,type,
strict_rel_str: $i > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(boole_POSet,type,
boole_POSet: $i > $i ).
tff(reflexive_relstr,type,
reflexive_relstr: $i > $o ).
tff(one_sorted_str,type,
one_sorted_str: $i > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(v1_yellow_3,type,
v1_yellow_3: $i > $o ).
tff(lower_bounded_relstr,type,
lower_bounded_relstr: $i > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(transitive_relstr,type,
transitive_relstr: $i > $o ).
tff(rel_str_of,type,
rel_str_of: ( $i * $i ) > $i ).
tff(bounded_relstr,type,
bounded_relstr: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(connected_relstr,type,
connected_relstr: $i > $o ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_21',type,
'#skF_21': $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(distributive_relstr,type,
distributive_relstr: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff(relation_of2,type,
relation_of2: ( $i * $i * $i ) > $o ).
tff(with_infima_relstr,type,
with_infima_relstr: $i > $o ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff(boolean_relstr,type,
boolean_relstr: $i > $o ).
tff(rel_str,type,
rel_str: $i > $o ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(complemented_relstr,type,
complemented_relstr: $i > $o ).
tff(join_complete_relstr,type,
join_complete_relstr: $i > $o ).
tff(trivial_carrier,type,
trivial_carrier: $i > $o ).
tff(relation_of2_as_subset,type,
relation_of2_as_subset: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(upper_bounded_relstr,type,
upper_bounded_relstr: $i > $o ).
tff(f_503,axiom,
! [A] :
( ~ empty_carrier(boole_POSet(A))
& strict_rel_str(boole_POSet(A))
& reflexive_relstr(boole_POSet(A))
& transitive_relstr(boole_POSet(A))
& antisymmetric_relstr(boole_POSet(A))
& lower_bounded_relstr(boole_POSet(A))
& upper_bounded_relstr(boole_POSet(A))
& bounded_relstr(boole_POSet(A))
& directed_relstr(boole_POSet(A))
& up_complete_relstr(boole_POSet(A))
& join_complete_relstr(boole_POSet(A))
& ~ v1_yellow_3(boole_POSet(A))
& with_suprema_relstr(boole_POSet(A))
& with_infima_relstr(boole_POSet(A))
& complete_relstr(boole_POSet(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc8_yellow_6) ).
tff(f_855,negated_conjecture,
~ ! [A] :
( ~ empty(A)
=> ! [B] :
( ( ~ empty(B)
& filtered_subset(B,boole_POSet(A))
& upper_relstr_subset(B,boole_POSet(A))
& proper_element(B,powerset(the_carrier(boole_POSet(A))))
& element(B,powerset(the_carrier(boole_POSet(A)))) )
=> ! [C] :
~ ( in(C,B)
& empty(C) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_yellow19) ).
tff(f_296,axiom,
! [A] :
( strict_rel_str(boole_POSet(A))
& rel_str(boole_POSet(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
tff(f_876,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_823,axiom,
! [A] : ( bottom_of_relstr(boole_POSet(A)) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_yellow_1) ).
tff(f_917,axiom,
! [A] :
( ( ~ empty_carrier(A)
& reflexive_relstr(A)
& transitive_relstr(A)
& antisymmetric_relstr(A)
& lower_bounded_relstr(A)
& rel_str(A) )
=> ! [B] :
( ( ~ empty(B)
& filtered_subset(B,A)
& upper_relstr_subset(B,A)
& element(B,powerset(the_carrier(A))) )
=> ( proper_element(B,powerset(the_carrier(A)))
<=> ~ in(bottom_of_relstr(A),B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_waybel_7) ).
tff(c_274,plain,
! [A_53] : ~ empty_carrier(boole_POSet(A_53)),
inference(cnfTransformation,[status(thm)],[f_503]) ).
tff(c_564,plain,
~ empty('#skF_29'),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_278,plain,
! [A_53] : reflexive_relstr(boole_POSet(A_53)),
inference(cnfTransformation,[status(thm)],[f_503]) ).
tff(c_280,plain,
! [A_53] : transitive_relstr(boole_POSet(A_53)),
inference(cnfTransformation,[status(thm)],[f_503]) ).
tff(c_282,plain,
! [A_53] : antisymmetric_relstr(boole_POSet(A_53)),
inference(cnfTransformation,[status(thm)],[f_503]) ).
tff(c_284,plain,
! [A_53] : lower_bounded_relstr(boole_POSet(A_53)),
inference(cnfTransformation,[status(thm)],[f_503]) ).
tff(c_124,plain,
! [A_29] : rel_str(boole_POSet(A_29)),
inference(cnfTransformation,[status(thm)],[f_296]) ).
tff(c_562,plain,
filtered_subset('#skF_29',boole_POSet('#skF_28')),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_560,plain,
upper_relstr_subset('#skF_29',boole_POSet('#skF_28')),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_556,plain,
element('#skF_29',powerset(the_carrier(boole_POSet('#skF_28')))),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_554,plain,
in('#skF_30','#skF_29'),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_552,plain,
empty('#skF_30'),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_699,plain,
! [A_137] :
( ( empty_set = A_137 )
| ~ empty(A_137) ),
inference(cnfTransformation,[status(thm)],[f_876]) ).
tff(c_716,plain,
empty_set = '#skF_30',
inference(resolution,[status(thm)],[c_552,c_699]) ).
tff(c_546,plain,
! [A_83] : ( bottom_of_relstr(boole_POSet(A_83)) = empty_set ),
inference(cnfTransformation,[status(thm)],[f_823]) ).
tff(c_734,plain,
! [A_83] : ( bottom_of_relstr(boole_POSet(A_83)) = '#skF_30' ),
inference(demodulation,[status(thm),theory(equality)],[c_716,c_546]) ).
tff(c_558,plain,
proper_element('#skF_29',powerset(the_carrier(boole_POSet('#skF_28')))),
inference(cnfTransformation,[status(thm)],[f_855]) ).
tff(c_5345,plain,
! [A_736,B_737] :
( ~ in(bottom_of_relstr(A_736),B_737)
| ~ proper_element(B_737,powerset(the_carrier(A_736)))
| ~ element(B_737,powerset(the_carrier(A_736)))
| ~ upper_relstr_subset(B_737,A_736)
| ~ filtered_subset(B_737,A_736)
| empty(B_737)
| ~ rel_str(A_736)
| ~ lower_bounded_relstr(A_736)
| ~ antisymmetric_relstr(A_736)
| ~ transitive_relstr(A_736)
| ~ reflexive_relstr(A_736)
| empty_carrier(A_736) ),
inference(cnfTransformation,[status(thm)],[f_917]) ).
tff(c_5354,plain,
( ~ in(bottom_of_relstr(boole_POSet('#skF_28')),'#skF_29')
| ~ element('#skF_29',powerset(the_carrier(boole_POSet('#skF_28'))))
| ~ upper_relstr_subset('#skF_29',boole_POSet('#skF_28'))
| ~ filtered_subset('#skF_29',boole_POSet('#skF_28'))
| empty('#skF_29')
| ~ rel_str(boole_POSet('#skF_28'))
| ~ lower_bounded_relstr(boole_POSet('#skF_28'))
| ~ antisymmetric_relstr(boole_POSet('#skF_28'))
| ~ transitive_relstr(boole_POSet('#skF_28'))
| ~ reflexive_relstr(boole_POSet('#skF_28'))
| empty_carrier(boole_POSet('#skF_28')) ),
inference(resolution,[status(thm)],[c_558,c_5345]) ).
tff(c_5359,plain,
( empty('#skF_29')
| empty_carrier(boole_POSet('#skF_28')) ),
inference(demodulation,[status(thm),theory(equality)],[c_278,c_280,c_282,c_284,c_124,c_562,c_560,c_556,c_554,c_734,c_5354]) ).
tff(c_5361,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_274,c_564,c_5359]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU387+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 12:06:08 EDT 2023
% 0.12/0.34 % CPUTime :
% 12.01/3.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.01/3.86
% 12.01/3.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.01/3.89
% 12.01/3.89 Inference rules
% 12.01/3.89 ----------------------
% 12.01/3.89 #Ref : 2
% 12.01/3.89 #Sup : 939
% 12.01/3.89 #Fact : 0
% 12.01/3.89 #Define : 0
% 12.01/3.89 #Split : 38
% 12.01/3.89 #Chain : 0
% 12.01/3.89 #Close : 0
% 12.01/3.89
% 12.01/3.89 Ordering : KBO
% 12.01/3.89
% 12.01/3.89 Simplification rules
% 12.01/3.89 ----------------------
% 12.01/3.89 #Subsume : 277
% 12.01/3.89 #Demod : 460
% 12.01/3.89 #Tautology : 293
% 12.01/3.89 #SimpNegUnit : 238
% 12.01/3.89 #BackRed : 52
% 12.01/3.89
% 12.01/3.89 #Partial instantiations: 0
% 12.01/3.89 #Strategies tried : 1
% 12.01/3.89
% 12.01/3.89 Timing (in seconds)
% 12.01/3.89 ----------------------
% 12.01/3.90 Preprocessing : 0.77
% 12.01/3.90 Parsing : 0.40
% 12.01/3.90 CNF conversion : 0.07
% 12.01/3.90 Main loop : 2.05
% 12.01/3.90 Inferencing : 0.73
% 12.01/3.90 Reduction : 0.77
% 12.01/3.90 Demodulation : 0.53
% 12.01/3.90 BG Simplification : 0.07
% 12.01/3.90 Subsumption : 0.34
% 12.01/3.90 Abstraction : 0.03
% 12.01/3.90 MUC search : 0.00
% 12.01/3.90 Cooper : 0.00
% 12.01/3.90 Total : 2.87
% 12.01/3.90 Index Insertion : 0.00
% 12.01/3.90 Index Deletion : 0.00
% 12.01/3.90 Index Matching : 0.00
% 12.01/3.90 BG Taut test : 0.00
%------------------------------------------------------------------------------