TSTP Solution File: SET014-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET014-2 : TPTP v8.1.2. Bugfixed v2.1.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 : n001.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:55:31 EDT 2023
% Result : Unsatisfiable 90.35s 75.91s
% Output : CNFRefutation 90.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 34 ( 8 unt; 12 typ; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 14 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_sets > equal_elements > union > member_of_1_not_of_2 > intersection > #nlpp > complement > empty_set > cs > bs > as
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(member_of_1_not_of_2,type,
member_of_1_not_of_2: ( $i * $i ) > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff(bs,type,
bs: $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(complement,type,
complement: $i > $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(equal_elements,type,
equal_elements: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff(equal_sets,type,
equal_sets: ( $i * $i ) > $o ).
tff(as,type,
as: $i ).
tff(cs,type,
cs: $i ).
tff(f_172,axiom,
~ subset(union(as,bs),cs),
file(unknown,unknown) ).
tff(f_63,axiom,
! [Subset,Superset] :
( subset(Subset,Superset)
| member(member_of_1_not_of_2(Subset,Superset),Subset) ),
file(unknown,unknown) ).
tff(f_97,axiom,
! [X,Xs,Ys] :
( ~ member(X,union(Xs,Ys))
| member(X,Xs)
| member(X,Ys) ),
file(unknown,unknown) ).
tff(f_170,axiom,
subset(bs,cs),
file(unknown,unknown) ).
tff(f_59,axiom,
! [Element,Subset,Superset] :
( ~ member(Element,Subset)
| ~ subset(Subset,Superset)
| member(Element,Superset) ),
file(unknown,unknown) ).
tff(f_68,axiom,
! [Subset,Superset] :
( ~ member(member_of_1_not_of_2(Subset,Superset),Superset)
| subset(Subset,Superset) ),
file(unknown,unknown) ).
tff(f_169,axiom,
subset(as,cs),
file(unknown,unknown) ).
tff(c_48,plain,
~ subset(union(as,bs),cs),
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_6,plain,
! [Subset_5,Superset_6] :
( member(member_of_1_not_of_2(Subset_5,Superset_6),Subset_5)
| subset(Subset_5,Superset_6) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_314,plain,
! [X_113,Ys_114,Xs_115] :
( member(X_113,Ys_114)
| member(X_113,Xs_115)
| ~ member(X_113,union(Xs_115,Ys_114)) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_1201,plain,
! [Xs_196,Ys_197,Superset_198] :
( member(member_of_1_not_of_2(union(Xs_196,Ys_197),Superset_198),Ys_197)
| member(member_of_1_not_of_2(union(Xs_196,Ys_197),Superset_198),Xs_196)
| subset(union(Xs_196,Ys_197),Superset_198) ),
inference(resolution,[status(thm)],[c_6,c_314]) ).
tff(c_46,plain,
subset(bs,cs),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_156,plain,
! [Element_84,Superset_85,Subset_86] :
( member(Element_84,Superset_85)
| ~ subset(Subset_86,Superset_85)
| ~ member(Element_84,Subset_86) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_194,plain,
! [Element_91] :
( member(Element_91,cs)
| ~ member(Element_91,bs) ),
inference(resolution,[status(thm)],[c_46,c_156]) ).
tff(c_8,plain,
! [Subset_7,Superset_8] :
( subset(Subset_7,Superset_8)
| ~ member(member_of_1_not_of_2(Subset_7,Superset_8),Superset_8) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_199,plain,
! [Subset_7] :
( subset(Subset_7,cs)
| ~ member(member_of_1_not_of_2(Subset_7,cs),bs) ),
inference(resolution,[status(thm)],[c_194,c_8]) ).
tff(c_161536,plain,
! [Xs_3278] :
( member(member_of_1_not_of_2(union(Xs_3278,bs),cs),Xs_3278)
| subset(union(Xs_3278,bs),cs) ),
inference(resolution,[status(thm)],[c_1201,c_199]) ).
tff(c_44,plain,
subset(as,cs),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_188,plain,
! [Element_90] :
( member(Element_90,cs)
| ~ member(Element_90,as) ),
inference(resolution,[status(thm)],[c_44,c_156]) ).
tff(c_193,plain,
! [Subset_7] :
( subset(Subset_7,cs)
| ~ member(member_of_1_not_of_2(Subset_7,cs),as) ),
inference(resolution,[status(thm)],[c_188,c_8]) ).
tff(c_161774,plain,
subset(union(as,bs),cs),
inference(resolution,[status(thm)],[c_161536,c_193]) ).
tff(c_161874,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_48,c_48,c_161774]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET014-2 : TPTP v8.1.2. Bugfixed v2.1.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.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:36:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 90.35/75.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 90.35/75.92
% 90.35/75.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 90.35/75.95
% 90.35/75.95 Inference rules
% 90.35/75.95 ----------------------
% 90.35/75.95 #Ref : 0
% 90.35/75.95 #Sup : 36384
% 90.35/75.95 #Fact : 44
% 90.35/75.95 #Define : 0
% 90.35/75.95 #Split : 69
% 90.35/75.95 #Chain : 0
% 90.35/75.95 #Close : 0
% 90.35/75.95
% 90.35/75.95 Ordering : KBO
% 90.35/75.95
% 90.35/75.95 Simplification rules
% 90.35/75.95 ----------------------
% 90.35/75.95 #Subsume : 5872
% 90.35/75.95 #Demod : 5303
% 90.35/75.95 #Tautology : 4370
% 90.35/75.95 #SimpNegUnit : 971
% 90.35/75.95 #BackRed : 4
% 90.35/75.95
% 90.35/75.95 #Partial instantiations: 0
% 90.35/75.95 #Strategies tried : 1
% 90.35/75.95
% 90.35/75.95 Timing (in seconds)
% 90.35/75.95 ----------------------
% 90.35/75.95 Preprocessing : 0.47
% 90.35/75.95 Parsing : 0.25
% 90.35/75.95 CNF conversion : 0.03
% 90.35/75.95 Main loop : 74.43
% 90.35/75.95 Inferencing : 7.79
% 90.35/75.95 Reduction : 37.07
% 90.35/75.95 Demodulation : 30.50
% 90.35/75.95 BG Simplification : 0.18
% 90.35/75.95 Subsumption : 24.81
% 90.35/75.96 Abstraction : 0.32
% 90.35/75.96 MUC search : 0.00
% 90.35/75.96 Cooper : 0.00
% 90.35/75.96 Total : 74.95
% 90.35/75.96 Index Insertion : 0.00
% 90.35/75.96 Index Deletion : 0.00
% 90.35/75.96 Index Matching : 0.00
% 90.35/75.96 BG Taut test : 0.00
%------------------------------------------------------------------------------