TSTP Solution File: SET013-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET013-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 : n007.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:30 EDT 2023
% Result : Unsatisfiable 12.17s 4.50s
% Output : CNFRefutation 12.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of formulae : 50 ( 14 unt; 13 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 28 ~; 30 |; 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 62 (; 62 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_sets > equal_elements > union > member_of_1_not_of_2 > intersection > #nlpp > complement > empty_set > ds > 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(ds,type,
ds: $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_170,axiom,
~ equal_sets(cs,ds),
file(unknown,unknown) ).
tff(f_61,axiom,
! [Subset,Superset] :
( subset(Subset,Superset)
| member(member_of_1_not_of_2(Subset,Superset),Subset) ),
file(unknown,unknown) ).
tff(f_114,axiom,
! [X,Xs,Ys] :
( ~ member(X,intersection(Xs,Ys))
| member(X,Ys) ),
file(unknown,unknown) ).
tff(f_109,axiom,
! [X,Xs,Ys] :
( ~ member(X,intersection(Xs,Ys))
| member(X,Xs) ),
file(unknown,unknown) ).
tff(f_104,axiom,
! [X,Xs,Ys] :
( ~ member(X,Xs)
| ~ member(X,Ys)
| member(X,intersection(Xs,Ys)) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [Subset,Superset] :
( ~ member(member_of_1_not_of_2(Subset,Superset),Superset)
| subset(Subset,Superset) ),
file(unknown,unknown) ).
tff(f_133,axiom,
! [Set1,Set2] :
( ~ subset(Set1,Set2)
| ~ subset(Set2,Set1)
| equal_sets(Set2,Set1) ),
file(unknown,unknown) ).
tff(f_168,axiom,
equal_sets(intersection(bs,as),ds),
file(unknown,unknown) ).
tff(f_149,axiom,
! [Xs,Ys,Zs] :
( ~ equal_sets(Xs,Ys)
| ~ equal_sets(Ys,Zs)
| equal_sets(Xs,Zs) ),
file(unknown,unknown) ).
tff(f_141,axiom,
! [Xs,Ys] :
( ~ equal_sets(Xs,Ys)
| equal_sets(Ys,Xs) ),
file(unknown,unknown) ).
tff(f_167,axiom,
equal_sets(intersection(as,bs),cs),
file(unknown,unknown) ).
tff(c_48,plain,
~ equal_sets(cs,ds),
inference(cnfTransformation,[status(thm)],[f_170]) ).
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_61]) ).
tff(c_120,plain,
! [X_76,Ys_77,Xs_78] :
( member(X_76,Ys_77)
| ~ member(X_76,intersection(Xs_78,Ys_77)) ),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_125,plain,
! [Xs_78,Ys_77,Superset_6] :
( member(member_of_1_not_of_2(intersection(Xs_78,Ys_77),Superset_6),Ys_77)
| subset(intersection(Xs_78,Ys_77),Superset_6) ),
inference(resolution,[status(thm)],[c_6,c_120]) ).
tff(c_126,plain,
! [X_79,Xs_80,Ys_81] :
( member(X_79,Xs_80)
| ~ member(X_79,intersection(Xs_80,Ys_81)) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_131,plain,
! [Xs_80,Ys_81,Superset_6] :
( member(member_of_1_not_of_2(intersection(Xs_80,Ys_81),Superset_6),Xs_80)
| subset(intersection(Xs_80,Ys_81),Superset_6) ),
inference(resolution,[status(thm)],[c_6,c_126]) ).
tff(c_313,plain,
! [X_106,Xs_107,Ys_108] :
( member(X_106,intersection(Xs_107,Ys_108))
| ~ member(X_106,Ys_108)
| ~ member(X_106,Xs_107) ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
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_66]) ).
tff(c_1574,plain,
! [Subset_223,Xs_224,Ys_225] :
( subset(Subset_223,intersection(Xs_224,Ys_225))
| ~ member(member_of_1_not_of_2(Subset_223,intersection(Xs_224,Ys_225)),Ys_225)
| ~ member(member_of_1_not_of_2(Subset_223,intersection(Xs_224,Ys_225)),Xs_224) ),
inference(resolution,[status(thm)],[c_313,c_8]) ).
tff(c_14215,plain,
! [Xs_783,Ys_784,Xs_785] :
( ~ member(member_of_1_not_of_2(intersection(Xs_783,Ys_784),intersection(Xs_785,Xs_783)),Xs_785)
| subset(intersection(Xs_783,Ys_784),intersection(Xs_785,Xs_783)) ),
inference(resolution,[status(thm)],[c_131,c_1574]) ).
tff(c_14371,plain,
! [Xs_78,Ys_77] : subset(intersection(Xs_78,Ys_77),intersection(Ys_77,Xs_78)),
inference(resolution,[status(thm)],[c_125,c_14215]) ).
tff(c_14381,plain,
! [Xs_786,Ys_787] : subset(intersection(Xs_786,Ys_787),intersection(Ys_787,Xs_786)),
inference(resolution,[status(thm)],[c_125,c_14215]) ).
tff(c_30,plain,
! [Set2_36,Set1_35] :
( equal_sets(Set2_36,Set1_35)
| ~ subset(Set2_36,Set1_35)
| ~ subset(Set1_35,Set2_36) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_14391,plain,
! [Xs_786,Ys_787] :
( equal_sets(intersection(Xs_786,Ys_787),intersection(Ys_787,Xs_786))
| ~ subset(intersection(Ys_787,Xs_786),intersection(Xs_786,Ys_787)) ),
inference(resolution,[status(thm)],[c_14381,c_30]) ).
tff(c_14413,plain,
! [Xs_790,Ys_791] : equal_sets(intersection(Xs_790,Ys_791),intersection(Ys_791,Xs_790)),
inference(demodulation,[status(thm),theory(equality)],[c_14371,c_14391]) ).
tff(c_46,plain,
equal_sets(intersection(bs,as),ds),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_132,plain,
! [Xs_82,Zs_83,Ys_84] :
( equal_sets(Xs_82,Zs_83)
| ~ equal_sets(Ys_84,Zs_83)
| ~ equal_sets(Xs_82,Ys_84) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_146,plain,
! [Xs_82] :
( equal_sets(Xs_82,ds)
| ~ equal_sets(Xs_82,intersection(bs,as)) ),
inference(resolution,[status(thm)],[c_46,c_132]) ).
tff(c_14444,plain,
equal_sets(intersection(as,bs),ds),
inference(resolution,[status(thm)],[c_14413,c_146]) ).
tff(c_34,plain,
! [Ys_39,Xs_38] :
( equal_sets(Ys_39,Xs_38)
| ~ equal_sets(Xs_38,Ys_39) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_14478,plain,
equal_sets(ds,intersection(as,bs)),
inference(resolution,[status(thm)],[c_14444,c_34]) ).
tff(c_44,plain,
equal_sets(intersection(as,bs),cs),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_145,plain,
! [Xs_82] :
( equal_sets(Xs_82,cs)
| ~ equal_sets(Xs_82,intersection(as,bs)) ),
inference(resolution,[status(thm)],[c_44,c_132]) ).
tff(c_14498,plain,
equal_sets(ds,cs),
inference(resolution,[status(thm)],[c_14478,c_145]) ).
tff(c_14505,plain,
equal_sets(cs,ds),
inference(resolution,[status(thm)],[c_14498,c_34]) ).
tff(c_14510,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_48,c_14505]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET013-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.19/0.36 % Computer : n007.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 16:15:08 EDT 2023
% 0.19/0.36 % CPUTime :
% 12.17/4.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.17/4.50
% 12.17/4.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.17/4.53
% 12.17/4.53 Inference rules
% 12.17/4.53 ----------------------
% 12.17/4.53 #Ref : 0
% 12.17/4.53 #Sup : 3265
% 12.17/4.53 #Fact : 4
% 12.17/4.53 #Define : 0
% 12.17/4.53 #Split : 12
% 12.17/4.53 #Chain : 0
% 12.17/4.53 #Close : 0
% 12.17/4.53
% 12.17/4.53 Ordering : KBO
% 12.17/4.53
% 12.17/4.53 Simplification rules
% 12.17/4.53 ----------------------
% 12.17/4.53 #Subsume : 337
% 12.17/4.53 #Demod : 609
% 12.17/4.53 #Tautology : 592
% 12.17/4.54 #SimpNegUnit : 110
% 12.17/4.54 #BackRed : 0
% 12.17/4.54
% 12.17/4.54 #Partial instantiations: 0
% 12.17/4.54 #Strategies tried : 1
% 12.17/4.54
% 12.17/4.54 Timing (in seconds)
% 12.17/4.54 ----------------------
% 12.17/4.54 Preprocessing : 0.47
% 12.17/4.54 Parsing : 0.26
% 12.34/4.54 CNF conversion : 0.03
% 12.34/4.54 Main loop : 2.91
% 12.34/4.54 Inferencing : 0.86
% 12.34/4.54 Reduction : 1.02
% 12.34/4.54 Demodulation : 0.76
% 12.34/4.54 BG Simplification : 0.05
% 12.34/4.54 Subsumption : 0.78
% 12.34/4.54 Abstraction : 0.05
% 12.34/4.54 MUC search : 0.00
% 12.34/4.54 Cooper : 0.00
% 12.34/4.54 Total : 3.43
% 12.34/4.54 Index Insertion : 0.00
% 12.34/4.54 Index Deletion : 0.00
% 12.34/4.54 Index Matching : 0.00
% 12.34/4.54 BG Taut test : 0.00
%------------------------------------------------------------------------------