TSTP Solution File: SET194+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET194+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 : n019.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:10 EDT 2023
% Result : Theorem 3.32s 1.95s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 5 ~; 5 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > #nlpp > #skF_3 > #skF_5 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(union,type,
union: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
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_41,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
tff(f_33,axiom,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,B)
| member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
tff(f_59,negated_conjecture,
~ ! [B,C] : subset(B,union(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subset_of_union) ).
tff(c_12,plain,
! [B_4,C_5] :
( member('#skF_1'(B_4,C_5),B_4)
| subset(B_4,C_5) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_73,plain,
! [D_24,B_25,C_26] :
( ~ member(D_24,B_25)
| member(D_24,union(B_25,C_26)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_10,plain,
! [B_4,C_5] :
( ~ member('#skF_1'(B_4,C_5),C_5)
| subset(B_4,C_5) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_258,plain,
! [B_58,B_59,C_60] :
( subset(B_58,union(B_59,C_60))
| ~ member('#skF_1'(B_58,union(B_59,C_60)),B_59) ),
inference(resolution,[status(thm)],[c_73,c_10]) ).
tff(c_284,plain,
! [B_4,C_60] : subset(B_4,union(B_4,C_60)),
inference(resolution,[status(thm)],[c_12,c_258]) ).
tff(c_30,plain,
~ subset('#skF_4',union('#skF_4','#skF_5')),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_287,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_284,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET194+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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:36:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.32/1.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.32/1.95
% 3.32/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.32/1.97
% 3.32/1.97 Inference rules
% 3.32/1.97 ----------------------
% 3.32/1.97 #Ref : 0
% 3.32/1.97 #Sup : 59
% 3.32/1.97 #Fact : 0
% 3.32/1.97 #Define : 0
% 3.32/1.97 #Split : 0
% 3.32/1.97 #Chain : 0
% 3.32/1.97 #Close : 0
% 3.32/1.97
% 3.32/1.97 Ordering : KBO
% 3.32/1.97
% 3.32/1.97 Simplification rules
% 3.32/1.97 ----------------------
% 3.32/1.97 #Subsume : 13
% 3.32/1.97 #Demod : 2
% 3.32/1.97 #Tautology : 18
% 3.32/1.97 #SimpNegUnit : 0
% 3.32/1.97 #BackRed : 1
% 3.32/1.97
% 3.32/1.97 #Partial instantiations: 0
% 3.32/1.97 #Strategies tried : 1
% 3.32/1.97
% 3.32/1.97 Timing (in seconds)
% 3.32/1.97 ----------------------
% 3.32/1.98 Preprocessing : 0.46
% 3.32/1.98 Parsing : 0.25
% 3.32/1.98 CNF conversion : 0.03
% 3.32/1.98 Main loop : 0.31
% 3.32/1.98 Inferencing : 0.11
% 3.32/1.98 Reduction : 0.09
% 3.32/1.98 Demodulation : 0.07
% 3.32/1.98 BG Simplification : 0.02
% 3.32/1.98 Subsumption : 0.08
% 3.32/1.98 Abstraction : 0.01
% 3.32/1.98 MUC search : 0.00
% 3.32/1.98 Cooper : 0.00
% 3.32/1.98 Total : 0.81
% 3.32/1.98 Index Insertion : 0.00
% 3.32/1.98 Index Deletion : 0.00
% 3.32/1.98 Index Matching : 0.00
% 3.32/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------