TSTP Solution File: SEU119+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU119+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 : 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:38 EDT 2023
% Result : Theorem 4.50s 2.13s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 81 ( 23 unt; 15 typ; 0 def)
% Number of atoms : 122 ( 35 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 106 ( 50 ~; 45 |; 6 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 70 (; 69 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_1 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_9 > #skF_8 > #skF_4 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(f_52,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_intersection2(A,B) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
tff(f_84,negated_conjecture,
~ ! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] :
~ ( in(C,A)
& in(C,B) ) )
& ~ ( ? [C] :
( in(C,A)
& in(C,B) )
& disjoint(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
tff(f_39,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_48,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(f_65,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(c_115,plain,
! [A_36,B_37] :
( disjoint(A_36,B_37)
| ( set_intersection2(A_36,B_37) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_56,plain,
( in('#skF_8','#skF_6')
| ~ disjoint('#skF_9','#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_67,plain,
~ disjoint('#skF_9','#skF_10'),
inference(splitLeft,[status(thm)],[c_56]) ).
tff(c_126,plain,
set_intersection2('#skF_9','#skF_10') != empty_set,
inference(resolution,[status(thm)],[c_115,c_67]) ).
tff(c_8,plain,
! [A_5] :
( ( empty_set = A_5 )
| in('#skF_1'(A_5),A_5) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_672,plain,
! [D_83,B_84,A_85] :
( in(D_83,B_84)
| ~ in(D_83,set_intersection2(A_85,B_84)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_1255,plain,
! [A_114,B_115] :
( in('#skF_1'(set_intersection2(A_114,B_115)),B_115)
| ( set_intersection2(A_114,B_115) = empty_set ) ),
inference(resolution,[status(thm)],[c_8,c_672]) ).
tff(c_140,plain,
! [D_40,A_41,B_42] :
( in(D_40,A_41)
| ~ in(D_40,set_intersection2(A_41,B_42)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_1073,plain,
! [A_109,B_110] :
( in('#skF_1'(set_intersection2(A_109,B_110)),A_109)
| ( set_intersection2(A_109,B_110) = empty_set ) ),
inference(resolution,[status(thm)],[c_8,c_140]) ).
tff(c_50,plain,
! [C_23] :
( in('#skF_8','#skF_6')
| ~ in(C_23,'#skF_10')
| ~ in(C_23,'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1019,plain,
! [C_23] :
( ~ in(C_23,'#skF_10')
| ~ in(C_23,'#skF_9') ),
inference(splitLeft,[status(thm)],[c_50]) ).
tff(c_1112,plain,
! [B_110] :
( ~ in('#skF_1'(set_intersection2('#skF_10',B_110)),'#skF_9')
| ( set_intersection2('#skF_10',B_110) = empty_set ) ),
inference(resolution,[status(thm)],[c_1073,c_1019]) ).
tff(c_1303,plain,
set_intersection2('#skF_10','#skF_9') = empty_set,
inference(resolution,[status(thm)],[c_1255,c_1112]) ).
tff(c_44,plain,
! [B_20,A_19] :
( disjoint(B_20,A_19)
| ~ disjoint(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_127,plain,
! [B_38,A_39] :
( disjoint(B_38,A_39)
| ( set_intersection2(A_39,B_38) != empty_set ) ),
inference(resolution,[status(thm)],[c_115,c_44]) ).
tff(c_28,plain,
! [A_15,B_16] :
( ( set_intersection2(A_15,B_16) = empty_set )
| ~ disjoint(A_15,B_16) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_136,plain,
! [B_38,A_39] :
( ( set_intersection2(B_38,A_39) = empty_set )
| ( set_intersection2(A_39,B_38) != empty_set ) ),
inference(resolution,[status(thm)],[c_127,c_28]) ).
tff(c_1385,plain,
set_intersection2('#skF_9','#skF_10') = empty_set,
inference(superposition,[status(thm),theory(equality)],[c_1303,c_136]) ).
tff(c_1416,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_126,c_1385]) ).
tff(c_1417,plain,
in('#skF_8','#skF_6'),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_intersection2(B_4,A_3) = set_intersection2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_154,plain,
! [A_41,B_42] :
( in('#skF_1'(set_intersection2(A_41,B_42)),A_41)
| ( set_intersection2(A_41,B_42) = empty_set ) ),
inference(resolution,[status(thm)],[c_8,c_140]) ).
tff(c_755,plain,
! [A_89,B_90] :
( in('#skF_1'(set_intersection2(A_89,B_90)),A_89)
| ( set_intersection2(A_89,B_90) = empty_set ) ),
inference(resolution,[status(thm)],[c_8,c_140]) ).
tff(c_48,plain,
! [C_23] :
( in('#skF_8','#skF_7')
| ~ in(C_23,'#skF_10')
| ~ in(C_23,'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_731,plain,
! [C_23] :
( ~ in(C_23,'#skF_10')
| ~ in(C_23,'#skF_9') ),
inference(splitLeft,[status(thm)],[c_48]) ).
tff(c_843,plain,
! [B_92] :
( ~ in('#skF_1'(set_intersection2('#skF_10',B_92)),'#skF_9')
| ( set_intersection2('#skF_10',B_92) = empty_set ) ),
inference(resolution,[status(thm)],[c_755,c_731]) ).
tff(c_973,plain,
! [A_98] :
( ~ in('#skF_1'(set_intersection2(A_98,'#skF_10')),'#skF_9')
| ( set_intersection2('#skF_10',A_98) = empty_set ) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_843]) ).
tff(c_981,plain,
( ( set_intersection2('#skF_10','#skF_9') = empty_set )
| ( set_intersection2('#skF_9','#skF_10') = empty_set ) ),
inference(resolution,[status(thm)],[c_154,c_973]) ).
tff(c_996,plain,
( ( set_intersection2('#skF_9','#skF_10') = empty_set )
| ( set_intersection2('#skF_9','#skF_10') = empty_set ) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_981]) ).
tff(c_998,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_126,c_126,c_996]) ).
tff(c_999,plain,
in('#skF_8','#skF_7'),
inference(splitRight,[status(thm)],[c_48]) ).
tff(c_6,plain,
! [B_8] : ~ in(B_8,empty_set),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_207,plain,
! [A_52,B_53] :
( in('#skF_1'(set_intersection2(A_52,B_53)),A_52)
| ( set_intersection2(A_52,B_53) = empty_set ) ),
inference(resolution,[status(thm)],[c_8,c_140]) ).
tff(c_228,plain,
! [B_4,A_3] :
( in('#skF_1'(set_intersection2(B_4,A_3)),A_3)
| ( set_intersection2(A_3,B_4) = empty_set ) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_207]) ).
tff(c_46,plain,
! [C_23] :
( disjoint('#skF_6','#skF_7')
| ~ in(C_23,'#skF_10')
| ~ in(C_23,'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_155,plain,
! [C_23] :
( ~ in(C_23,'#skF_10')
| ~ in(C_23,'#skF_9') ),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_635,plain,
! [B_82] :
( ~ in('#skF_1'(set_intersection2('#skF_10',B_82)),'#skF_9')
| ( set_intersection2('#skF_10',B_82) = empty_set ) ),
inference(resolution,[status(thm)],[c_207,c_155]) ).
tff(c_639,plain,
( ( set_intersection2('#skF_10','#skF_9') = empty_set )
| ( set_intersection2('#skF_9','#skF_10') = empty_set ) ),
inference(resolution,[status(thm)],[c_228,c_635]) ).
tff(c_661,plain,
( ( set_intersection2('#skF_9','#skF_10') = empty_set )
| ( set_intersection2('#skF_9','#skF_10') = empty_set ) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_639]) ).
tff(c_663,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_126,c_126,c_661]) ).
tff(c_664,plain,
disjoint('#skF_6','#skF_7'),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_670,plain,
set_intersection2('#skF_6','#skF_7') = empty_set,
inference(resolution,[status(thm)],[c_664,c_28]) ).
tff(c_1421,plain,
! [D_119,A_120,B_121] :
( in(D_119,set_intersection2(A_120,B_121))
| ~ in(D_119,B_121)
| ~ in(D_119,A_120) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_1435,plain,
! [D_119] :
( in(D_119,empty_set)
| ~ in(D_119,'#skF_7')
| ~ in(D_119,'#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_670,c_1421]) ).
tff(c_1450,plain,
! [D_122] :
( ~ in(D_122,'#skF_7')
| ~ in(D_122,'#skF_6') ),
inference(negUnitSimplification,[status(thm)],[c_6,c_1435]) ).
tff(c_1453,plain,
~ in('#skF_8','#skF_6'),
inference(resolution,[status(thm)],[c_999,c_1450]) ).
tff(c_1461,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1417,c_1453]) ).
tff(c_1462,plain,
in('#skF_8','#skF_6'),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_1463,plain,
disjoint('#skF_9','#skF_10'),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_54,plain,
( in('#skF_8','#skF_7')
| ~ disjoint('#skF_9','#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1514,plain,
in('#skF_8','#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_1463,c_54]) ).
tff(c_52,plain,
( disjoint('#skF_6','#skF_7')
| ~ disjoint('#skF_9','#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1465,plain,
disjoint('#skF_6','#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_1463,c_52]) ).
tff(c_1535,plain,
! [A_131,B_132] :
( ( set_intersection2(A_131,B_132) = empty_set )
| ~ disjoint(A_131,B_132) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_1550,plain,
set_intersection2('#skF_6','#skF_7') = empty_set,
inference(resolution,[status(thm)],[c_1465,c_1535]) ).
tff(c_1696,plain,
! [D_145,A_146,B_147] :
( in(D_145,set_intersection2(A_146,B_147))
| ~ in(D_145,B_147)
| ~ in(D_145,A_146) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_1716,plain,
! [D_145] :
( in(D_145,empty_set)
| ~ in(D_145,'#skF_7')
| ~ in(D_145,'#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_1550,c_1696]) ).
tff(c_1739,plain,
! [D_149] :
( ~ in(D_149,'#skF_7')
| ~ in(D_149,'#skF_6') ),
inference(negUnitSimplification,[status(thm)],[c_6,c_1716]) ).
tff(c_1742,plain,
~ in('#skF_8','#skF_6'),
inference(resolution,[status(thm)],[c_1514,c_1739]) ).
tff(c_1750,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1462,c_1742]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU119+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/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.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 12:07:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.50/2.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.50/2.14
% 4.50/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.50/2.17
% 4.50/2.17 Inference rules
% 4.50/2.17 ----------------------
% 4.50/2.17 #Ref : 0
% 4.50/2.17 #Sup : 406
% 4.50/2.17 #Fact : 0
% 4.50/2.17 #Define : 0
% 4.50/2.17 #Split : 10
% 4.50/2.17 #Chain : 0
% 4.50/2.17 #Close : 0
% 4.50/2.17
% 4.50/2.17 Ordering : KBO
% 4.50/2.17
% 4.50/2.17 Simplification rules
% 4.50/2.17 ----------------------
% 4.50/2.17 #Subsume : 82
% 4.50/2.17 #Demod : 113
% 4.50/2.17 #Tautology : 185
% 4.50/2.17 #SimpNegUnit : 36
% 4.50/2.17 #BackRed : 0
% 4.50/2.17
% 4.50/2.17 #Partial instantiations: 0
% 4.50/2.17 #Strategies tried : 1
% 4.50/2.17
% 4.50/2.17 Timing (in seconds)
% 4.50/2.17 ----------------------
% 4.50/2.18 Preprocessing : 0.50
% 4.50/2.18 Parsing : 0.25
% 4.50/2.18 CNF conversion : 0.04
% 4.50/2.18 Main loop : 0.61
% 4.50/2.18 Inferencing : 0.22
% 4.50/2.18 Reduction : 0.18
% 4.50/2.18 Demodulation : 0.13
% 4.50/2.18 BG Simplification : 0.03
% 4.50/2.18 Subsumption : 0.12
% 4.50/2.18 Abstraction : 0.03
% 4.50/2.18 MUC search : 0.00
% 4.50/2.18 Cooper : 0.00
% 4.50/2.18 Total : 1.17
% 4.50/2.18 Index Insertion : 0.00
% 4.50/2.18 Index Deletion : 0.00
% 4.50/2.18 Index Matching : 0.00
% 4.50/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------