TSTP Solution File: SET867+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET867+1 : 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 : n015.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:15 EDT 2023
% Result : Theorem 3.00s 1.72s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 21 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 16 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 2 |; 1 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 11 (; 10 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > #nlpp > union > empty_set > #skF_1 > #skF_7 > #skF_3 > #skF_6 > #skF_5 > #skF_2 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(union,type,
union: $i > $i ).
tff('#skF_1',type,
'#skF_1': $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_6',type,
'#skF_6': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_55,negated_conjecture,
union(empty_set) != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_zfmisc_1) ).
tff(f_37,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_47,axiom,
! [A,B] :
( ( B = union(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] :
( in(C,D)
& in(D,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
tff(c_32,plain,
union(empty_set) != empty_set,
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_6,plain,
! [A_3] :
( ( empty_set = A_3 )
| in('#skF_1'(A_3),A_3) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_73,plain,
! [A_40,C_41] :
( in('#skF_5'(A_40,union(A_40),C_41),A_40)
| ~ in(C_41,union(A_40)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_4,plain,
! [B_6] : ~ in(B_6,empty_set),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_85,plain,
! [C_42] : ~ in(C_42,union(empty_set)),
inference(resolution,[status(thm)],[c_73,c_4]) ).
tff(c_97,plain,
union(empty_set) = empty_set,
inference(resolution,[status(thm)],[c_6,c_85]) ).
tff(c_104,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET867+1 : TPTP v8.1.2. Released v3.2.0.
% 0.16/0.15 % 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.16/0.37 % Computer : n015.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 17:09:44 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.00/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.00/1.72
% 3.00/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/1.75
% 3.00/1.75 Inference rules
% 3.00/1.75 ----------------------
% 3.00/1.75 #Ref : 0
% 3.00/1.75 #Sup : 15
% 3.00/1.75 #Fact : 0
% 3.00/1.75 #Define : 0
% 3.00/1.75 #Split : 0
% 3.00/1.75 #Chain : 0
% 3.00/1.75 #Close : 0
% 3.00/1.75
% 3.00/1.75 Ordering : KBO
% 3.00/1.75
% 3.00/1.75 Simplification rules
% 3.00/1.75 ----------------------
% 3.00/1.75 #Subsume : 0
% 3.00/1.75 #Demod : 0
% 3.00/1.75 #Tautology : 2
% 3.00/1.75 #SimpNegUnit : 1
% 3.00/1.75 #BackRed : 0
% 3.00/1.75
% 3.00/1.75 #Partial instantiations: 0
% 3.00/1.75 #Strategies tried : 1
% 3.00/1.75
% 3.00/1.75 Timing (in seconds)
% 3.00/1.75 ----------------------
% 3.00/1.75 Preprocessing : 0.47
% 3.00/1.75 Parsing : 0.24
% 3.00/1.75 CNF conversion : 0.04
% 3.00/1.75 Main loop : 0.21
% 3.00/1.75 Inferencing : 0.08
% 3.00/1.75 Reduction : 0.05
% 3.00/1.75 Demodulation : 0.03
% 3.00/1.75 BG Simplification : 0.01
% 3.00/1.75 Subsumption : 0.06
% 3.00/1.75 Abstraction : 0.01
% 3.00/1.75 MUC search : 0.00
% 3.00/1.75 Cooper : 0.00
% 3.00/1.75 Total : 0.72
% 3.00/1.75 Index Insertion : 0.00
% 3.00/1.75 Index Deletion : 0.00
% 3.00/1.75 Index Matching : 0.00
% 3.00/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------