TSTP Solution File: SEU120+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU120+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 : n016.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:39 EDT 2023
% Result : Theorem 3.91s 1.97s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 50 ( 20 unt; 16 typ; 0 def)
% Number of atoms : 50 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 21 ~; 11 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 8 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 26 (; 25 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_6 > #skF_11 > #skF_1 > #skF_7 > #skF_10 > #skF_5 > #skF_2 > #skF_9 > #skF_8 > #skF_4 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
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(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_39,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_52,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_intersection2(A,B) = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
tff(f_98,negated_conjecture,
~ ! [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_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(c_6,plain,
! [B_8] : ~ in(B_8,empty_set),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_118,plain,
! [A_39,B_40] :
( disjoint(A_39,B_40)
| ( set_intersection2(A_39,B_40) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_56,plain,
( disjoint('#skF_7','#skF_8')
| ~ disjoint('#skF_10','#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_116,plain,
~ disjoint('#skF_10','#skF_11'),
inference(splitLeft,[status(thm)],[c_56]) ).
tff(c_124,plain,
set_intersection2('#skF_10','#skF_11') != empty_set,
inference(resolution,[status(thm)],[c_118,c_116]) ).
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_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_52,plain,
! [C_28] :
( disjoint('#skF_7','#skF_8')
| ~ in(C_28,set_intersection2('#skF_10','#skF_11')) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_236,plain,
! [C_49] : ~ in(C_49,set_intersection2('#skF_10','#skF_11')),
inference(splitLeft,[status(thm)],[c_52]) ).
tff(c_244,plain,
set_intersection2('#skF_10','#skF_11') = empty_set,
inference(resolution,[status(thm)],[c_8,c_236]) ).
tff(c_249,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_124,c_244]) ).
tff(c_250,plain,
disjoint('#skF_7','#skF_8'),
inference(splitRight,[status(thm)],[c_52]) ).
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_256,plain,
set_intersection2('#skF_7','#skF_8') = empty_set,
inference(resolution,[status(thm)],[c_250,c_28]) ).
tff(c_279,plain,
set_intersection2('#skF_8','#skF_7') = empty_set,
inference(superposition,[status(thm),theory(equality)],[c_4,c_256]) ).
tff(c_54,plain,
! [C_28] :
( in('#skF_9',set_intersection2('#skF_7','#skF_8'))
| ~ in(C_28,set_intersection2('#skF_10','#skF_11')) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_60,plain,
! [C_28] :
( in('#skF_9',set_intersection2('#skF_8','#skF_7'))
| ~ in(C_28,set_intersection2('#skF_10','#skF_11')) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_54]) ).
tff(c_345,plain,
! [C_28] :
( in('#skF_9',empty_set)
| ~ in(C_28,set_intersection2('#skF_10','#skF_11')) ),
inference(demodulation,[status(thm),theory(equality)],[c_279,c_60]) ).
tff(c_347,plain,
! [C_53] : ~ in(C_53,set_intersection2('#skF_10','#skF_11')),
inference(negUnitSimplification,[status(thm)],[c_6,c_345]) ).
tff(c_359,plain,
set_intersection2('#skF_10','#skF_11') = empty_set,
inference(resolution,[status(thm)],[c_8,c_347]) ).
tff(c_365,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_124,c_359]) ).
tff(c_367,plain,
disjoint('#skF_10','#skF_11'),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_366,plain,
disjoint('#skF_7','#skF_8'),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_387,plain,
! [A_57,B_58] :
( ( set_intersection2(A_57,B_58) = empty_set )
| ~ disjoint(A_57,B_58) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_407,plain,
set_intersection2('#skF_7','#skF_8') = empty_set,
inference(resolution,[status(thm)],[c_366,c_387]) ).
tff(c_425,plain,
set_intersection2('#skF_8','#skF_7') = empty_set,
inference(superposition,[status(thm),theory(equality)],[c_4,c_407]) ).
tff(c_58,plain,
( in('#skF_9',set_intersection2('#skF_7','#skF_8'))
| ~ disjoint('#skF_10','#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_59,plain,
( in('#skF_9',set_intersection2('#skF_8','#skF_7'))
| ~ disjoint('#skF_10','#skF_11') ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_58]) ).
tff(c_457,plain,
in('#skF_9',empty_set),
inference(demodulation,[status(thm),theory(equality)],[c_367,c_425,c_59]) ).
tff(c_458,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_457]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU120+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 : n016.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:15:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.91/1.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.91/1.97
% 3.91/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.91/2.00
% 3.91/2.00 Inference rules
% 3.91/2.00 ----------------------
% 3.91/2.00 #Ref : 0
% 3.91/2.00 #Sup : 94
% 3.91/2.00 #Fact : 0
% 3.91/2.00 #Define : 0
% 3.91/2.00 #Split : 2
% 3.91/2.00 #Chain : 0
% 3.91/2.00 #Close : 0
% 3.91/2.00
% 3.91/2.00 Ordering : KBO
% 3.91/2.00
% 3.91/2.00 Simplification rules
% 3.91/2.00 ----------------------
% 3.91/2.00 #Subsume : 2
% 3.91/2.00 #Demod : 37
% 3.91/2.00 #Tautology : 73
% 3.91/2.00 #SimpNegUnit : 4
% 3.91/2.00 #BackRed : 0
% 3.91/2.00
% 3.91/2.00 #Partial instantiations: 0
% 3.91/2.00 #Strategies tried : 1
% 3.91/2.00
% 3.91/2.00 Timing (in seconds)
% 3.91/2.00 ----------------------
% 3.91/2.00 Preprocessing : 0.50
% 3.91/2.00 Parsing : 0.25
% 3.91/2.00 CNF conversion : 0.04
% 3.91/2.00 Main loop : 0.37
% 3.91/2.00 Inferencing : 0.12
% 3.91/2.00 Reduction : 0.12
% 3.91/2.00 Demodulation : 0.09
% 3.91/2.01 BG Simplification : 0.02
% 3.91/2.01 Subsumption : 0.09
% 3.91/2.01 Abstraction : 0.01
% 3.91/2.01 MUC search : 0.00
% 3.91/2.01 Cooper : 0.00
% 3.91/2.01 Total : 0.92
% 3.91/2.01 Index Insertion : 0.00
% 3.91/2.01 Index Deletion : 0.00
% 3.91/2.01 Index Matching : 0.00
% 3.91/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------