TSTP Solution File: SEU187+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU187+2 : 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 : n003.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:57 EDT 2023
% Result : Theorem 25.61s 10.75s
% Output : CNFRefutation 25.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 113
% Syntax : Number of formulae : 169 ( 34 unt; 97 typ; 0 def)
% Number of atoms : 121 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 101 ( 52 ~; 29 |; 6 &)
% ( 9 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 194 ( 92 >; 102 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 89 ( 89 usr; 5 con; 0-5 aty)
% Number of variables : 90 (; 86 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > element > disjoint > are_equipotent > relation > empty > subset_difference > unordered_pair > union_of_subsets > subset_complement > set_union2 > set_intersection2 > set_difference > relation_composition > ordered_pair > meet_of_subsets > complements_of_subsets > cartesian_product2 > #nlpp > union > singleton > set_meet > relation_rng > relation_inverse > relation_field > relation_dom > powerset > cast_to_subset > empty_set > #skF_13 > #skF_49 > #skF_24 > #skF_37 > #skF_62 > #skF_11 > #skF_41 > #skF_44 > #skF_6 > #skF_17 > #skF_33 > #skF_66 > #skF_26 > #skF_30 > #skF_1 > #skF_18 > #skF_47 > #skF_55 > #skF_63 > #skF_32 > #skF_56 > #skF_60 > #skF_31 > #skF_38 > #skF_4 > #skF_3 > #skF_39 > #skF_29 > #skF_64 > #skF_12 > #skF_53 > #skF_48 > #skF_45 > #skF_10 > #skF_35 > #skF_19 > #skF_67 > #skF_42 > #skF_8 > #skF_36 > #skF_57 > #skF_59 > #skF_20 > #skF_28 > #skF_34 > #skF_15 > #skF_23 > #skF_14 > #skF_54 > #skF_52 > #skF_50 > #skF_46 > #skF_2 > #skF_21 > #skF_40 > #skF_25 > #skF_43 > #skF_7 > #skF_27 > #skF_61 > #skF_9 > #skF_5 > #skF_22 > #skF_58 > #skF_65 > #skF_16 > #skF_51
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff(are_equipotent,type,
are_equipotent: ( $i * $i ) > $o ).
tff(subset_difference,type,
subset_difference: ( $i * $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': ( $i * $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i * $i ) > $i ).
tff(complements_of_subsets,type,
complements_of_subsets: ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': ( $i * $i ) > $i ).
tff('#skF_62',type,
'#skF_62': ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(relation_field,type,
relation_field: $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(cast_to_subset,type,
cast_to_subset: $i > $i ).
tff(union,type,
union: $i > $i ).
tff('#skF_41',type,
'#skF_41': ( $i * $i ) > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_44',type,
'#skF_44': ( $i * $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff('#skF_33',type,
'#skF_33': ( $i * $i * $i ) > $i ).
tff(relation_inverse,type,
relation_inverse: $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_66',type,
'#skF_66': $i > $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': ( $i * $i ) > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff('#skF_47',type,
'#skF_47': ( $i * $i * $i ) > $i ).
tff(meet_of_subsets,type,
meet_of_subsets: ( $i * $i ) > $i ).
tff('#skF_55',type,
'#skF_55': $i ).
tff('#skF_63',type,
'#skF_63': ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_32',type,
'#skF_32': ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_56',type,
'#skF_56': $i ).
tff('#skF_60',type,
'#skF_60': ( $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': ( $i * $i ) > $i ).
tff('#skF_38',type,
'#skF_38': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i * $i ) > $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i * $i ) > $i ).
tff('#skF_64',type,
'#skF_64': $i > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff('#skF_53',type,
'#skF_53': $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_48',type,
'#skF_48': ( $i * $i * $i ) > $i ).
tff('#skF_45',type,
'#skF_45': ( $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_35',type,
'#skF_35': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_67',type,
'#skF_67': ( $i * $i ) > $i ).
tff(relation_composition,type,
relation_composition: ( $i * $i ) > $i ).
tff('#skF_42',type,
'#skF_42': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_36',type,
'#skF_36': ( $i * $i ) > $i ).
tff('#skF_57',type,
'#skF_57': $i > $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_59',type,
'#skF_59': $i > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff(set_meet,type,
set_meet: $i > $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff('#skF_54',type,
'#skF_54': $i > $i ).
tff('#skF_52',type,
'#skF_52': ( $i * $i ) > $i ).
tff('#skF_50',type,
'#skF_50': ( $i * $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i * $i ) > $i ).
tff(union_of_subsets,type,
union_of_subsets: ( $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_40',type,
'#skF_40': ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(subset_complement,type,
subset_complement: ( $i * $i ) > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_25',type,
'#skF_25': ( $i * $i * $i ) > $i ).
tff('#skF_43',type,
'#skF_43': ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_61',type,
'#skF_61': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i ) > $i ).
tff('#skF_58',type,
'#skF_58': $i ).
tff('#skF_65',type,
'#skF_65': $i > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff('#skF_51',type,
'#skF_51': $i > $i ).
tff(f_62,axiom,
! [A] :
( relation(A)
<=> ! [B] :
~ ( in(B,A)
& ! [C,D] : ( B != ordered_pair(C,D) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_1) ).
tff(f_490,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_450,axiom,
? [A] :
( empty(A)
& relation(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_relat_1) ).
tff(f_854,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_649,lemma,
! [A,B] :
( ( set_difference(A,B) = empty_set )
<=> subset(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
tff(f_869,lemma,
! [A,B] :
( disjoint(A,B)
<=> ( set_difference(A,B) = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
tff(f_370,axiom,
! [A,B] : ( set_intersection2(A,A) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
tff(f_792,lemma,
! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] : ~ in(C,set_intersection2(A,B)) )
& ~ ( ? [C] : in(C,set_intersection2(A,B))
& disjoint(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
tff(f_44,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_560,axiom,
! [A] : ( set_union2(A,empty_set) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_boole) ).
tff(f_832,negated_conjecture,
~ ( ( relation_dom(empty_set) = empty_set )
& ( relation_rng(empty_set) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_relat_1) ).
tff(f_94,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_171,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_dom(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(C,D),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
tff(f_214,axiom,
! [A] :
( relation(A)
=> ( relation_field(A) = set_union2(relation_dom(A),relation_rng(A)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_relat_1) ).
tff(f_617,axiom,
! [A,B] :
( ! [C] :
( in(C,A)
<=> in(C,B) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
tff(f_204,axiom,
! [A] :
( relation(A)
=> ! [B] :
( ( B = relation_rng(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] : in(ordered_pair(D,C),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
tff(c_24,plain,
! [A_14] :
( in('#skF_1'(A_14),A_14)
| relation(A_14) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_440,plain,
! [A_450] : subset(A_450,A_450),
inference(cnfTransformation,[status(thm)],[f_490]) ).
tff(c_416,plain,
empty('#skF_53'),
inference(cnfTransformation,[status(thm)],[f_450]) ).
tff(c_28301,plain,
! [A_96508] :
( ( empty_set = A_96508 )
| ~ empty(A_96508) ),
inference(cnfTransformation,[status(thm)],[f_854]) ).
tff(c_28315,plain,
empty_set = '#skF_53',
inference(resolution,[status(thm)],[c_416,c_28301]) ).
tff(c_526,plain,
! [A_532,B_533] :
( ( set_difference(A_532,B_533) = empty_set )
| ~ subset(A_532,B_533) ),
inference(cnfTransformation,[status(thm)],[f_649]) ).
tff(c_30466,plain,
! [A_96718,B_96719] :
( ( set_difference(A_96718,B_96719) = '#skF_53' )
| ~ subset(A_96718,B_96719) ),
inference(demodulation,[status(thm),theory(equality)],[c_28315,c_526]) ).
tff(c_30519,plain,
! [A_450] : ( set_difference(A_450,A_450) = '#skF_53' ),
inference(resolution,[status(thm)],[c_440,c_30466]) ).
tff(c_624,plain,
! [A_622,B_623] :
( disjoint(A_622,B_623)
| ( set_difference(A_622,B_623) != A_622 ) ),
inference(cnfTransformation,[status(thm)],[f_869]) ).
tff(c_366,plain,
! [A_401] : ( set_intersection2(A_401,A_401) = A_401 ),
inference(cnfTransformation,[status(thm)],[f_370]) ).
tff(c_33905,plain,
! [A_96856,B_96857,C_96858] :
( ~ disjoint(A_96856,B_96857)
| ~ in(C_96858,set_intersection2(A_96856,B_96857)) ),
inference(cnfTransformation,[status(thm)],[f_792]) ).
tff(c_33951,plain,
! [A_96859,C_96860] :
( ~ disjoint(A_96859,A_96859)
| ~ in(C_96860,A_96859) ),
inference(superposition,[status(thm),theory(equality)],[c_366,c_33905]) ).
tff(c_33966,plain,
! [C_96860,B_623] :
( ~ in(C_96860,B_623)
| ( set_difference(B_623,B_623) != B_623 ) ),
inference(resolution,[status(thm)],[c_624,c_33951]) ).
tff(c_33984,plain,
! [C_96861,B_96862] :
( ~ in(C_96861,B_96862)
| ( B_96862 != '#skF_53' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_30519,c_33966]) ).
tff(c_34063,plain,
relation('#skF_53'),
inference(resolution,[status(thm)],[c_24,c_33984]) ).
tff(c_29080,plain,
! [B_96605,A_96606] : ( set_union2(B_96605,A_96606) = set_union2(A_96606,B_96605) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_472,plain,
! [A_494] : ( set_union2(A_494,empty_set) = A_494 ),
inference(cnfTransformation,[status(thm)],[f_560]) ).
tff(c_28366,plain,
! [A_494] : ( set_union2(A_494,'#skF_53') = A_494 ),
inference(demodulation,[status(thm),theory(equality)],[c_28315,c_472]) ).
tff(c_29120,plain,
! [A_96606] : ( set_union2('#skF_53',A_96606) = A_96606 ),
inference(superposition,[status(thm),theory(equality)],[c_29080,c_28366]) ).
tff(c_688,plain,
! [A_689] :
( ( empty_set = A_689 )
| ~ empty(A_689) ),
inference(cnfTransformation,[status(thm)],[f_854]) ).
tff(c_702,plain,
empty_set = '#skF_53',
inference(resolution,[status(thm)],[c_416,c_688]) ).
tff(c_602,plain,
( ( relation_rng(empty_set) != empty_set )
| ( relation_dom(empty_set) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_832]) ).
tff(c_660,plain,
relation_dom(empty_set) != empty_set,
inference(splitLeft,[status(thm)],[c_602]) ).
tff(c_708,plain,
relation_dom('#skF_53') != '#skF_53',
inference(demodulation,[status(thm),theory(equality)],[c_702,c_702,c_660]) ).
tff(c_62,plain,
! [A_56] :
( ( empty_set = A_56 )
| in('#skF_10'(A_56),A_56) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_1009,plain,
! [A_56] :
( ( A_56 = '#skF_53' )
| in('#skF_10'(A_56),A_56) ),
inference(demodulation,[status(thm),theory(equality)],[c_702,c_62]) ).
tff(c_2063,plain,
! [A_840,B_841] :
( ( set_difference(A_840,B_841) = '#skF_53' )
| ~ subset(A_840,B_841) ),
inference(demodulation,[status(thm),theory(equality)],[c_702,c_526]) ).
tff(c_2096,plain,
! [A_450] : ( set_difference(A_450,A_450) = '#skF_53' ),
inference(resolution,[status(thm)],[c_440,c_2063]) ).
tff(c_6416,plain,
! [A_1043,B_1044,C_1045] :
( ~ disjoint(A_1043,B_1044)
| ~ in(C_1045,set_intersection2(A_1043,B_1044)) ),
inference(cnfTransformation,[status(thm)],[f_792]) ).
tff(c_6467,plain,
! [A_1046,C_1047] :
( ~ disjoint(A_1046,A_1046)
| ~ in(C_1047,A_1046) ),
inference(superposition,[status(thm),theory(equality)],[c_366,c_6416]) ).
tff(c_6482,plain,
! [C_1047,B_623] :
( ~ in(C_1047,B_623)
| ( set_difference(B_623,B_623) != B_623 ) ),
inference(resolution,[status(thm)],[c_624,c_6467]) ).
tff(c_6500,plain,
! [C_1048,B_1049] :
( ~ in(C_1048,B_1049)
| ( B_1049 != '#skF_53' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2096,c_6482]) ).
tff(c_6571,plain,
relation('#skF_53'),
inference(resolution,[status(thm)],[c_24,c_6500]) ).
tff(c_27985,plain,
! [C_96136,A_96137] :
( in(ordered_pair(C_96136,'#skF_29'(A_96137,relation_dom(A_96137),C_96136)),A_96137)
| ~ in(C_96136,relation_dom(A_96137))
| ~ relation(A_96137) ),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_60,plain,
! [B_59] : ~ in(B_59,empty_set),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_712,plain,
! [B_59] : ~ in(B_59,'#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_702,c_60]) ).
tff(c_28101,plain,
! [C_96136] :
( ~ in(C_96136,relation_dom('#skF_53'))
| ~ relation('#skF_53') ),
inference(resolution,[status(thm)],[c_27985,c_712]) ).
tff(c_28145,plain,
! [C_96318] : ~ in(C_96318,relation_dom('#skF_53')),
inference(demodulation,[status(thm),theory(equality)],[c_6571,c_28101]) ).
tff(c_28237,plain,
relation_dom('#skF_53') = '#skF_53',
inference(resolution,[status(thm)],[c_1009,c_28145]) ).
tff(c_28267,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_708,c_28237]) ).
tff(c_28269,plain,
relation_dom(empty_set) = empty_set,
inference(splitRight,[status(thm)],[c_602]) ).
tff(c_28324,plain,
relation_dom('#skF_53') = '#skF_53',
inference(demodulation,[status(thm),theory(equality)],[c_28315,c_28315,c_28269]) ).
tff(c_35755,plain,
! [A_96943] :
( ( set_union2(relation_dom(A_96943),relation_rng(A_96943)) = relation_field(A_96943) )
| ~ relation(A_96943) ),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_35830,plain,
( ( set_union2('#skF_53',relation_rng('#skF_53')) = relation_field('#skF_53') )
| ~ relation('#skF_53') ),
inference(superposition,[status(thm),theory(equality)],[c_28324,c_35755]) ).
tff(c_35836,plain,
relation_rng('#skF_53') = relation_field('#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_34063,c_29120,c_35830]) ).
tff(c_28268,plain,
relation_rng(empty_set) != empty_set,
inference(splitRight,[status(thm)],[c_602]) ).
tff(c_28323,plain,
relation_rng('#skF_53') != '#skF_53',
inference(demodulation,[status(thm),theory(equality)],[c_28315,c_28315,c_28268]) ).
tff(c_35837,plain,
relation_field('#skF_53') != '#skF_53',
inference(demodulation,[status(thm),theory(equality)],[c_35836,c_28323]) ).
tff(c_53603,plain,
! [A_188096,B_188097] :
( in('#skF_60'(A_188096,B_188097),B_188097)
| in('#skF_61'(A_188096,B_188097),A_188096)
| ( B_188097 = A_188096 ) ),
inference(cnfTransformation,[status(thm)],[f_617]) ).
tff(c_28326,plain,
! [B_59] : ~ in(B_59,'#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_28315,c_60]) ).
tff(c_53795,plain,
! [A_188096] :
( in('#skF_61'(A_188096,'#skF_53'),A_188096)
| ( A_188096 = '#skF_53' ) ),
inference(resolution,[status(thm)],[c_53603,c_28326]) ).
tff(c_66700,plain,
! [A_221528,C_221529] :
( in(ordered_pair('#skF_39'(A_221528,relation_rng(A_221528),C_221529),C_221529),A_221528)
| ~ in(C_221529,relation_rng(A_221528))
| ~ relation(A_221528) ),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_66836,plain,
! [C_221529] :
( ~ in(C_221529,relation_rng('#skF_53'))
| ~ relation('#skF_53') ),
inference(resolution,[status(thm)],[c_66700,c_28326]) ).
tff(c_66891,plain,
! [C_221710] : ~ in(C_221710,relation_field('#skF_53')),
inference(demodulation,[status(thm),theory(equality)],[c_34063,c_35836,c_66836]) ).
tff(c_66927,plain,
relation_field('#skF_53') = '#skF_53',
inference(resolution,[status(thm)],[c_53795,c_66891]) ).
tff(c_66995,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_35837,c_66927]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU187+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % 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.14/0.36 % Computer : n003.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 11:41:08 EDT 2023
% 0.14/0.36 % CPUTime :
% 25.61/10.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 25.61/10.76
% 25.61/10.76 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 25.71/10.80
% 25.71/10.80 Inference rules
% 25.71/10.80 ----------------------
% 25.71/10.80 #Ref : 10
% 25.71/10.80 #Sup : 13740
% 25.71/10.80 #Fact : 0
% 25.71/10.80 #Define : 0
% 25.71/10.80 #Split : 4
% 25.71/10.80 #Chain : 0
% 25.71/10.80 #Close : 0
% 25.71/10.80
% 25.71/10.80 Ordering : KBO
% 25.71/10.80
% 25.71/10.80 Simplification rules
% 25.71/10.80 ----------------------
% 25.71/10.80 #Subsume : 4509
% 25.71/10.80 #Demod : 3170
% 25.71/10.80 #Tautology : 3292
% 25.71/10.80 #SimpNegUnit : 445
% 25.71/10.80 #BackRed : 56
% 25.71/10.80
% 25.71/10.80 #Partial instantiations: 108224
% 25.71/10.80 #Strategies tried : 1
% 25.71/10.80
% 25.71/10.80 Timing (in seconds)
% 25.71/10.80 ----------------------
% 25.71/10.80 Preprocessing : 0.96
% 25.71/10.80 Parsing : 0.46
% 25.71/10.80 CNF conversion : 0.10
% 25.71/10.80 Main loop : 8.70
% 25.71/10.80 Inferencing : 2.45
% 25.71/10.80 Reduction : 3.33
% 25.71/10.80 Demodulation : 2.25
% 25.71/10.80 BG Simplification : 0.14
% 25.71/10.80 Subsumption : 2.20
% 25.71/10.80 Abstraction : 0.13
% 25.71/10.80 MUC search : 0.00
% 25.71/10.80 Cooper : 0.00
% 25.71/10.80 Total : 9.72
% 25.71/10.80 Index Insertion : 0.00
% 25.71/10.81 Index Deletion : 0.00
% 25.71/10.81 Index Matching : 0.00
% 25.71/10.81 BG Taut test : 0.00
%------------------------------------------------------------------------------