TSTP Solution File: SEU162+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU162+3 : 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 : n032.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:51 EDT 2023
% Result : Theorem 2.92s 1.75s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 17 unt; 11 typ; 0 def)
% Number of atoms : 61 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 48 ( 26 ~; 17 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > set_difference > #nlpp > singleton > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_56,negated_conjecture,
~ ! [A,B] :
( ( set_difference(A,singleton(B)) = A )
<=> ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).
tff(f_41,axiom,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(f_50,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
tff(f_60,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_difference(A,B) = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
tff(f_36,axiom,
! [A,B] :
~ ( disjoint(singleton(A),B)
& in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).
tff(c_16,plain,
( ~ in('#skF_4','#skF_3')
| in('#skF_6','#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_25,plain,
~ in('#skF_4','#skF_3'),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_28,plain,
! [A_15,B_16] :
( disjoint(singleton(A_15),B_16)
| in(A_15,B_16) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_12,plain,
! [B_8,A_7] :
( disjoint(B_8,A_7)
| ~ disjoint(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_55,plain,
! [B_23,A_24] :
( disjoint(B_23,singleton(A_24))
| in(A_24,B_23) ),
inference(resolution,[status(thm)],[c_28,c_12]) ).
tff(c_22,plain,
! [A_9,B_10] :
( ( set_difference(A_9,B_10) = A_9 )
| ~ disjoint(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_82,plain,
! [B_27,A_28] :
( ( set_difference(B_27,singleton(A_28)) = B_27 )
| in(A_28,B_27) ),
inference(resolution,[status(thm)],[c_55,c_22]) ).
tff(c_14,plain,
( ( set_difference('#skF_3',singleton('#skF_4')) != '#skF_3' )
| in('#skF_6','#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_81,plain,
set_difference('#skF_3',singleton('#skF_4')) != '#skF_3',
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_88,plain,
in('#skF_4','#skF_3'),
inference(superposition,[status(thm),theory(equality)],[c_82,c_81]) ).
tff(c_96,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_25,c_88]) ).
tff(c_97,plain,
in('#skF_6','#skF_5'),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_98,plain,
set_difference('#skF_3',singleton('#skF_4')) = '#skF_3',
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_18,plain,
( ( set_difference('#skF_3',singleton('#skF_4')) != '#skF_3' )
| ( set_difference('#skF_5',singleton('#skF_6')) = '#skF_5' ) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_102,plain,
set_difference('#skF_3',singleton('#skF_4')) != '#skF_3',
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_108,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_102]) ).
tff(c_109,plain,
set_difference('#skF_5',singleton('#skF_6')) = '#skF_5',
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_42,plain,
! [A_21,B_22] :
( disjoint(A_21,B_22)
| ( set_difference(A_21,B_22) != A_21 ) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_68,plain,
! [B_25,A_26] :
( disjoint(B_25,A_26)
| ( set_difference(A_26,B_25) != A_26 ) ),
inference(resolution,[status(thm)],[c_42,c_12]) ).
tff(c_121,plain,
! [B_31,A_32] :
( ( set_difference(B_31,A_32) = B_31 )
| ( set_difference(A_32,B_31) != A_32 ) ),
inference(resolution,[status(thm)],[c_68,c_22]) ).
tff(c_126,plain,
set_difference(singleton('#skF_6'),'#skF_5') = singleton('#skF_6'),
inference(superposition,[status(thm),theory(equality)],[c_109,c_121]) ).
tff(c_4,plain,
! [A_3,B_4] :
( ~ in(A_3,B_4)
| ~ disjoint(singleton(A_3),B_4) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_52,plain,
! [A_3,B_22] :
( ~ in(A_3,B_22)
| ( set_difference(singleton(A_3),B_22) != singleton(A_3) ) ),
inference(resolution,[status(thm)],[c_42,c_4]) ).
tff(c_133,plain,
~ in('#skF_6','#skF_5'),
inference(superposition,[status(thm),theory(equality)],[c_126,c_52]) ).
tff(c_141,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_97,c_133]) ).
tff(c_142,plain,
in('#skF_6','#skF_5'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_143,plain,
in('#skF_4','#skF_3'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_20,plain,
( ~ in('#skF_4','#skF_3')
| ( set_difference('#skF_5',singleton('#skF_6')) = '#skF_5' ) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_181,plain,
set_difference('#skF_5',singleton('#skF_6')) = '#skF_5',
inference(demodulation,[status(thm),theory(equality)],[c_143,c_20]) ).
tff(c_167,plain,
! [A_43,B_44] :
( disjoint(A_43,B_44)
| ( set_difference(A_43,B_44) != A_43 ) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_199,plain,
! [B_47,A_48] :
( disjoint(B_47,A_48)
| ( set_difference(A_48,B_47) != A_48 ) ),
inference(resolution,[status(thm)],[c_167,c_12]) ).
tff(c_226,plain,
! [A_53,A_54] :
( ~ in(A_53,A_54)
| ( set_difference(A_54,singleton(A_53)) != A_54 ) ),
inference(resolution,[status(thm)],[c_199,c_4]) ).
tff(c_229,plain,
~ in('#skF_6','#skF_5'),
inference(superposition,[status(thm),theory(equality)],[c_181,c_226]) ).
tff(c_233,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_142,c_229]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU162+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % 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.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu Aug 3 11:51:36 EDT 2023
% 0.11/0.32 % CPUTime :
% 2.92/1.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.92/1.76
% 2.92/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.03/1.79
% 3.03/1.79 Inference rules
% 3.03/1.79 ----------------------
% 3.03/1.79 #Ref : 0
% 3.03/1.79 #Sup : 49
% 3.03/1.79 #Fact : 0
% 3.03/1.79 #Define : 0
% 3.03/1.79 #Split : 3
% 3.03/1.79 #Chain : 0
% 3.03/1.79 #Close : 0
% 3.03/1.79
% 3.03/1.79 Ordering : KBO
% 3.03/1.79
% 3.03/1.79 Simplification rules
% 3.03/1.79 ----------------------
% 3.03/1.79 #Subsume : 6
% 3.03/1.79 #Demod : 9
% 3.03/1.79 #Tautology : 21
% 3.03/1.79 #SimpNegUnit : 1
% 3.03/1.79 #BackRed : 0
% 3.03/1.79
% 3.03/1.79 #Partial instantiations: 0
% 3.03/1.79 #Strategies tried : 1
% 3.03/1.79
% 3.03/1.79 Timing (in seconds)
% 3.03/1.79 ----------------------
% 3.03/1.79 Preprocessing : 0.46
% 3.03/1.79 Parsing : 0.26
% 3.03/1.79 CNF conversion : 0.03
% 3.03/1.79 Main loop : 0.30
% 3.03/1.79 Inferencing : 0.13
% 3.03/1.79 Reduction : 0.06
% 3.03/1.79 Demodulation : 0.04
% 3.03/1.79 BG Simplification : 0.01
% 3.03/1.79 Subsumption : 0.06
% 3.03/1.79 Abstraction : 0.01
% 3.03/1.79 MUC search : 0.00
% 3.03/1.79 Cooper : 0.00
% 3.03/1.79 Total : 0.81
% 3.03/1.79 Index Insertion : 0.00
% 3.03/1.79 Index Deletion : 0.00
% 3.03/1.79 Index Matching : 0.00
% 3.03/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------