TSTP Solution File: SEU144+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU144+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 : 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:44 EDT 2023
% Result : Theorem 3.03s 1.76s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 19 unt; 10 typ; 0 def)
% Number of atoms : 56 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 16 ~; 15 |; 0 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > #nlpp > singleton > #skF_7 > #skF_3 > #skF_5 > #skF_6 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $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('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_51,negated_conjecture,
~ ! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
tff(f_38,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(f_45,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(c_26,plain,
( in('#skF_4','#skF_5')
| ~ in('#skF_6','#skF_7') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_35,plain,
~ in('#skF_6','#skF_7'),
inference(splitLeft,[status(thm)],[c_26]) ).
tff(c_30,plain,
( in('#skF_4','#skF_5')
| subset(singleton('#skF_6'),'#skF_7') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_47,plain,
subset(singleton('#skF_6'),'#skF_7'),
inference(splitLeft,[status(thm)],[c_30]) ).
tff(c_6,plain,
! [C_7] : in(C_7,singleton(C_7)),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_66,plain,
! [C_28,B_29,A_30] :
( in(C_28,B_29)
| ~ in(C_28,A_30)
| ~ subset(A_30,B_29) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_73,plain,
! [C_31,B_32] :
( in(C_31,B_32)
| ~ subset(singleton(C_31),B_32) ),
inference(resolution,[status(thm)],[c_6,c_66]) ).
tff(c_76,plain,
in('#skF_6','#skF_7'),
inference(resolution,[status(thm)],[c_47,c_73]) ).
tff(c_84,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_35,c_76]) ).
tff(c_86,plain,
~ subset(singleton('#skF_6'),'#skF_7'),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_28,plain,
( ~ subset(singleton('#skF_4'),'#skF_5')
| subset(singleton('#skF_6'),'#skF_7') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_90,plain,
~ subset(singleton('#skF_4'),'#skF_5'),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_85,plain,
in('#skF_4','#skF_5'),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_92,plain,
! [A_35,B_36] :
( in('#skF_3'(A_35,B_36),A_35)
| subset(A_35,B_36) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_4,plain,
! [C_7,A_3] :
( ( C_7 = A_3 )
| ~ in(C_7,singleton(A_3)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_132,plain,
! [A_45,B_46] :
( ( '#skF_3'(singleton(A_45),B_46) = A_45 )
| subset(singleton(A_45),B_46) ),
inference(resolution,[status(thm)],[c_92,c_4]) ).
tff(c_143,plain,
'#skF_3'(singleton('#skF_4'),'#skF_5') = '#skF_4',
inference(resolution,[status(thm)],[c_132,c_90]) ).
tff(c_18,plain,
! [A_8,B_9] :
( ~ in('#skF_3'(A_8,B_9),B_9)
| subset(A_8,B_9) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_154,plain,
( ~ in('#skF_4','#skF_5')
| subset(singleton('#skF_4'),'#skF_5') ),
inference(superposition,[status(thm),theory(equality)],[c_143,c_18]) ).
tff(c_161,plain,
subset(singleton('#skF_4'),'#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_85,c_154]) ).
tff(c_163,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_90,c_161]) ).
tff(c_164,plain,
subset(singleton('#skF_6'),'#skF_7'),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_166,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_86,c_164]) ).
tff(c_168,plain,
in('#skF_6','#skF_7'),
inference(splitRight,[status(thm)],[c_26]) ).
tff(c_24,plain,
( ~ subset(singleton('#skF_4'),'#skF_5')
| ~ in('#skF_6','#skF_7') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_187,plain,
~ subset(singleton('#skF_4'),'#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_24]) ).
tff(c_167,plain,
in('#skF_4','#skF_5'),
inference(splitRight,[status(thm)],[c_26]) ).
tff(c_190,plain,
! [A_54,B_55] :
( in('#skF_3'(A_54,B_55),A_54)
| subset(A_54,B_55) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_241,plain,
! [A_67,B_68] :
( ( '#skF_3'(singleton(A_67),B_68) = A_67 )
| subset(singleton(A_67),B_68) ),
inference(resolution,[status(thm)],[c_190,c_4]) ).
tff(c_249,plain,
'#skF_3'(singleton('#skF_4'),'#skF_5') = '#skF_4',
inference(resolution,[status(thm)],[c_241,c_187]) ).
tff(c_259,plain,
( ~ in('#skF_4','#skF_5')
| subset(singleton('#skF_4'),'#skF_5') ),
inference(superposition,[status(thm),theory(equality)],[c_249,c_18]) ).
tff(c_266,plain,
subset(singleton('#skF_4'),'#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_167,c_259]) ).
tff(c_268,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_187,c_266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU144+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/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.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 12:09:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.03/1.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.03/1.76
% 3.03/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/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 : 47
% 3.03/1.79 #Fact : 0
% 3.03/1.79 #Define : 0
% 3.03/1.79 #Split : 4
% 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 : 4
% 3.03/1.79 #Demod : 14
% 3.03/1.79 #Tautology : 16
% 3.03/1.79 #SimpNegUnit : 8
% 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.45
% 3.03/1.79 Parsing : 0.23
% 3.03/1.79 CNF conversion : 0.03
% 3.03/1.79 Main loop : 0.30
% 3.03/1.79 Inferencing : 0.12
% 3.03/1.79 Reduction : 0.07
% 3.03/1.79 Demodulation : 0.05
% 3.03/1.79 BG Simplification : 0.02
% 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.80
% 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
%------------------------------------------------------------------------------