TSTP Solution File: SEU143+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU143+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 : n031.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 2.47s 1.60s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 18 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 11 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 6 >; 3 *; 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 : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > #nlpp > singleton > empty_set > #skF_5 > #skF_6 > #skF_4 > #skF_3 > #skF_2 > #skF_1
%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('#skF_6',type,
'#skF_6': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_44,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_50,negated_conjecture,
~ ! [A] : ( singleton(A) != empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_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(c_16,plain,
! [B_11] : ~ in(B_11,empty_set),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_26,plain,
singleton('#skF_4') = empty_set,
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_36,plain,
! [C_13] : in(C_13,singleton(C_13)),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_39,plain,
in('#skF_4',empty_set),
inference(superposition,[status(thm),theory(equality)],[c_26,c_36]) ).
tff(c_41,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SEU143+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.15 % 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.15/0.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 12:32:44 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.47/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/1.60
% 2.47/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.47/1.64
% 2.47/1.64 Inference rules
% 2.47/1.64 ----------------------
% 2.47/1.64 #Ref : 0
% 2.47/1.64 #Sup : 3
% 2.47/1.64 #Fact : 0
% 2.47/1.64 #Define : 0
% 2.47/1.64 #Split : 0
% 2.47/1.64 #Chain : 0
% 2.47/1.64 #Close : 0
% 2.47/1.64
% 2.47/1.64 Ordering : KBO
% 2.47/1.64
% 2.47/1.64 Simplification rules
% 2.47/1.64 ----------------------
% 2.47/1.64 #Subsume : 0
% 2.47/1.64 #Demod : 0
% 2.47/1.64 #Tautology : 4
% 2.47/1.64 #SimpNegUnit : 1
% 2.47/1.64 #BackRed : 0
% 2.47/1.64
% 2.47/1.64 #Partial instantiations: 0
% 2.47/1.64 #Strategies tried : 1
% 2.47/1.64
% 2.47/1.64 Timing (in seconds)
% 2.47/1.64 ----------------------
% 2.47/1.64 Preprocessing : 0.45
% 2.47/1.64 Parsing : 0.24
% 2.47/1.64 CNF conversion : 0.03
% 2.47/1.64 Main loop : 0.12
% 2.47/1.64 Inferencing : 0.03
% 2.47/1.64 Reduction : 0.03
% 2.47/1.64 Demodulation : 0.02
% 2.47/1.64 BG Simplification : 0.01
% 2.47/1.64 Subsumption : 0.03
% 2.47/1.64 Abstraction : 0.01
% 2.47/1.64 MUC search : 0.00
% 2.47/1.64 Cooper : 0.00
% 2.47/1.64 Total : 0.62
% 2.47/1.64 Index Insertion : 0.00
% 2.47/1.64 Index Deletion : 0.00
% 2.47/1.64 Index Matching : 0.00
% 2.47/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------