TSTP Solution File: SEU162+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU162+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/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 : n001.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 3.01s 1.85s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 43 ( 14 unt; 8 typ; 0 def)
% Number of atoms : 56 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 45 ( 24 ~; 16 |; 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 : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 34 (; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > set_difference > #nlpp > singleton > #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_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_52,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_42,axiom,
! [A,B] :
( ~ in(A,B)
=> disjoint(singleton(A),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(f_46,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
tff(f_56,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_difference(A,B) = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
tff(f_37,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_2','#skF_1')
| in('#skF_4','#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_25,plain,
~ in('#skF_2','#skF_1'),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_32,plain,
! [A_17,B_18] :
( disjoint(singleton(A_17),B_18)
| in(A_17,B_18) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_12,plain,
! [B_8,A_7] :
( disjoint(B_8,A_7)
| ~ disjoint(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_69,plain,
! [B_25,A_26] :
( disjoint(B_25,singleton(A_26))
| in(A_26,B_25) ),
inference(resolution,[status(thm)],[c_32,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_56]) ).
tff(c_84,plain,
! [B_31,A_32] :
( ( set_difference(B_31,singleton(A_32)) = B_31 )
| in(A_32,B_31) ),
inference(resolution,[status(thm)],[c_69,c_22]) ).
tff(c_14,plain,
( ( set_difference('#skF_1',singleton('#skF_2')) != '#skF_1' )
| in('#skF_4','#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_68,plain,
set_difference('#skF_1',singleton('#skF_2')) != '#skF_1',
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_92,plain,
in('#skF_2','#skF_1'),
inference(superposition,[status(thm),theory(equality)],[c_84,c_68]) ).
tff(c_101,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_25,c_92]) ).
tff(c_102,plain,
in('#skF_4','#skF_3'),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_103,plain,
set_difference('#skF_1',singleton('#skF_2')) = '#skF_1',
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_18,plain,
( ( set_difference('#skF_1',singleton('#skF_2')) != '#skF_1' )
| ( set_difference('#skF_3',singleton('#skF_4')) = '#skF_3' ) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_135,plain,
set_difference('#skF_3',singleton('#skF_4')) = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_103,c_18]) ).
tff(c_28,plain,
! [A_15,B_16] :
( disjoint(A_15,B_16)
| ( set_difference(A_15,B_16) != A_15 ) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_55,plain,
! [B_23,A_24] :
( disjoint(B_23,A_24)
| ( set_difference(A_24,B_23) != A_24 ) ),
inference(resolution,[status(thm)],[c_28,c_12]) ).
tff(c_8,plain,
! [A_3,B_4] :
( ~ in(A_3,B_4)
| ~ disjoint(singleton(A_3),B_4) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_66,plain,
! [A_3,A_24] :
( ~ in(A_3,A_24)
| ( set_difference(A_24,singleton(A_3)) != A_24 ) ),
inference(resolution,[status(thm)],[c_55,c_8]) ).
tff(c_141,plain,
~ in('#skF_4','#skF_3'),
inference(superposition,[status(thm),theory(equality)],[c_135,c_66]) ).
tff(c_148,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_102,c_141]) ).
tff(c_149,plain,
in('#skF_4','#skF_3'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_150,plain,
in('#skF_2','#skF_1'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_20,plain,
( ~ in('#skF_2','#skF_1')
| ( set_difference('#skF_3',singleton('#skF_4')) = '#skF_3' ) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_214,plain,
set_difference('#skF_3',singleton('#skF_4')) = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_150,c_20]) ).
tff(c_174,plain,
! [A_51,B_52] :
( disjoint(A_51,B_52)
| ( set_difference(A_51,B_52) != A_51 ) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_200,plain,
! [B_55,A_56] :
( disjoint(B_55,A_56)
| ( set_difference(A_56,B_55) != A_56 ) ),
inference(resolution,[status(thm)],[c_174,c_12]) ).
tff(c_239,plain,
! [A_61,A_62] :
( ~ in(A_61,A_62)
| ( set_difference(A_62,singleton(A_61)) != A_62 ) ),
inference(resolution,[status(thm)],[c_200,c_8]) ).
tff(c_245,plain,
~ in('#skF_4','#skF_3'),
inference(superposition,[status(thm),theory(equality)],[c_214,c_239]) ).
tff(c_250,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_149,c_245]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU162+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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.36 % Computer : n001.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 12:06:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.01/1.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.01/1.86
% 3.01/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.18/1.89
% 3.18/1.89 Inference rules
% 3.18/1.89 ----------------------
% 3.18/1.89 #Ref : 0
% 3.18/1.89 #Sup : 50
% 3.18/1.89 #Fact : 0
% 3.18/1.89 #Define : 0
% 3.18/1.89 #Split : 2
% 3.18/1.89 #Chain : 0
% 3.18/1.89 #Close : 0
% 3.18/1.89
% 3.18/1.89 Ordering : KBO
% 3.18/1.89
% 3.18/1.89 Simplification rules
% 3.18/1.89 ----------------------
% 3.18/1.89 #Subsume : 9
% 3.18/1.89 #Demod : 7
% 3.18/1.89 #Tautology : 18
% 3.18/1.89 #SimpNegUnit : 1
% 3.18/1.89 #BackRed : 0
% 3.18/1.89
% 3.18/1.89 #Partial instantiations: 0
% 3.18/1.89 #Strategies tried : 1
% 3.18/1.89
% 3.18/1.89 Timing (in seconds)
% 3.18/1.89 ----------------------
% 3.18/1.89 Preprocessing : 0.43
% 3.18/1.89 Parsing : 0.24
% 3.18/1.89 CNF conversion : 0.03
% 3.18/1.89 Main loop : 0.30
% 3.18/1.89 Inferencing : 0.14
% 3.18/1.89 Reduction : 0.05
% 3.18/1.89 Demodulation : 0.03
% 3.18/1.89 BG Simplification : 0.01
% 3.18/1.89 Subsumption : 0.06
% 3.18/1.89 Abstraction : 0.01
% 3.18/1.89 MUC search : 0.00
% 3.18/1.89 Cooper : 0.00
% 3.18/1.89 Total : 0.78
% 3.18/1.89 Index Insertion : 0.00
% 3.18/1.89 Index Deletion : 0.00
% 3.18/1.89 Index Matching : 0.00
% 3.18/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------