TSTP Solution File: SET875+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET875+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/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 : n025.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 2.88s 1.74s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 20 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 15 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 1 |; 2 &)
% ( 2 <=>; 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 : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > #nlpp > singleton > #skF_5 > #skF_6 > #skF_3 > #skF_4 > #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('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
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_38,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(f_58,negated_conjecture,
~ ! [A,B] :
~ ( disjoint(singleton(A),singleton(B))
& ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_zfmisc_1) ).
tff(f_43,axiom,
! [A,B] :
~ ( disjoint(singleton(A),B)
& in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l25_zfmisc_1) ).
tff(c_6,plain,
! [C_7] : in(C_7,singleton(C_7)),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_24,plain,
'#skF_5' = '#skF_6',
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_26,plain,
disjoint(singleton('#skF_5'),singleton('#skF_6')),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_27,plain,
disjoint(singleton('#skF_6'),singleton('#skF_6')),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_26]) ).
tff(c_49,plain,
! [A_20,B_21] :
( ~ in(A_20,B_21)
| ~ disjoint(singleton(A_20),B_21) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_52,plain,
~ in('#skF_6',singleton('#skF_6')),
inference(resolution,[status(thm)],[c_27,c_49]) ).
tff(c_56,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET875+1 : TPTP v8.1.2. Released v3.2.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.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:02:34 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.88/1.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.88/1.75
% 2.88/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.88/1.77
% 2.88/1.77 Inference rules
% 2.88/1.77 ----------------------
% 2.88/1.77 #Ref : 0
% 2.88/1.77 #Sup : 6
% 2.88/1.77 #Fact : 0
% 2.88/1.77 #Define : 0
% 2.88/1.77 #Split : 0
% 2.88/1.77 #Chain : 0
% 2.88/1.77 #Close : 0
% 2.88/1.77
% 2.88/1.77 Ordering : KBO
% 2.88/1.77
% 2.88/1.77 Simplification rules
% 2.88/1.77 ----------------------
% 2.88/1.77 #Subsume : 0
% 2.88/1.77 #Demod : 3
% 2.88/1.77 #Tautology : 4
% 2.88/1.77 #SimpNegUnit : 0
% 2.88/1.77 #BackRed : 0
% 2.88/1.77
% 2.88/1.77 #Partial instantiations: 0
% 2.88/1.77 #Strategies tried : 1
% 2.88/1.77
% 2.88/1.77 Timing (in seconds)
% 2.88/1.77 ----------------------
% 2.88/1.77 Preprocessing : 0.47
% 2.88/1.77 Parsing : 0.25
% 2.88/1.77 CNF conversion : 0.03
% 2.88/1.77 Main loop : 0.14
% 2.88/1.77 Inferencing : 0.04
% 2.88/1.77 Reduction : 0.04
% 2.88/1.77 Demodulation : 0.03
% 2.88/1.77 BG Simplification : 0.01
% 2.88/1.77 Subsumption : 0.03
% 2.88/1.77 Abstraction : 0.01
% 2.88/1.77 MUC search : 0.00
% 2.88/1.77 Cooper : 0.00
% 2.88/1.77 Total : 0.65
% 2.88/1.77 Index Insertion : 0.00
% 2.88/1.77 Index Deletion : 0.00
% 2.88/1.78 Index Matching : 0.00
% 2.88/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------