TSTP Solution File: SEU158+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU158+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 : n008.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.12s 1.58s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 14 unt; 7 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 : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > #nlpp > singleton > #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(subset,type,
subset: ( $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('#skF_4',type,
'#skF_4': $i ).
tff(f_39,negated_conjecture,
~ ! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_zfmisc_1) ).
tff(f_43,axiom,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
tff(c_10,plain,
( in('#skF_1','#skF_2')
| ~ in('#skF_3','#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_20,plain,
~ in('#skF_3','#skF_4'),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_14,plain,
( in('#skF_1','#skF_2')
| subset(singleton('#skF_3'),'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_33,plain,
subset(singleton('#skF_3'),'#skF_4'),
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_16,plain,
! [A_5,B_6] :
( in(A_5,B_6)
| ~ subset(singleton(A_5),B_6) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_37,plain,
in('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_33,c_16]) ).
tff(c_41,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_20,c_37]) ).
tff(c_42,plain,
in('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_18,plain,
! [A_5,B_6] :
( subset(singleton(A_5),B_6)
| ~ in(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_43,plain,
~ subset(singleton('#skF_3'),'#skF_4'),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_12,plain,
( ~ subset(singleton('#skF_1'),'#skF_2')
| subset(singleton('#skF_3'),'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_56,plain,
~ subset(singleton('#skF_1'),'#skF_2'),
inference(negUnitSimplification,[status(thm)],[c_43,c_12]) ).
tff(c_59,plain,
~ in('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_18,c_56]) ).
tff(c_63,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_59]) ).
tff(c_64,plain,
in('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_86,plain,
! [A_21,B_22] :
( subset(singleton(A_21),B_22)
| ~ in(A_21,B_22) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_65,plain,
in('#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_8,plain,
( ~ subset(singleton('#skF_1'),'#skF_2')
| ~ in('#skF_3','#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_75,plain,
~ subset(singleton('#skF_1'),'#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_65,c_8]) ).
tff(c_92,plain,
~ in('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_86,c_75]) ).
tff(c_97,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_64,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU158+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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 : n008.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 11:44:19 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.12/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.12/1.58
% 2.12/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.62
% 2.78/1.62 Inference rules
% 2.78/1.62 ----------------------
% 2.78/1.62 #Ref : 0
% 2.78/1.62 #Sup : 13
% 2.78/1.62 #Fact : 0
% 2.78/1.62 #Define : 0
% 2.78/1.62 #Split : 3
% 2.78/1.62 #Chain : 0
% 2.78/1.62 #Close : 0
% 2.78/1.62
% 2.78/1.62 Ordering : KBO
% 2.78/1.62
% 2.78/1.62 Simplification rules
% 2.78/1.62 ----------------------
% 2.78/1.62 #Subsume : 2
% 2.78/1.62 #Demod : 4
% 2.78/1.62 #Tautology : 4
% 2.78/1.62 #SimpNegUnit : 2
% 2.78/1.62 #BackRed : 0
% 2.78/1.62
% 2.78/1.62 #Partial instantiations: 0
% 2.78/1.62 #Strategies tried : 1
% 2.78/1.62
% 2.78/1.62 Timing (in seconds)
% 2.78/1.62 ----------------------
% 2.78/1.62 Preprocessing : 0.38
% 2.78/1.62 Parsing : 0.21
% 2.78/1.62 CNF conversion : 0.02
% 2.78/1.62 Main loop : 0.20
% 2.78/1.62 Inferencing : 0.08
% 2.78/1.62 Reduction : 0.04
% 2.78/1.62 Demodulation : 0.03
% 2.78/1.62 BG Simplification : 0.01
% 2.78/1.62 Subsumption : 0.05
% 2.78/1.62 Abstraction : 0.01
% 2.78/1.62 MUC search : 0.00
% 2.78/1.62 Cooper : 0.00
% 2.78/1.62 Total : 0.63
% 2.78/1.62 Index Insertion : 0.00
% 2.78/1.62 Index Deletion : 0.00
% 2.78/1.62 Index Matching : 0.00
% 2.78/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------