TSTP Solution File: SET625+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET625+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 : n016.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:44 EDT 2023
% Result : Theorem 3.06s 1.86s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 14 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 (; 32 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > intersect > #nlpp > #skF_5 > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(intersect,type,
intersect: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_58,negated_conjecture,
~ ! [B,C,D] :
( ( intersect(B,C)
& subset(C,D) )
=> intersect(B,D) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th101) ).
tff(f_34,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
tff(f_42,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
tff(f_47,axiom,
! [B,C] :
( intersect(B,C)
=> intersect(C,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_intersect) ).
tff(c_18,plain,
~ intersect('#skF_3','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_22,plain,
intersect('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_20,plain,
subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_4,plain,
! [B_1,C_2] :
( member('#skF_1'(B_1,C_2),C_2)
| ~ intersect(B_1,C_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_52,plain,
! [D_28,C_29,B_30] :
( member(D_28,C_29)
| ~ member(D_28,B_30)
| ~ subset(B_30,C_29) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_135,plain,
! [B_46,C_47,C_48] :
( member('#skF_1'(B_46,C_47),C_48)
| ~ subset(C_47,C_48)
| ~ intersect(B_46,C_47) ),
inference(resolution,[status(thm)],[c_4,c_52]) ).
tff(c_6,plain,
! [B_1,C_2] :
( member('#skF_1'(B_1,C_2),B_1)
| ~ intersect(B_1,C_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_42,plain,
! [B_25,C_26,D_27] :
( intersect(B_25,C_26)
| ~ member(D_27,C_26)
| ~ member(D_27,B_25) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_49,plain,
! [B_25,B_1,C_2] :
( intersect(B_25,B_1)
| ~ member('#skF_1'(B_1,C_2),B_25)
| ~ intersect(B_1,C_2) ),
inference(resolution,[status(thm)],[c_6,c_42]) ).
tff(c_150,plain,
! [C_49,B_50,C_51] :
( intersect(C_49,B_50)
| ~ subset(C_51,C_49)
| ~ intersect(B_50,C_51) ),
inference(resolution,[status(thm)],[c_135,c_49]) ).
tff(c_160,plain,
! [B_52] :
( intersect('#skF_5',B_52)
| ~ intersect(B_52,'#skF_4') ),
inference(resolution,[status(thm)],[c_20,c_150]) ).
tff(c_167,plain,
intersect('#skF_5','#skF_3'),
inference(resolution,[status(thm)],[c_22,c_160]) ).
tff(c_14,plain,
! [C_12,B_11] :
( intersect(C_12,B_11)
| ~ intersect(B_11,C_12) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_186,plain,
intersect('#skF_3','#skF_5'),
inference(resolution,[status(thm)],[c_167,c_14]) ).
tff(c_193,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_18,c_186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET625+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 : n016.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 17:01:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.06/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.86
% 3.06/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/1.89
% 3.16/1.89 Inference rules
% 3.16/1.89 ----------------------
% 3.16/1.89 #Ref : 0
% 3.16/1.89 #Sup : 43
% 3.16/1.89 #Fact : 0
% 3.16/1.89 #Define : 0
% 3.16/1.89 #Split : 0
% 3.16/1.89 #Chain : 0
% 3.16/1.89 #Close : 0
% 3.16/1.89
% 3.16/1.89 Ordering : KBO
% 3.16/1.89
% 3.16/1.89 Simplification rules
% 3.16/1.89 ----------------------
% 3.16/1.89 #Subsume : 6
% 3.16/1.89 #Demod : 12
% 3.16/1.89 #Tautology : 13
% 3.16/1.89 #SimpNegUnit : 1
% 3.16/1.89 #BackRed : 0
% 3.16/1.89
% 3.16/1.89 #Partial instantiations: 0
% 3.16/1.89 #Strategies tried : 1
% 3.16/1.89
% 3.16/1.89 Timing (in seconds)
% 3.16/1.89 ----------------------
% 3.16/1.90 Preprocessing : 0.44
% 3.16/1.90 Parsing : 0.24
% 3.16/1.90 CNF conversion : 0.03
% 3.16/1.90 Main loop : 0.32
% 3.16/1.90 Inferencing : 0.15
% 3.16/1.90 Reduction : 0.07
% 3.16/1.90 Demodulation : 0.05
% 3.16/1.90 BG Simplification : 0.02
% 3.16/1.90 Subsumption : 0.07
% 3.16/1.90 Abstraction : 0.01
% 3.16/1.90 MUC search : 0.00
% 3.16/1.90 Cooper : 0.00
% 3.16/1.90 Total : 0.82
% 3.16/1.90 Index Insertion : 0.00
% 3.16/1.90 Index Deletion : 0.00
% 3.16/1.90 Index Matching : 0.00
% 3.16/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------