TSTP Solution File: SET941+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET941+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 : n026.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:23 EDT 2023
% Result : Theorem 3.59s 1.97s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 29 ( 3 unt; 13 typ; 0 def)
% Number of atoms : 36 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 13 ~; 13 |; 1 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 9 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 29 (; 28 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > #nlpp > union > #skF_7 > #skF_3 > #skF_6 > #skF_5 > #skF_9 > #skF_8 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(union,type,
union: $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(subset,type,
subset: ( $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('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_63,negated_conjecture,
~ ! [A,B] :
( ! [C] :
( in(C,A)
=> subset(C,B) )
=> subset(union(A),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t94_zfmisc_1) ).
tff(f_38,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_48,axiom,
! [A,B] :
( ( B = union(A) )
<=> ! [C] :
( in(C,B)
<=> ? [D] :
( in(C,D)
& in(D,A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
tff(c_34,plain,
~ subset(union('#skF_8'),'#skF_9'),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_8,plain,
! [A_3,B_4] :
( in('#skF_1'(A_3,B_4),A_3)
| subset(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_12,plain,
! [A_8,C_23] :
( in('#skF_5'(A_8,union(A_8),C_23),A_8)
| ~ in(C_23,union(A_8)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_36,plain,
! [C_30] :
( subset(C_30,'#skF_9')
| ~ in(C_30,'#skF_8') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_74,plain,
! [C_49,A_50] :
( in(C_49,'#skF_5'(A_50,union(A_50),C_49))
| ~ in(C_49,union(A_50)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_4,plain,
! [C_7,B_4,A_3] :
( in(C_7,B_4)
| ~ in(C_7,A_3)
| ~ subset(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_343,plain,
! [C_96,B_97,A_98] :
( in(C_96,B_97)
| ~ subset('#skF_5'(A_98,union(A_98),C_96),B_97)
| ~ in(C_96,union(A_98)) ),
inference(resolution,[status(thm)],[c_74,c_4]) ).
tff(c_395,plain,
! [C_105,A_106] :
( in(C_105,'#skF_9')
| ~ in(C_105,union(A_106))
| ~ in('#skF_5'(A_106,union(A_106),C_105),'#skF_8') ),
inference(resolution,[status(thm)],[c_36,c_343]) ).
tff(c_406,plain,
! [C_107] :
( in(C_107,'#skF_9')
| ~ in(C_107,union('#skF_8')) ),
inference(resolution,[status(thm)],[c_12,c_395]) ).
tff(c_478,plain,
! [B_110] :
( in('#skF_1'(union('#skF_8'),B_110),'#skF_9')
| subset(union('#skF_8'),B_110) ),
inference(resolution,[status(thm)],[c_8,c_406]) ).
tff(c_6,plain,
! [A_3,B_4] :
( ~ in('#skF_1'(A_3,B_4),B_4)
| subset(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_486,plain,
subset(union('#skF_8'),'#skF_9'),
inference(resolution,[status(thm)],[c_478,c_6]) ).
tff(c_494,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_34,c_34,c_486]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET941+1 : TPTP v8.1.2. Released v3.2.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.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 16:28:47 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.59/1.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.59/1.98
% 3.59/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.59/2.01
% 3.59/2.01 Inference rules
% 3.59/2.01 ----------------------
% 3.59/2.01 #Ref : 0
% 3.59/2.01 #Sup : 99
% 3.59/2.01 #Fact : 0
% 3.59/2.01 #Define : 0
% 3.59/2.01 #Split : 0
% 3.59/2.01 #Chain : 0
% 3.59/2.01 #Close : 0
% 3.59/2.01
% 3.59/2.01 Ordering : KBO
% 3.59/2.01
% 3.59/2.01 Simplification rules
% 3.59/2.01 ----------------------
% 3.59/2.01 #Subsume : 4
% 3.59/2.01 #Demod : 1
% 3.59/2.01 #Tautology : 2
% 3.59/2.01 #SimpNegUnit : 1
% 3.59/2.01 #BackRed : 0
% 3.59/2.01
% 3.59/2.01 #Partial instantiations: 0
% 3.59/2.01 #Strategies tried : 1
% 3.59/2.01
% 3.59/2.01 Timing (in seconds)
% 3.59/2.01 ----------------------
% 3.59/2.01 Preprocessing : 0.50
% 3.59/2.01 Parsing : 0.26
% 3.59/2.01 CNF conversion : 0.04
% 3.59/2.01 Main loop : 0.44
% 3.59/2.01 Inferencing : 0.18
% 3.59/2.01 Reduction : 0.10
% 3.87/2.01 Demodulation : 0.06
% 3.87/2.01 BG Simplification : 0.03
% 3.87/2.01 Subsumption : 0.11
% 3.87/2.01 Abstraction : 0.02
% 3.87/2.01 MUC search : 0.00
% 3.87/2.01 Cooper : 0.00
% 3.87/2.01 Total : 0.99
% 3.87/2.01 Index Insertion : 0.00
% 3.87/2.01 Index Deletion : 0.00
% 3.87/2.01 Index Matching : 0.00
% 3.87/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------