TSTP Solution File: SET643+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET643+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 : n012.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:47 EDT 2023
% Result : Theorem 3.92s 1.93s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 29
% Syntax : Number of formulae : 37 ( 6 unt; 25 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 21 ( 8 ~; 6 |; 0 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 37 ( 22 >; 15 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 3 con; 0-3 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > ilf_type > relation_like > empty > relation_type > ordered_pair > cross_product > #nlpp > subset_type > power_set > member_type > set_type > #skF_7 > #skF_6 > #skF_1 > #skF_4 > #skF_8 > #skF_3 > #skF_13 > #skF_10 > #skF_2 > #skF_11 > #skF_9 > #skF_5 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $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('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $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_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(ilf_type,type,
ilf_type: ( $i * $i ) > $o ).
tff(member_type,type,
member_type: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(subset_type,type,
subset_type: $i > $i ).
tff(relation_like,type,
relation_like: $i > $o ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_233,axiom,
! [B] : ilf_type(B,set_type),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p19) ).
tff(f_138,axiom,
! [B] :
( ilf_type(B,set_type)
=> subset(B,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10) ).
tff(f_38,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,set_type)
=> ( subset(B,cross_product(C,D))
=> ilf_type(B,relation_type(C,D)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
tff(f_242,negated_conjecture,
~ ! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ilf_type(cross_product(B,C),relation_type(B,C)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_5) ).
tff(c_82,plain,
! [B_154] : ilf_type(B_154,set_type),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_40,plain,
! [B_99] :
( subset(B_99,B_99)
| ~ ilf_type(B_99,set_type) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_132,plain,
! [B_99] : subset(B_99,B_99),
inference(demodulation,[status(thm),theory(equality)],[c_82,c_40]) ).
tff(c_2,plain,
! [B_1,C_5,D_7] :
( ilf_type(B_1,relation_type(C_5,D_7))
| ~ subset(B_1,cross_product(C_5,D_7))
| ~ ilf_type(D_7,set_type)
| ~ ilf_type(C_5,set_type)
| ~ ilf_type(B_1,set_type) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_390,plain,
! [B_214,C_215,D_216] :
( ilf_type(B_214,relation_type(C_215,D_216))
| ~ subset(B_214,cross_product(C_215,D_216)) ),
inference(demodulation,[status(thm),theory(equality)],[c_82,c_82,c_82,c_2]) ).
tff(c_400,plain,
! [C_215,D_216] : ilf_type(cross_product(C_215,D_216),relation_type(C_215,D_216)),
inference(resolution,[status(thm)],[c_132,c_390]) ).
tff(c_84,plain,
~ ilf_type(cross_product('#skF_12','#skF_13'),relation_type('#skF_12','#skF_13')),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_404,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_400,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET643+3 : TPTP v8.1.2. Released v2.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.16/0.35 % Computer : n012.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 16:17:07 EDT 2023
% 0.16/0.36 % CPUTime :
% 3.92/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.93
% 3.92/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.92/1.96
% 3.92/1.96 Inference rules
% 3.92/1.96 ----------------------
% 3.92/1.96 #Ref : 0
% 3.92/1.96 #Sup : 43
% 3.92/1.96 #Fact : 0
% 3.92/1.96 #Define : 0
% 3.92/1.96 #Split : 0
% 3.92/1.96 #Chain : 0
% 3.92/1.96 #Close : 0
% 3.92/1.96
% 3.92/1.96 Ordering : KBO
% 3.92/1.96
% 3.92/1.96 Simplification rules
% 3.92/1.96 ----------------------
% 3.92/1.96 #Subsume : 5
% 3.92/1.96 #Demod : 98
% 3.92/1.96 #Tautology : 20
% 3.92/1.96 #SimpNegUnit : 5
% 3.92/1.96 #BackRed : 1
% 3.92/1.96
% 3.92/1.96 #Partial instantiations: 0
% 3.92/1.96 #Strategies tried : 1
% 3.92/1.96
% 3.92/1.96 Timing (in seconds)
% 3.92/1.96 ----------------------
% 3.92/1.96 Preprocessing : 0.59
% 3.92/1.96 Parsing : 0.30
% 3.92/1.96 CNF conversion : 0.05
% 3.92/1.96 Main loop : 0.31
% 3.92/1.96 Inferencing : 0.12
% 3.92/1.96 Reduction : 0.10
% 3.92/1.96 Demodulation : 0.07
% 3.92/1.96 BG Simplification : 0.03
% 3.92/1.96 Subsumption : 0.06
% 3.92/1.96 Abstraction : 0.02
% 3.92/1.96 MUC search : 0.00
% 3.92/1.96 Cooper : 0.00
% 3.92/1.96 Total : 0.95
% 3.92/1.96 Index Insertion : 0.00
% 3.92/1.96 Index Deletion : 0.00
% 3.92/1.96 Index Matching : 0.00
% 3.92/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------