TSTP Solution File: SEU130+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU130+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/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 : n007.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:41 EDT 2023
% Result : Theorem 7.47s 2.93s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 47 ( 13 unt; 12 typ; 0 def)
% Number of atoms : 71 ( 16 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 62 ( 26 ~; 28 |; 2 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 65 (; 65 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_intersection2 > #nlpp > empty_set > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_4 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
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(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_73,negated_conjecture,
~ ! [A,B] :
( subset(A,B)
=> ( set_intersection2(A,B) = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
tff(f_66,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_46,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_55,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_68,axiom,
! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
tff(f_39,axiom,
! [A,B] :
( ( A = B )
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
tff(c_52,plain,
set_intersection2('#skF_6','#skF_7') != '#skF_6',
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_48,plain,
! [A_20] : subset(A_20,A_20),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_16,plain,
! [A_7,B_8] :
( in('#skF_1'(A_7,B_8),A_7)
| subset(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_54,plain,
subset('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_413,plain,
! [C_72,B_73,A_74] :
( in(C_72,B_73)
| ~ in(C_72,A_74)
| ~ subset(A_74,B_73) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_612,plain,
! [A_96,B_97,B_98] :
( in('#skF_1'(A_96,B_97),B_98)
| ~ subset(A_96,B_98)
| subset(A_96,B_97) ),
inference(resolution,[status(thm)],[c_16,c_413]) ).
tff(c_12,plain,
! [C_11,B_8,A_7] :
( in(C_11,B_8)
| ~ in(C_11,A_7)
| ~ subset(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_5430,plain,
! [A_340,B_341,B_342,B_343] :
( in('#skF_1'(A_340,B_341),B_342)
| ~ subset(B_343,B_342)
| ~ subset(A_340,B_343)
| subset(A_340,B_341) ),
inference(resolution,[status(thm)],[c_612,c_12]) ).
tff(c_5453,plain,
! [A_340,B_341] :
( in('#skF_1'(A_340,B_341),'#skF_7')
| ~ subset(A_340,'#skF_6')
| subset(A_340,B_341) ),
inference(resolution,[status(thm)],[c_54,c_5430]) ).
tff(c_514,plain,
! [D_83,A_84,B_85] :
( in(D_83,set_intersection2(A_84,B_85))
| ~ in(D_83,B_85)
| ~ in(D_83,A_84) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_14,plain,
! [A_7,B_8] :
( ~ in('#skF_1'(A_7,B_8),B_8)
| subset(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_5759,plain,
! [A_355,A_356,B_357] :
( subset(A_355,set_intersection2(A_356,B_357))
| ~ in('#skF_1'(A_355,set_intersection2(A_356,B_357)),B_357)
| ~ in('#skF_1'(A_355,set_intersection2(A_356,B_357)),A_356) ),
inference(resolution,[status(thm)],[c_514,c_14]) ).
tff(c_6584,plain,
! [A_380,A_381] :
( ~ in('#skF_1'(A_380,set_intersection2(A_381,'#skF_7')),A_381)
| ~ subset(A_380,'#skF_6')
| subset(A_380,set_intersection2(A_381,'#skF_7')) ),
inference(resolution,[status(thm)],[c_5453,c_5759]) ).
tff(c_6670,plain,
! [A_382] :
( ~ subset(A_382,'#skF_6')
| subset(A_382,set_intersection2(A_382,'#skF_7')) ),
inference(resolution,[status(thm)],[c_16,c_6584]) ).
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_131,plain,
! [B_44,A_45] : ( set_intersection2(B_44,A_45) = set_intersection2(A_45,B_44) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_50,plain,
! [A_22,B_23] : subset(set_intersection2(A_22,B_23),A_22),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_149,plain,
! [A_45,B_44] : subset(set_intersection2(A_45,B_44),B_44),
inference(superposition,[status(thm),theory(equality)],[c_131,c_50]) ).
tff(c_257,plain,
! [B_51,A_52] :
( ( B_51 = A_52 )
| ~ subset(B_51,A_52)
| ~ subset(A_52,B_51) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_450,plain,
! [A_79,B_80] :
( ( set_intersection2(A_79,B_80) = B_80 )
| ~ subset(B_80,set_intersection2(A_79,B_80)) ),
inference(resolution,[status(thm)],[c_149,c_257]) ).
tff(c_463,plain,
! [B_4,A_3] :
( ( set_intersection2(B_4,A_3) = A_3 )
| ~ subset(A_3,set_intersection2(A_3,B_4)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_450]) ).
tff(c_6832,plain,
! [A_383] :
( ( set_intersection2('#skF_7',A_383) = A_383 )
| ~ subset(A_383,'#skF_6') ),
inference(resolution,[status(thm)],[c_6670,c_463]) ).
tff(c_6868,plain,
set_intersection2('#skF_7','#skF_6') = '#skF_6',
inference(resolution,[status(thm)],[c_48,c_6832]) ).
tff(c_418,plain,
! [A_77,B_78] :
( ( set_intersection2(A_77,B_78) = A_77 )
| ~ subset(A_77,set_intersection2(A_77,B_78)) ),
inference(resolution,[status(thm)],[c_50,c_257]) ).
tff(c_428,plain,
! [A_3,B_4] :
( ( set_intersection2(A_3,B_4) = A_3 )
| ~ subset(A_3,set_intersection2(B_4,A_3)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_418]) ).
tff(c_6985,plain,
( ( set_intersection2('#skF_6','#skF_7') = '#skF_6' )
| ~ subset('#skF_6','#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_6868,c_428]) ).
tff(c_7034,plain,
set_intersection2('#skF_6','#skF_7') = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_48,c_6985]) ).
tff(c_7036,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_52,c_7034]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU130+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % 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.36 % Computer : n007.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:50:53 EDT 2023
% 0.14/0.37 % CPUTime :
% 7.47/2.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.47/2.94
% 7.47/2.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.47/2.97
% 7.47/2.97 Inference rules
% 7.47/2.97 ----------------------
% 7.47/2.97 #Ref : 0
% 7.47/2.97 #Sup : 1752
% 7.47/2.97 #Fact : 0
% 7.47/2.97 #Define : 0
% 7.47/2.97 #Split : 4
% 7.47/2.97 #Chain : 0
% 7.47/2.97 #Close : 0
% 7.47/2.97
% 7.47/2.97 Ordering : KBO
% 7.47/2.97
% 7.47/2.97 Simplification rules
% 7.47/2.97 ----------------------
% 7.47/2.97 #Subsume : 765
% 7.47/2.97 #Demod : 406
% 7.47/2.97 #Tautology : 221
% 7.47/2.97 #SimpNegUnit : 3
% 7.47/2.97 #BackRed : 4
% 7.47/2.97
% 7.47/2.97 #Partial instantiations: 0
% 7.47/2.97 #Strategies tried : 1
% 7.47/2.97
% 7.47/2.97 Timing (in seconds)
% 7.47/2.97 ----------------------
% 7.98/2.98 Preprocessing : 0.49
% 7.98/2.98 Parsing : 0.25
% 7.98/2.98 CNF conversion : 0.04
% 7.98/2.98 Main loop : 1.41
% 7.98/2.98 Inferencing : 0.46
% 7.98/2.98 Reduction : 0.41
% 7.98/2.98 Demodulation : 0.31
% 7.98/2.98 BG Simplification : 0.05
% 7.98/2.98 Subsumption : 0.40
% 7.98/2.98 Abstraction : 0.06
% 7.98/2.98 MUC search : 0.00
% 7.98/2.98 Cooper : 0.00
% 7.98/2.98 Total : 1.95
% 7.98/2.98 Index Insertion : 0.00
% 7.98/2.98 Index Deletion : 0.00
% 7.98/2.98 Index Matching : 0.00
% 7.98/2.98 BG Taut test : 0.00
%------------------------------------------------------------------------------