TSTP Solution File: SEU106+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU106+1 : 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/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 : n022.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:37 EDT 2023
% Result : Theorem 17.99s 6.33s
% Output : CNFRefutation 18.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 53
% Syntax : Number of formulae : 137 ( 57 unt; 35 typ; 0 def)
% Number of atoms : 183 ( 29 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 154 ( 73 ~; 66 |; 4 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 29 >; 7 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-2 aty)
% Number of variables : 103 (; 101 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > preboolean > ordinal > one_to_one > natural > function > finite > epsilon_transitive > epsilon_connected > empty > diff_closed > cup_closed > cap_closed > symmetric_difference > set_union2 > set_intersection2 > set_difference > #nlpp > powerset > empty_set > #skF_9 > #skF_7 > #skF_4 > #skF_1 > #skF_5 > #skF_10 > #skF_13 > #skF_2 > #skF_3 > #skF_8 > #skF_11 > #skF_12 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(epsilon_connected,type,
epsilon_connected: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(cup_closed,type,
cup_closed: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $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(function,type,
function: $i > $o ).
tff(symmetric_difference,type,
symmetric_difference: ( $i * $i ) > $i ).
tff(ordinal,type,
ordinal: $i > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(preboolean,type,
preboolean: $i > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(diff_closed,type,
diff_closed: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(cap_closed,type,
cap_closed: $i > $o ).
tff(natural,type,
natural: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_218,negated_conjecture,
~ ! [A] :
( ~ empty(A)
=> ( ! [B] :
( element(B,A)
=> ! [C] :
( element(C,A)
=> ( in(symmetric_difference(B,C),A)
& in(set_union2(B,C),A) ) ) )
=> preboolean(A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_finsub_1) ).
tff(f_189,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_202,axiom,
! [A] :
( preboolean(A)
<=> ! [B,C] :
( ( in(B,A)
& in(C,A) )
=> ( in(set_union2(B,C),A)
& in(set_difference(B,C),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1) ).
tff(f_238,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
tff(f_246,axiom,
! [A,B,C] :
( ( in(A,B)
& element(B,powerset(C)) )
=> element(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
tff(f_58,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_224,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
tff(f_136,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_259,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_220,axiom,
! [A] : ( set_union2(A,empty_set) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_boole) ).
tff(f_65,axiom,
! [A] :
? [B] : element(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
tff(f_109,axiom,
! [A,B] : ( set_intersection2(A,A) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
tff(f_191,axiom,
! [A,B] : ( set_difference(A,B) = symmetric_difference(A,set_intersection2(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t100_xboole_1) ).
tff(f_248,axiom,
! [A] : ( symmetric_difference(A,empty_set) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_boole) ).
tff(f_226,axiom,
! [A] : ( set_intersection2(A,empty_set) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_boole) ).
tff(f_274,axiom,
! [A,B] : ( set_intersection2(A,B) = symmetric_difference(symmetric_difference(A,B),set_union2(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t95_xboole_1) ).
tff(f_56,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_232,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
tff(c_118,plain,
~ preboolean('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_104,plain,
! [A_48] : subset(A_48,A_48),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_114,plain,
! [A_52] :
( in('#skF_12'(A_52),A_52)
| preboolean(A_52) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_138,plain,
! [A_72,B_73] :
( element(A_72,powerset(B_73))
| ~ subset(A_72,B_73) ),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_3684,plain,
! [A_378,C_379,B_380] :
( element(A_378,C_379)
| ~ element(B_380,powerset(C_379))
| ~ in(A_378,B_380) ),
inference(cnfTransformation,[status(thm)],[f_246]) ).
tff(c_3872,plain,
! [A_392,B_393,A_394] :
( element(A_392,B_393)
| ~ in(A_392,A_394)
| ~ subset(A_394,B_393) ),
inference(resolution,[status(thm)],[c_138,c_3684]) ).
tff(c_3901,plain,
! [A_52,B_393] :
( element('#skF_12'(A_52),B_393)
| ~ subset(A_52,B_393)
| preboolean(A_52) ),
inference(resolution,[status(thm)],[c_114,c_3872]) ).
tff(c_116,plain,
! [A_52] :
( in('#skF_11'(A_52),A_52)
| preboolean(A_52) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_3902,plain,
! [A_52,B_393] :
( element('#skF_11'(A_52),B_393)
| ~ subset(A_52,B_393)
| preboolean(A_52) ),
inference(resolution,[status(thm)],[c_116,c_3872]) ).
tff(c_120,plain,
~ empty('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_16,plain,
! [B_12,A_11] : ( set_intersection2(B_12,A_11) = set_intersection2(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_122,plain,
! [B_62,C_64] :
( in(set_union2(B_62,C_64),'#skF_13')
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_2170,plain,
! [A_268,B_269] :
( element(A_268,B_269)
| ~ in(A_268,B_269) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_2181,plain,
! [B_62,C_64] :
( element(set_union2(B_62,C_64),'#skF_13')
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(resolution,[status(thm)],[c_122,c_2170]) ).
tff(c_64,plain,
empty('#skF_5'),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_232,plain,
! [A_111] :
( ( empty_set = A_111 )
| ~ empty(A_111) ),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_249,plain,
empty_set = '#skF_5',
inference(resolution,[status(thm)],[c_64,c_232]) ).
tff(c_170,plain,
! [A_105] : ( set_union2(A_105,empty_set) = A_105 ),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_176,plain,
! [A_105] :
( in(A_105,'#skF_13')
| ~ element(empty_set,'#skF_13')
| ~ element(A_105,'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_170,c_122]) ).
tff(c_285,plain,
! [A_105] :
( in(A_105,'#skF_13')
| ~ element('#skF_5','#skF_13')
| ~ element(A_105,'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_249,c_176]) ).
tff(c_286,plain,
~ element('#skF_5','#skF_13'),
inference(splitLeft,[status(thm)],[c_285]) ).
tff(c_22,plain,
! [A_17] : element('#skF_1'(A_17),A_17),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_44,plain,
! [A_36] : ( set_intersection2(A_36,A_36) = A_36 ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_1003,plain,
! [A_189,B_190] : ( symmetric_difference(A_189,set_intersection2(A_189,B_190)) = set_difference(A_189,B_190) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_1044,plain,
! [A_36] : ( symmetric_difference(A_36,A_36) = set_difference(A_36,A_36) ),
inference(superposition,[status(thm),theory(equality)],[c_44,c_1003]) ).
tff(c_144,plain,
! [A_78] : ( symmetric_difference(A_78,empty_set) = A_78 ),
inference(cnfTransformation,[status(thm)],[f_248]) ).
tff(c_323,plain,
! [A_78] : ( symmetric_difference(A_78,'#skF_5') = A_78 ),
inference(demodulation,[status(thm),theory(equality)],[c_249,c_144]) ).
tff(c_130,plain,
! [A_68] : ( set_intersection2(A_68,empty_set) = empty_set ),
inference(cnfTransformation,[status(thm)],[f_226]) ).
tff(c_251,plain,
! [A_68] : ( set_intersection2(A_68,'#skF_5') = '#skF_5' ),
inference(demodulation,[status(thm),theory(equality)],[c_249,c_249,c_130]) ).
tff(c_126,plain,
! [A_65] : ( set_union2(A_65,empty_set) = A_65 ),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_252,plain,
! [A_65] : ( set_union2(A_65,'#skF_5') = A_65 ),
inference(demodulation,[status(thm),theory(equality)],[c_249,c_126]) ).
tff(c_1731,plain,
! [A_242,B_243] : ( symmetric_difference(symmetric_difference(A_242,B_243),set_union2(A_242,B_243)) = set_intersection2(A_242,B_243) ),
inference(cnfTransformation,[status(thm)],[f_274]) ).
tff(c_1806,plain,
! [A_65] : ( symmetric_difference(symmetric_difference(A_65,'#skF_5'),A_65) = set_intersection2(A_65,'#skF_5') ),
inference(superposition,[status(thm),theory(equality)],[c_252,c_1731]) ).
tff(c_1820,plain,
! [A_65] : ( set_difference(A_65,A_65) = '#skF_5' ),
inference(demodulation,[status(thm),theory(equality)],[c_1044,c_323,c_251,c_1806]) ).
tff(c_1867,plain,
! [A_245] : ( symmetric_difference(A_245,A_245) = '#skF_5' ),
inference(demodulation,[status(thm),theory(equality)],[c_1820,c_1044]) ).
tff(c_124,plain,
! [B_62,C_64] :
( in(symmetric_difference(B_62,C_64),'#skF_13')
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_1898,plain,
! [A_245] :
( in('#skF_5','#skF_13')
| ~ element(A_245,'#skF_13')
| ~ element(A_245,'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_1867,c_124]) ).
tff(c_1993,plain,
! [A_249] :
( ~ element(A_249,'#skF_13')
| ~ element(A_249,'#skF_13') ),
inference(splitLeft,[status(thm)],[c_1898]) ).
tff(c_2006,plain,
~ element('#skF_1'('#skF_13'),'#skF_13'),
inference(resolution,[status(thm)],[c_22,c_1993]) ).
tff(c_2018,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_2006]) ).
tff(c_2019,plain,
in('#skF_5','#skF_13'),
inference(splitRight,[status(thm)],[c_1898]) ).
tff(c_128,plain,
! [A_66,B_67] :
( element(A_66,B_67)
| ~ in(A_66,B_67) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_2029,plain,
element('#skF_5','#skF_13'),
inference(resolution,[status(thm)],[c_2019,c_128]) ).
tff(c_2040,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_286,c_2029]) ).
tff(c_2041,plain,
! [A_105] :
( in(A_105,'#skF_13')
| ~ element(A_105,'#skF_13') ),
inference(splitRight,[status(thm)],[c_285]) ).
tff(c_14,plain,
! [B_10,A_9] : ( set_union2(B_10,A_9) = set_union2(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_112,plain,
! [A_52] :
( ~ in(set_difference('#skF_11'(A_52),'#skF_12'(A_52)),A_52)
| ~ in(set_union2('#skF_11'(A_52),'#skF_12'(A_52)),A_52)
| preboolean(A_52) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_4122,plain,
! [A_413] :
( ~ in(set_difference('#skF_11'(A_413),'#skF_12'(A_413)),A_413)
| ~ in(set_union2('#skF_12'(A_413),'#skF_11'(A_413)),A_413)
| preboolean(A_413) ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_112]) ).
tff(c_4134,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| preboolean('#skF_13')
| ~ element(set_union2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(resolution,[status(thm)],[c_2041,c_4122]) ).
tff(c_4143,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| ~ element(set_union2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(negUnitSimplification,[status(thm)],[c_118,c_4134]) ).
tff(c_4177,plain,
~ element(set_union2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitLeft,[status(thm)],[c_4143]) ).
tff(c_4181,plain,
( ~ element('#skF_11'('#skF_13'),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(resolution,[status(thm)],[c_2181,c_4177]) ).
tff(c_4182,plain,
~ element('#skF_12'('#skF_13'),'#skF_13'),
inference(splitLeft,[status(thm)],[c_4181]) ).
tff(c_4185,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_3901,c_4182]) ).
tff(c_4191,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_4185]) ).
tff(c_4193,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_4191]) ).
tff(c_4194,plain,
~ element('#skF_11'('#skF_13'),'#skF_13'),
inference(splitRight,[status(thm)],[c_4181]) ).
tff(c_4198,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_3902,c_4194]) ).
tff(c_4204,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_4198]) ).
tff(c_4206,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_4204]) ).
tff(c_4208,plain,
element(set_union2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitRight,[status(thm)],[c_4143]) ).
tff(c_2931,plain,
! [A_339,B_340] : ( symmetric_difference(A_339,set_intersection2(A_339,B_340)) = set_difference(A_339,B_340) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_2950,plain,
! [A_339,B_340] :
( in(set_difference(A_339,B_340),'#skF_13')
| ~ element(set_intersection2(A_339,B_340),'#skF_13')
| ~ element(A_339,'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_2931,c_124]) ).
tff(c_132,plain,
! [A_69,B_70] :
( in(A_69,B_70)
| empty(B_70)
| ~ element(A_69,B_70) ),
inference(cnfTransformation,[status(thm)],[f_232]) ).
tff(c_7738,plain,
! [B_550] :
( ~ in(set_difference('#skF_11'(B_550),'#skF_12'(B_550)),B_550)
| preboolean(B_550)
| empty(B_550)
| ~ element(set_union2('#skF_12'(B_550),'#skF_11'(B_550)),B_550) ),
inference(resolution,[status(thm)],[c_132,c_4122]) ).
tff(c_7750,plain,
( preboolean('#skF_13')
| empty('#skF_13')
| ~ element(set_union2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element(set_intersection2('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13') ),
inference(resolution,[status(thm)],[c_2950,c_7738]) ).
tff(c_7766,plain,
( preboolean('#skF_13')
| empty('#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_4208,c_7750]) ).
tff(c_7767,plain,
( ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13') ),
inference(negUnitSimplification,[status(thm)],[c_120,c_118,c_7766]) ).
tff(c_7956,plain,
~ element('#skF_11'('#skF_13'),'#skF_13'),
inference(splitLeft,[status(thm)],[c_7767]) ).
tff(c_7959,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_3902,c_7956]) ).
tff(c_7965,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_7959]) ).
tff(c_7967,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_7965]) ).
tff(c_7968,plain,
~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitRight,[status(thm)],[c_7767]) ).
tff(c_7969,plain,
element('#skF_11'('#skF_13'),'#skF_13'),
inference(splitRight,[status(thm)],[c_7767]) ).
tff(c_2182,plain,
! [B_62,C_64] :
( element(symmetric_difference(B_62,C_64),'#skF_13')
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(resolution,[status(thm)],[c_124,c_2170]) ).
tff(c_3482,plain,
! [A_374,B_375] : ( symmetric_difference(symmetric_difference(A_374,B_375),set_union2(A_374,B_375)) = set_intersection2(A_374,B_375) ),
inference(cnfTransformation,[status(thm)],[f_274]) ).
tff(c_18275,plain,
! [A_798,B_799] :
( element(set_intersection2(A_798,B_799),'#skF_13')
| ~ element(set_union2(A_798,B_799),'#skF_13')
| ~ element(symmetric_difference(A_798,B_799),'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_3482,c_2182]) ).
tff(c_25533,plain,
! [B_1004,C_1005] :
( element(set_intersection2(B_1004,C_1005),'#skF_13')
| ~ element(set_union2(B_1004,C_1005),'#skF_13')
| ~ element(C_1005,'#skF_13')
| ~ element(B_1004,'#skF_13') ),
inference(resolution,[status(thm)],[c_2182,c_18275]) ).
tff(c_25544,plain,
( element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(resolution,[status(thm)],[c_4208,c_25533]) ).
tff(c_25575,plain,
( element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_7969,c_25544]) ).
tff(c_25576,plain,
~ element('#skF_12'('#skF_13'),'#skF_13'),
inference(negUnitSimplification,[status(thm)],[c_7968,c_25575]) ).
tff(c_25585,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_3901,c_25576]) ).
tff(c_25591,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_25585]) ).
tff(c_25593,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_25591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU106+1 : TPTP v8.1.2. Released v3.2.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.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 12:09:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 17.99/6.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.06/6.34
% 18.06/6.34 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 18.06/6.38
% 18.06/6.38 Inference rules
% 18.06/6.38 ----------------------
% 18.06/6.38 #Ref : 0
% 18.06/6.38 #Sup : 6324
% 18.06/6.38 #Fact : 0
% 18.06/6.38 #Define : 0
% 18.06/6.38 #Split : 21
% 18.06/6.38 #Chain : 0
% 18.06/6.38 #Close : 0
% 18.06/6.38
% 18.06/6.38 Ordering : KBO
% 18.06/6.38
% 18.06/6.38 Simplification rules
% 18.06/6.38 ----------------------
% 18.06/6.38 #Subsume : 2298
% 18.06/6.38 #Demod : 5406
% 18.06/6.38 #Tautology : 1397
% 18.06/6.38 #SimpNegUnit : 557
% 18.06/6.38 #BackRed : 270
% 18.06/6.38
% 18.06/6.38 #Partial instantiations: 0
% 18.06/6.38 #Strategies tried : 1
% 18.06/6.38
% 18.06/6.38 Timing (in seconds)
% 18.06/6.38 ----------------------
% 18.06/6.38 Preprocessing : 0.58
% 18.06/6.38 Parsing : 0.31
% 18.06/6.38 CNF conversion : 0.05
% 18.06/6.38 Main loop : 4.73
% 18.06/6.38 Inferencing : 1.22
% 18.06/6.38 Reduction : 1.94
% 18.06/6.38 Demodulation : 1.56
% 18.06/6.38 BG Simplification : 0.08
% 18.06/6.38 Subsumption : 1.18
% 18.06/6.38 Abstraction : 0.11
% 18.06/6.38 MUC search : 0.00
% 18.06/6.38 Cooper : 0.00
% 18.06/6.38 Total : 5.37
% 18.06/6.38 Index Insertion : 0.00
% 18.06/6.38 Index Deletion : 0.00
% 18.06/6.38 Index Matching : 0.00
% 18.06/6.38 BG Taut test : 0.00
%------------------------------------------------------------------------------