TSTP Solution File: SEU174+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU174+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/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 : n009.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:54 EDT 2023
% Result : Theorem 26.41s 12.47s
% Output : CNFRefutation 26.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 80
% Syntax : Number of formulae : 139 ( 39 unt; 59 typ; 0 def)
% Number of atoms : 138 ( 45 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 108 ( 50 ~; 35 |; 4 &)
% ( 8 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 116 ( 54 >; 62 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 52 ( 52 usr; 5 con; 0-4 aty)
% Number of variables : 115 (; 113 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > element > disjoint > are_equipotent > empty > unordered_pair > subset_complement > set_union2 > set_intersection2 > set_difference > ordered_pair > complements_of_subsets > cartesian_product2 > #nlpp > union > singleton > powerset > empty_set > #skF_13 > #skF_24 > #skF_35 > #skF_17 > #skF_6 > #skF_31 > #skF_18 > #skF_20 > #skF_36 > #skF_22 > #skF_12 > #skF_38 > #skF_37 > #skF_34 > #skF_15 > #skF_32 > #skF_23 > #skF_19 > #skF_28 > #skF_33 > #skF_11 > #skF_7 > #skF_39 > #skF_9 > #skF_26 > #skF_3 > #skF_29 > #skF_2 > #skF_40 > #skF_8 > #skF_25 > #skF_27 > #skF_14 > #skF_1 > #skF_16 > #skF_21 > #skF_5 > #skF_30 > #skF_4 > #skF_10
%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('#skF_24',type,
'#skF_24': ( $i * $i * $i ) > $i ).
tff(complements_of_subsets,type,
complements_of_subsets: ( $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': ( $i * $i ) > $i ).
tff(union,type,
union: $i > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_36',type,
'#skF_36': $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_38',type,
'#skF_38': ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': ( $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_2',type,
'#skF_2': ( $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('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': ( $i * $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_296,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_576,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
tff(f_498,negated_conjecture,
~ ! [A,B] :
( element(B,powerset(powerset(A)))
=> ~ ( ( B != empty_set )
& ( complements_of_subsets(A,B) = empty_set ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t46_setfam_1) ).
tff(f_61,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_452,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
tff(f_395,lemma,
! [A,B] :
( subset(A,B)
=> ( set_intersection2(A,B) = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
tff(f_42,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_40,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_368,lemma,
! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
tff(f_440,lemma,
! [A,B] : ( set_union2(A,set_difference(B,A)) = set_union2(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).
tff(f_489,lemma,
! [A,B] :
( subset(A,B)
=> ( B = set_union2(A,set_difference(B,A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t45_xboole_1) ).
tff(f_99,axiom,
! [A,B,C] :
( ( C = set_union2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
tff(f_380,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
tff(f_285,lemma,
! [A,B] :
( ! [C] :
( in(C,A)
=> in(C,B) )
=> element(A,powerset(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_1) ).
tff(f_306,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_428,lemma,
! [A,B] :
( ( set_difference(A,B) = empty_set )
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
tff(f_591,lemma,
! [A,B] :
( disjoint(A,B)
<=> ( set_difference(A,B) = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
tff(f_213,axiom,
! [A,B] : ( set_intersection2(A,A) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
tff(f_526,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/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
tff(f_221,axiom,
! [A,B] :
( element(B,powerset(powerset(A)))
=> ( complements_of_subsets(A,complements_of_subsets(A,B)) = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
tff(f_171,axiom,
! [A,B] :
( element(B,powerset(powerset(A)))
=> ! [C] :
( element(C,powerset(powerset(A)))
=> ( ( C = complements_of_subsets(A,B) )
<=> ! [D] :
( element(D,powerset(A))
=> ( in(D,C)
<=> in(subset_complement(A,D),B) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_setfam_1) ).
tff(c_292,plain,
empty('#skF_29'),
inference(cnfTransformation,[status(thm)],[f_296]) ).
tff(c_495,plain,
! [A_390] :
( ( empty_set = A_390 )
| ~ empty(A_390) ),
inference(cnfTransformation,[status(thm)],[f_576]) ).
tff(c_508,plain,
empty_set = '#skF_29',
inference(resolution,[status(thm)],[c_292,c_495]) ).
tff(c_412,plain,
empty_set != '#skF_37',
inference(cnfTransformation,[status(thm)],[f_498]) ).
tff(c_515,plain,
'#skF_37' != '#skF_29',
inference(demodulation,[status(thm),theory(equality)],[c_508,c_412]) ).
tff(c_32,plain,
! [A_18] :
( ( empty_set = A_18 )
| in('#skF_3'(A_18),A_18) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_978,plain,
! [A_18] :
( ( A_18 = '#skF_29' )
| in('#skF_3'(A_18),A_18) ),
inference(demodulation,[status(thm),theory(equality)],[c_508,c_32]) ).
tff(c_414,plain,
element('#skF_37',powerset(powerset('#skF_36'))),
inference(cnfTransformation,[status(thm)],[f_498]) ).
tff(c_1476,plain,
! [A_504,B_505] :
( subset(A_504,B_505)
| ~ element(A_504,powerset(B_505)) ),
inference(cnfTransformation,[status(thm)],[f_452]) ).
tff(c_1495,plain,
subset('#skF_37',powerset('#skF_36')),
inference(resolution,[status(thm)],[c_414,c_1476]) ).
tff(c_1510,plain,
! [A_507,B_508] :
( ( set_intersection2(A_507,B_508) = A_507 )
| ~ subset(A_507,B_508) ),
inference(cnfTransformation,[status(thm)],[f_395]) ).
tff(c_1545,plain,
set_intersection2('#skF_37',powerset('#skF_36')) = '#skF_37',
inference(resolution,[status(thm)],[c_1495,c_1510]) ).
tff(c_10,plain,
! [B_10,A_9] : ( set_intersection2(B_10,A_9) = set_intersection2(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_8,plain,
! [B_8,A_7] : ( set_union2(B_8,A_7) = set_union2(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_328,plain,
! [A_225,B_226] : subset(set_intersection2(A_225,B_226),A_225),
inference(cnfTransformation,[status(thm)],[f_368]) ).
tff(c_380,plain,
! [A_264,B_265] : ( set_union2(A_264,set_difference(B_265,A_264)) = set_union2(A_264,B_265) ),
inference(cnfTransformation,[status(thm)],[f_440]) ).
tff(c_408,plain,
! [A_283,B_284] :
( ( set_union2(A_283,set_difference(B_284,A_283)) = B_284 )
| ~ subset(A_283,B_284) ),
inference(cnfTransformation,[status(thm)],[f_489]) ).
tff(c_1765,plain,
! [A_519,B_520] :
( ( set_union2(A_519,B_520) = B_520 )
| ~ subset(A_519,B_520) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_408]) ).
tff(c_1964,plain,
! [A_524,B_525] : ( set_union2(set_intersection2(A_524,B_525),A_524) = A_524 ),
inference(resolution,[status(thm)],[c_328,c_1765]) ).
tff(c_2173,plain,
! [A_532,B_533] : ( set_union2(A_532,set_intersection2(A_532,B_533)) = A_532 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_1964]) ).
tff(c_3154,plain,
! [B_570,A_571] : ( set_union2(B_570,set_intersection2(A_571,B_570)) = B_570 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_2173]) ).
tff(c_3211,plain,
set_union2(powerset('#skF_36'),'#skF_37') = powerset('#skF_36'),
inference(superposition,[status(thm),theory(equality)],[c_1545,c_3154]) ).
tff(c_4509,plain,
! [D_635,B_636,A_637] :
( ~ in(D_635,B_636)
| in(D_635,set_union2(A_637,B_636)) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_5001,plain,
! [D_656] :
( ~ in(D_656,'#skF_37')
| in(D_656,powerset('#skF_36')) ),
inference(superposition,[status(thm),theory(equality)],[c_3211,c_4509]) ).
tff(c_334,plain,
! [A_231,B_232] :
( element(A_231,B_232)
| ~ in(A_231,B_232) ),
inference(cnfTransformation,[status(thm)],[f_380]) ).
tff(c_5087,plain,
! [D_656] :
( element(D_656,powerset('#skF_36'))
| ~ in(D_656,'#skF_37') ),
inference(resolution,[status(thm)],[c_5001,c_334]) ).
tff(c_30,plain,
! [B_21] : ~ in(B_21,empty_set),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_512,plain,
! [B_21] : ~ in(B_21,'#skF_29'),
inference(demodulation,[status(thm),theory(equality)],[c_508,c_30]) ).
tff(c_11193,plain,
! [A_868,B_869] :
( in('#skF_27'(A_868,B_869),A_868)
| element(A_868,powerset(B_869)) ),
inference(cnfTransformation,[status(thm)],[f_285]) ).
tff(c_300,plain,
! [A_186] : subset(A_186,A_186),
inference(cnfTransformation,[status(thm)],[f_306]) ).
tff(c_368,plain,
! [A_257,B_258] :
( ( set_difference(A_257,B_258) = empty_set )
| ~ subset(A_257,B_258) ),
inference(cnfTransformation,[status(thm)],[f_428]) ).
tff(c_1719,plain,
! [A_517,B_518] :
( ( set_difference(A_517,B_518) = '#skF_29' )
| ~ subset(A_517,B_518) ),
inference(demodulation,[status(thm),theory(equality)],[c_508,c_368]) ).
tff(c_1764,plain,
! [A_186] : ( set_difference(A_186,A_186) = '#skF_29' ),
inference(resolution,[status(thm)],[c_300,c_1719]) ).
tff(c_454,plain,
! [A_326,B_327] :
( disjoint(A_326,B_327)
| ( set_difference(A_326,B_327) != A_326 ) ),
inference(cnfTransformation,[status(thm)],[f_591]) ).
tff(c_242,plain,
! [A_145] : ( set_intersection2(A_145,A_145) = A_145 ),
inference(cnfTransformation,[status(thm)],[f_213]) ).
tff(c_6426,plain,
! [A_715,B_716,C_717] :
( ~ disjoint(A_715,B_716)
| ~ in(C_717,set_intersection2(A_715,B_716)) ),
inference(cnfTransformation,[status(thm)],[f_526]) ).
tff(c_6465,plain,
! [A_718,C_719] :
( ~ disjoint(A_718,A_718)
| ~ in(C_719,A_718) ),
inference(superposition,[status(thm),theory(equality)],[c_242,c_6426]) ).
tff(c_6480,plain,
! [C_719,B_327] :
( ~ in(C_719,B_327)
| ( set_difference(B_327,B_327) != B_327 ) ),
inference(resolution,[status(thm)],[c_454,c_6465]) ).
tff(c_6492,plain,
! [C_719,B_327] :
( ~ in(C_719,B_327)
| ( B_327 != '#skF_29' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1764,c_6480]) ).
tff(c_11318,plain,
! [B_869] : element('#skF_29',powerset(B_869)),
inference(resolution,[status(thm)],[c_11193,c_6492]) ).
tff(c_410,plain,
complements_of_subsets('#skF_36','#skF_37') = empty_set,
inference(cnfTransformation,[status(thm)],[f_498]) ).
tff(c_511,plain,
complements_of_subsets('#skF_36','#skF_37') = '#skF_29',
inference(demodulation,[status(thm),theory(equality)],[c_508,c_410]) ).
tff(c_18600,plain,
! [A_1134,B_1135] :
( ( complements_of_subsets(A_1134,complements_of_subsets(A_1134,B_1135)) = B_1135 )
| ~ element(B_1135,powerset(powerset(A_1134))) ),
inference(cnfTransformation,[status(thm)],[f_221]) ).
tff(c_18634,plain,
complements_of_subsets('#skF_36',complements_of_subsets('#skF_36','#skF_37')) = '#skF_37',
inference(resolution,[status(thm)],[c_414,c_18600]) ).
tff(c_18651,plain,
complements_of_subsets('#skF_36','#skF_29') = '#skF_37',
inference(demodulation,[status(thm),theory(equality)],[c_511,c_18634]) ).
tff(c_67314,plain,
! [A_190347,D_190348,B_190349] :
( in(subset_complement(A_190347,D_190348),B_190349)
| ~ in(D_190348,complements_of_subsets(A_190347,B_190349))
| ~ element(D_190348,powerset(A_190347))
| ~ element(complements_of_subsets(A_190347,B_190349),powerset(powerset(A_190347)))
| ~ element(B_190349,powerset(powerset(A_190347))) ),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_67324,plain,
! [D_190348] :
( in(subset_complement('#skF_36',D_190348),'#skF_29')
| ~ in(D_190348,complements_of_subsets('#skF_36','#skF_29'))
| ~ element(D_190348,powerset('#skF_36'))
| ~ element('#skF_37',powerset(powerset('#skF_36')))
| ~ element('#skF_29',powerset(powerset('#skF_36'))) ),
inference(superposition,[status(thm),theory(equality)],[c_18651,c_67314]) ).
tff(c_67341,plain,
! [D_190348] :
( in(subset_complement('#skF_36',D_190348),'#skF_29')
| ~ in(D_190348,'#skF_37')
| ~ element(D_190348,powerset('#skF_36')) ),
inference(demodulation,[status(thm),theory(equality)],[c_11318,c_414,c_18651,c_67324]) ).
tff(c_67934,plain,
! [D_192214] :
( ~ in(D_192214,'#skF_37')
| ~ element(D_192214,powerset('#skF_36')) ),
inference(negUnitSimplification,[status(thm)],[c_512,c_67341]) ).
tff(c_68010,plain,
! [D_656] : ~ in(D_656,'#skF_37'),
inference(resolution,[status(thm)],[c_5087,c_67934]) ).
tff(c_6439,plain,
! [C_717] :
( ~ disjoint('#skF_37',powerset('#skF_36'))
| ~ in(C_717,'#skF_37') ),
inference(superposition,[status(thm),theory(equality)],[c_1545,c_6426]) ).
tff(c_6560,plain,
~ disjoint('#skF_37',powerset('#skF_36')),
inference(splitLeft,[status(thm)],[c_6439]) ).
tff(c_14299,plain,
! [A_965,B_966] :
( in('#skF_38'(A_965,B_966),set_intersection2(A_965,B_966))
| disjoint(A_965,B_966) ),
inference(cnfTransformation,[status(thm)],[f_526]) ).
tff(c_14350,plain,
( in('#skF_38'('#skF_37',powerset('#skF_36')),'#skF_37')
| disjoint('#skF_37',powerset('#skF_36')) ),
inference(superposition,[status(thm),theory(equality)],[c_1545,c_14299]) ).
tff(c_14372,plain,
in('#skF_38'('#skF_37',powerset('#skF_36')),'#skF_37'),
inference(negUnitSimplification,[status(thm)],[c_6560,c_14350]) ).
tff(c_68074,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_68010,c_14372]) ).
tff(c_68078,plain,
! [C_193043] : ~ in(C_193043,'#skF_37'),
inference(splitRight,[status(thm)],[c_6439]) ).
tff(c_68086,plain,
'#skF_37' = '#skF_29',
inference(resolution,[status(thm)],[c_978,c_68078]) ).
tff(c_68091,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_515,c_68086]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU174+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/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 : n009.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 11:54:09 EDT 2023
% 0.14/0.35 % CPUTime :
% 26.41/12.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.41/12.48
% 26.41/12.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 26.54/12.52
% 26.54/12.52 Inference rules
% 26.54/12.52 ----------------------
% 26.54/12.52 #Ref : 6
% 26.54/12.52 #Sup : 14660
% 26.54/12.52 #Fact : 6
% 26.54/12.52 #Define : 0
% 26.54/12.52 #Split : 8
% 26.54/12.52 #Chain : 0
% 26.54/12.52 #Close : 0
% 26.54/12.52
% 26.54/12.52 Ordering : KBO
% 26.54/12.52
% 26.54/12.52 Simplification rules
% 26.54/12.52 ----------------------
% 26.54/12.52 #Subsume : 6523
% 26.54/12.52 #Demod : 3080
% 26.54/12.52 #Tautology : 3126
% 26.54/12.52 #SimpNegUnit : 509
% 26.54/12.52 #BackRed : 94
% 26.54/12.52
% 26.54/12.52 #Partial instantiations: 96408
% 26.54/12.52 #Strategies tried : 1
% 26.54/12.52
% 26.54/12.52 Timing (in seconds)
% 26.54/12.52 ----------------------
% 26.54/12.52 Preprocessing : 0.82
% 26.54/12.52 Parsing : 0.38
% 26.54/12.52 CNF conversion : 0.09
% 26.54/12.52 Main loop : 10.63
% 26.54/12.52 Inferencing : 2.43
% 26.54/12.52 Reduction : 4.48
% 26.54/12.52 Demodulation : 2.91
% 26.54/12.52 BG Simplification : 0.13
% 26.54/12.52 Subsumption : 3.00
% 26.54/12.52 Abstraction : 0.13
% 26.54/12.52 MUC search : 0.00
% 26.54/12.52 Cooper : 0.00
% 26.54/12.52 Total : 11.51
% 26.54/12.52 Index Insertion : 0.00
% 26.54/12.52 Index Deletion : 0.00
% 26.54/12.52 Index Matching : 0.00
% 26.54/12.53 BG Taut test : 0.00
%------------------------------------------------------------------------------