TSTP Solution File: SET884+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET884+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 : n001.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:16 EDT 2023
% Result : Theorem 3.03s 1.67s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of formulae : 29 ( 6 unt; 15 typ; 0 def)
% Number of atoms : 29 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 25 ( 10 ~; 7 |; 2 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 10 >; 10 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > unordered_pair > #nlpp > singleton > #skF_4 > #skF_7 > #skF_10 > #skF_6 > #skF_9 > #skF_8 > #skF_3 > #skF_2 > #skF_1 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_73,negated_conjecture,
~ ! [A,B,C] :
~ ( subset(singleton(A),unordered_pair(B,C))
& ( A != B )
& ( A != C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_zfmisc_1) ).
tff(f_40,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(f_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_49,axiom,
! [A,B,C] :
( ( C = unordered_pair(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
tff(c_50,plain,
'#skF_9' != '#skF_8',
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_48,plain,
'#skF_10' != '#skF_8',
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_52,plain,
subset(singleton('#skF_8'),unordered_pair('#skF_9','#skF_10')),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_8,plain,
! [C_9] : in(C_9,singleton(C_9)),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_176,plain,
! [C_49,B_50,A_51] :
( in(C_49,B_50)
| ~ in(C_49,A_51)
| ~ subset(A_51,B_50) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_189,plain,
! [C_52,B_53] :
( in(C_52,B_53)
| ~ subset(singleton(C_52),B_53) ),
inference(resolution,[status(thm)],[c_8,c_176]) ).
tff(c_197,plain,
in('#skF_8',unordered_pair('#skF_9','#skF_10')),
inference(resolution,[status(thm)],[c_52,c_189]) ).
tff(c_18,plain,
! [D_15,B_11,A_10] :
( ( D_15 = B_11 )
| ( D_15 = A_10 )
| ~ in(D_15,unordered_pair(A_10,B_11)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_204,plain,
( ( '#skF_10' = '#skF_8' )
| ( '#skF_9' = '#skF_8' ) ),
inference(resolution,[status(thm)],[c_197,c_18]) ).
tff(c_211,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_50,c_48,c_204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET884+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/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.12/0.32 % Computer : n001.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 17:31:25 EDT 2023
% 0.12/0.33 % CPUTime :
% 3.03/1.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.03/1.67
% 3.03/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.03/1.70
% 3.03/1.70 Inference rules
% 3.03/1.70 ----------------------
% 3.03/1.70 #Ref : 0
% 3.03/1.70 #Sup : 37
% 3.03/1.70 #Fact : 0
% 3.03/1.70 #Define : 0
% 3.03/1.70 #Split : 0
% 3.03/1.70 #Chain : 0
% 3.03/1.70 #Close : 0
% 3.03/1.70
% 3.03/1.70 Ordering : KBO
% 3.03/1.70
% 3.03/1.70 Simplification rules
% 3.03/1.70 ----------------------
% 3.03/1.70 #Subsume : 4
% 3.03/1.70 #Demod : 6
% 3.03/1.70 #Tautology : 17
% 3.03/1.70 #SimpNegUnit : 1
% 3.03/1.70 #BackRed : 0
% 3.03/1.70
% 3.03/1.70 #Partial instantiations: 0
% 3.03/1.70 #Strategies tried : 1
% 3.03/1.70
% 3.03/1.70 Timing (in seconds)
% 3.03/1.70 ----------------------
% 3.08/1.70 Preprocessing : 0.46
% 3.08/1.70 Parsing : 0.23
% 3.08/1.70 CNF conversion : 0.04
% 3.08/1.70 Main loop : 0.25
% 3.08/1.70 Inferencing : 0.08
% 3.08/1.70 Reduction : 0.08
% 3.08/1.70 Demodulation : 0.06
% 3.08/1.70 BG Simplification : 0.02
% 3.08/1.70 Subsumption : 0.06
% 3.08/1.70 Abstraction : 0.01
% 3.08/1.70 MUC search : 0.00
% 3.08/1.70 Cooper : 0.00
% 3.08/1.70 Total : 0.75
% 3.08/1.70 Index Insertion : 0.00
% 3.08/1.70 Index Deletion : 0.00
% 3.08/1.70 Index Matching : 0.00
% 3.08/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------