TSTP Solution File: SET658+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET658+3 : TPTP v8.1.2. Released v2.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 : n021.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:56:49 EDT 2023
% Result : Theorem 4.67s 2.13s
% Output : CNFRefutation 4.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 34
% Syntax : Number of formulae : 43 ( 6 unt; 30 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 7 |; 0 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 26 >; 17 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 4 con; 0-3 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > ilf_type > relation_like > empty > range > domain > relation_type > ordered_pair > cross_product > #nlpp > subset_type > range_of > power_set > member_type > domain_of > set_type > binary_relation_type > #skF_9 > #skF_5 > #skF_6 > #skF_13 > #skF_10 > #skF_3 > #skF_8 > #skF_11 > #skF_2 > #skF_12 > #skF_7 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(relation_type,type,
relation_type: ( $i * $i ) > $i ).
tff(power_set,type,
power_set: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(cross_product,type,
cross_product: ( $i * $i ) > $i ).
tff(set_type,type,
set_type: $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(range,type,
range: ( $i * $i * $i ) > $i ).
tff(ilf_type,type,
ilf_type: ( $i * $i ) > $o ).
tff(member_type,type,
member_type: $i > $i ).
tff(range_of,type,
range_of: $i > $i ).
tff(domain,type,
domain: ( $i * $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(domain_of,type,
domain_of: $i > $i ).
tff(subset_type,type,
subset_type: $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(binary_relation_type,type,
binary_relation_type: $i ).
tff(relation_like,type,
relation_like: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_306,negated_conjecture,
~ ! [B] :
( ilf_type(B,binary_relation_type)
=> ilf_type(B,relation_type(domain_of(B),range_of(B))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_20) ).
tff(f_300,axiom,
! [B] : ilf_type(B,set_type),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p28) ).
tff(f_161,axiom,
! [B] :
( ilf_type(B,set_type)
=> subset(B,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p15) ).
tff(f_36,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,binary_relation_type)
=> ( subset(domain_of(C),B)
=> ilf_type(C,relation_type(B,range_of(C))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
tff(c_106,plain,
ilf_type('#skF_13',binary_relation_type),
inference(cnfTransformation,[status(thm)],[f_306]) ).
tff(c_102,plain,
! [B_148] : ilf_type(B_148,set_type),
inference(cnfTransformation,[status(thm)],[f_300]) ).
tff(c_52,plain,
! [B_65] :
( subset(B_65,B_65)
| ~ ilf_type(B_65,set_type) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_156,plain,
! [B_65] : subset(B_65,B_65),
inference(demodulation,[status(thm),theory(equality)],[c_102,c_52]) ).
tff(c_2,plain,
! [C_3,B_1] :
( ilf_type(C_3,relation_type(B_1,range_of(C_3)))
| ~ subset(domain_of(C_3),B_1)
| ~ ilf_type(C_3,binary_relation_type)
| ~ ilf_type(B_1,set_type) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_1043,plain,
! [C_300,B_301] :
( ilf_type(C_300,relation_type(B_301,range_of(C_300)))
| ~ subset(domain_of(C_300),B_301)
| ~ ilf_type(C_300,binary_relation_type) ),
inference(demodulation,[status(thm),theory(equality)],[c_102,c_2]) ).
tff(c_104,plain,
~ ilf_type('#skF_13',relation_type(domain_of('#skF_13'),range_of('#skF_13'))),
inference(cnfTransformation,[status(thm)],[f_306]) ).
tff(c_1055,plain,
( ~ subset(domain_of('#skF_13'),domain_of('#skF_13'))
| ~ ilf_type('#skF_13',binary_relation_type) ),
inference(resolution,[status(thm)],[c_1043,c_104]) ).
tff(c_1062,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_106,c_156,c_1055]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET658+3 : TPTP v8.1.2. Released v2.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 : n021.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:14:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.67/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.67/2.13
% 4.67/2.13 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.67/2.16
% 4.67/2.16 Inference rules
% 4.67/2.16 ----------------------
% 4.67/2.16 #Ref : 0
% 4.67/2.16 #Sup : 180
% 4.67/2.16 #Fact : 0
% 4.67/2.16 #Define : 0
% 4.67/2.16 #Split : 0
% 4.67/2.16 #Chain : 0
% 4.67/2.16 #Close : 0
% 4.67/2.16
% 4.67/2.16 Ordering : KBO
% 4.67/2.16
% 4.67/2.16 Simplification rules
% 4.67/2.16 ----------------------
% 4.67/2.16 #Subsume : 25
% 4.67/2.16 #Demod : 102
% 4.67/2.16 #Tautology : 36
% 4.67/2.16 #SimpNegUnit : 9
% 4.67/2.16 #BackRed : 0
% 4.67/2.16
% 4.67/2.16 #Partial instantiations: 0
% 4.67/2.16 #Strategies tried : 1
% 4.67/2.16
% 4.67/2.16 Timing (in seconds)
% 4.67/2.16 ----------------------
% 4.67/2.16 Preprocessing : 0.61
% 4.67/2.16 Parsing : 0.31
% 4.67/2.16 CNF conversion : 0.06
% 4.67/2.16 Main loop : 0.50
% 4.67/2.16 Inferencing : 0.19
% 4.67/2.16 Reduction : 0.15
% 4.67/2.16 Demodulation : 0.10
% 4.67/2.16 BG Simplification : 0.04
% 4.67/2.16 Subsumption : 0.10
% 4.67/2.16 Abstraction : 0.02
% 4.67/2.16 MUC search : 0.00
% 4.67/2.16 Cooper : 0.00
% 4.67/2.16 Total : 1.16
% 4.67/2.16 Index Insertion : 0.00
% 4.67/2.16 Index Deletion : 0.00
% 4.67/2.16 Index Matching : 0.00
% 4.67/2.16 BG Taut test : 0.00
%------------------------------------------------------------------------------