TSTP Solution File: SET942+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET942+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 : n008.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 6.75s 2.67s
% Output : CNFRefutation 6.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 35 ( 6 unt; 13 typ; 0 def)
% Number of atoms : 51 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 24 ~; 23 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 43 (; 42 !; 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_55,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_38,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
tff(f_60,negated_conjecture,
~ ! [A,B] :
( subset(A,B)
=> subset(union(A),union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t95_zfmisc_1) ).
tff(c_32,plain,
! [A_27] : subset(A_27,A_27),
inference(cnfTransformation,[status(thm)],[f_55]) ).
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_14,plain,
! [C_23,A_8] :
( in(C_23,'#skF_5'(A_8,union(A_8),C_23))
| ~ in(C_23,union(A_8)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_36,plain,
subset('#skF_8','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_59,plain,
! [A_44,C_45] :
( in('#skF_5'(A_44,union(A_44),C_45),A_44)
| ~ in(C_45,union(A_44)) ),
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_200,plain,
! [A_72,C_73,B_74] :
( in('#skF_5'(A_72,union(A_72),C_73),B_74)
| ~ subset(A_72,B_74)
| ~ in(C_73,union(A_72)) ),
inference(resolution,[status(thm)],[c_59,c_4]) ).
tff(c_1861,plain,
! [A_253,C_254,B_255,B_256] :
( in('#skF_5'(A_253,union(A_253),C_254),B_255)
| ~ subset(B_256,B_255)
| ~ subset(A_253,B_256)
| ~ in(C_254,union(A_253)) ),
inference(resolution,[status(thm)],[c_200,c_4]) ).
tff(c_1874,plain,
! [A_257,C_258] :
( in('#skF_5'(A_257,union(A_257),C_258),'#skF_9')
| ~ subset(A_257,'#skF_8')
| ~ in(C_258,union(A_257)) ),
inference(resolution,[status(thm)],[c_36,c_1861]) ).
tff(c_10,plain,
! [C_23,A_8,D_26] :
( in(C_23,union(A_8))
| ~ in(D_26,A_8)
| ~ in(C_23,D_26) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_3217,plain,
! [C_327,A_328,C_329] :
( in(C_327,union('#skF_9'))
| ~ in(C_327,'#skF_5'(A_328,union(A_328),C_329))
| ~ subset(A_328,'#skF_8')
| ~ in(C_329,union(A_328)) ),
inference(resolution,[status(thm)],[c_1874,c_10]) ).
tff(c_3328,plain,
! [C_331,A_332] :
( in(C_331,union('#skF_9'))
| ~ subset(A_332,'#skF_8')
| ~ in(C_331,union(A_332)) ),
inference(resolution,[status(thm)],[c_14,c_3217]) ).
tff(c_3575,plain,
! [A_343,B_344] :
( in('#skF_1'(union(A_343),B_344),union('#skF_9'))
| ~ subset(A_343,'#skF_8')
| subset(union(A_343),B_344) ),
inference(resolution,[status(thm)],[c_8,c_3328]) ).
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_3604,plain,
! [A_345] :
( ~ subset(A_345,'#skF_8')
| subset(union(A_345),union('#skF_9')) ),
inference(resolution,[status(thm)],[c_3575,c_6]) ).
tff(c_34,plain,
~ subset(union('#skF_8'),union('#skF_9')),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_3624,plain,
~ subset('#skF_8','#skF_8'),
inference(resolution,[status(thm)],[c_3604,c_34]) ).
tff(c_3636,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_3624]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET942+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/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.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 16:46:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.75/2.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.75/2.67
% 6.75/2.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.96/2.70
% 6.96/2.70 Inference rules
% 6.96/2.70 ----------------------
% 6.96/2.70 #Ref : 0
% 6.96/2.70 #Sup : 825
% 6.96/2.70 #Fact : 0
% 6.96/2.70 #Define : 0
% 6.96/2.70 #Split : 3
% 6.96/2.70 #Chain : 0
% 6.96/2.70 #Close : 0
% 6.96/2.70
% 6.96/2.70 Ordering : KBO
% 6.96/2.70
% 6.96/2.70 Simplification rules
% 6.96/2.70 ----------------------
% 6.96/2.70 #Subsume : 61
% 6.96/2.70 #Demod : 13
% 6.96/2.70 #Tautology : 11
% 6.96/2.70 #SimpNegUnit : 7
% 6.96/2.70 #BackRed : 8
% 6.96/2.70
% 6.96/2.70 #Partial instantiations: 0
% 6.96/2.70 #Strategies tried : 1
% 6.96/2.70
% 6.96/2.70 Timing (in seconds)
% 6.96/2.70 ----------------------
% 6.96/2.70 Preprocessing : 0.49
% 6.96/2.70 Parsing : 0.26
% 6.96/2.70 CNF conversion : 0.04
% 6.96/2.70 Main loop : 1.16
% 6.96/2.70 Inferencing : 0.39
% 6.96/2.70 Reduction : 0.25
% 6.96/2.70 Demodulation : 0.15
% 6.96/2.70 BG Simplification : 0.05
% 6.96/2.70 Subsumption : 0.39
% 6.96/2.70 Abstraction : 0.05
% 6.96/2.70 MUC search : 0.00
% 6.96/2.70 Cooper : 0.00
% 6.96/2.70 Total : 1.69
% 6.96/2.70 Index Insertion : 0.00
% 6.96/2.70 Index Deletion : 0.00
% 6.96/2.70 Index Matching : 0.00
% 6.96/2.70 BG Taut test : 0.00
%------------------------------------------------------------------------------