TSTP Solution File: SEU158+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU158+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 : 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:49 EDT 2023
% Result : Theorem 2.18s 1.69s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 7 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > #nlpp > singleton > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $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_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('#skF_4',type,
'#skF_4': $i ).
tff(f_43,negated_conjecture,
~ ! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_zfmisc_1) ).
tff(f_47,axiom,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
tff(c_12,plain,
( in('#skF_3','#skF_4')
| ~ in('#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_23,plain,
~ in('#skF_5','#skF_6'),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_16,plain,
( in('#skF_3','#skF_4')
| subset(singleton('#skF_5'),'#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_24,plain,
subset(singleton('#skF_5'),'#skF_6'),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_26,plain,
! [A_10,B_11] :
( in(A_10,B_11)
| ~ subset(singleton(A_10),B_11) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_29,plain,
in('#skF_5','#skF_6'),
inference(resolution,[status(thm)],[c_24,c_26]) ).
tff(c_37,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_23,c_29]) ).
tff(c_38,plain,
in('#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_20,plain,
! [A_5,B_6] :
( subset(singleton(A_5),B_6)
| ~ in(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_39,plain,
~ subset(singleton('#skF_5'),'#skF_6'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_14,plain,
( ~ subset(singleton('#skF_3'),'#skF_4')
| subset(singleton('#skF_5'),'#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_63,plain,
~ subset(singleton('#skF_3'),'#skF_4'),
inference(negUnitSimplification,[status(thm)],[c_39,c_14]) ).
tff(c_66,plain,
~ in('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_20,c_63]) ).
tff(c_70,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_38,c_66]) ).
tff(c_71,plain,
in('#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_82,plain,
! [A_18,B_19] :
( subset(singleton(A_18),B_19)
| ~ in(A_18,B_19) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_72,plain,
in('#skF_5','#skF_6'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_10,plain,
( ~ subset(singleton('#skF_3'),'#skF_4')
| ~ in('#skF_5','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_81,plain,
~ subset(singleton('#skF_3'),'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_72,c_10]) ).
tff(c_85,plain,
~ in('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_82,c_81]) ).
tff(c_89,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_71,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU158+3 : TPTP v8.1.2. Released v3.2.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.18/0.35 % Computer : n016.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 12:04:07 EDT 2023
% 0.18/0.36 % CPUTime :
% 2.18/1.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.18/1.69
% 2.79/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.79/1.72
% 2.79/1.72 Inference rules
% 2.79/1.72 ----------------------
% 2.79/1.72 #Ref : 0
% 2.79/1.72 #Sup : 11
% 2.79/1.72 #Fact : 0
% 2.79/1.72 #Define : 0
% 2.79/1.72 #Split : 3
% 2.79/1.72 #Chain : 0
% 2.79/1.72 #Close : 0
% 2.79/1.72
% 2.79/1.72 Ordering : KBO
% 2.79/1.72
% 2.79/1.72 Simplification rules
% 2.79/1.72 ----------------------
% 2.79/1.72 #Subsume : 2
% 2.79/1.72 #Demod : 4
% 2.79/1.72 #Tautology : 2
% 2.79/1.72 #SimpNegUnit : 2
% 2.79/1.72 #BackRed : 0
% 2.79/1.72
% 2.79/1.72 #Partial instantiations: 0
% 2.79/1.72 #Strategies tried : 1
% 2.79/1.72
% 2.79/1.72 Timing (in seconds)
% 2.79/1.72 ----------------------
% 2.79/1.73 Preprocessing : 0.40
% 2.79/1.73 Parsing : 0.23
% 2.79/1.73 CNF conversion : 0.03
% 2.79/1.73 Main loop : 0.22
% 2.79/1.73 Inferencing : 0.08
% 2.79/1.73 Reduction : 0.05
% 2.79/1.73 Demodulation : 0.03
% 2.79/1.73 BG Simplification : 0.01
% 2.79/1.73 Subsumption : 0.06
% 2.79/1.73 Abstraction : 0.01
% 2.79/1.73 MUC search : 0.00
% 2.79/1.73 Cooper : 0.00
% 2.79/1.73 Total : 0.68
% 2.79/1.73 Index Insertion : 0.00
% 2.79/1.73 Index Deletion : 0.00
% 2.79/1.73 Index Matching : 0.00
% 2.79/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------