TMTP Model File: SET778-1.007-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : SET778-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n177.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-504.23.4.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 9 22:29:24 EDT 2015
% Result : Satisfiable 1.44s
% Output : Saturation 1.44s
% Verified :
% Statistics : Number of clauses : 27 ( 27 expanded)
% Number of leaves : 27 ( 27 expanded)
% Depth : 0
% Number of atoms : 71 ( 71 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 4 ( 3 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---4.0 format not known, defaulting to TPTP
cnf(u45,axiom,
( union(X0,X0,X0) )).
cnf(member_of_set1_is_member_of_union,axiom,
( ~ union(X3,X4,X5)
| member(X0,X5)
| ~ member(X0,X3) )).
cnf(member_of_set2_is_member_of_union,axiom,
( ~ union(X3,X4,X5)
| member(X0,X5)
| ~ member(X0,X4) )).
cnf(member_of_union_is_member_of_one_set,axiom,
( ~ union(X3,X4,X5)
| member(X0,X4)
| member(X0,X3)
| ~ member(X0,X5) )).
cnf(u17,axiom,
( equal_sets(X0,X0) )).
cnf(set_equal_sets_are_subsets1,axiom,
( ~ equal_sets(X1,X2)
| subset(X1,X2) )).
cnf(set_equal_sets_are_subsets2,axiom,
( ~ equal_sets(X2,X1)
| subset(X1,X2) )).
cnf(u14,axiom,
( subset(X0,X0) )).
cnf(membership_in_subsets,axiom,
( ~ subset(X1,X2)
| ~ member(X0,X1)
| member(X0,X2) )).
cnf(subsets_are_set_equal_sets,axiom,
( ~ subset(X4,X3)
| ~ subset(X3,X4)
| equal_sets(X4,X3) )).
cnf(u28,axiom,
( member(g(X4,X4,X5),X5)
| member(g(X4,X4,X5),X4)
| union(X4,X4,X5) )).
cnf(u28_001,axiom,
( member(g(X4,X4,X5),X5)
| member(g(X4,X4,X5),X4)
| union(X4,X4,X5) )).
cnf(u27,axiom,
( member(g(X2,X3,X2),X3)
| member(g(X2,X3,X2),X2)
| union(X2,X3,X2) )).
cnf(u27_002,axiom,
( member(g(X2,X3,X2),X3)
| member(g(X2,X3,X2),X2)
| union(X2,X3,X2) )).
cnf(u81,axiom,
( member(g(X8,X9,X8),X9)
| union(X8,X9,X8) )).
cnf(u26,axiom,
( member(g(X0,X1,X1),X1)
| member(g(X0,X1,X1),X0)
| union(X0,X1,X1) )).
cnf(u70,axiom,
( member(g(X5,X6,X6),X5)
| union(X5,X6,X6) )).
cnf(u26_003,axiom,
( member(g(X0,X1,X1),X1)
| member(g(X0,X1,X1),X0)
| union(X0,X1,X1) )).
cnf(union_axiom1,axiom,
( member(g(X3,X4,X5),X5)
| member(g(X3,X4,X5),X4)
| member(g(X3,X4,X5),X3)
| union(X3,X4,X5) )).
cnf(union_axiom1_004,axiom,
( member(g(X3,X4,X5),X5)
| member(g(X3,X4,X5),X4)
| member(g(X3,X4,X5),X3)
| union(X3,X4,X5) )).
cnf(union_axiom1_005,axiom,
( member(g(X3,X4,X5),X5)
| member(g(X3,X4,X5),X4)
| member(g(X3,X4,X5),X3)
| union(X3,X4,X5) )).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) )).
cnf(u59,axiom,
( ~ member(g(X2,X3,X2),X2)
| union(X2,X3,X2) )).
cnf(u44,axiom,
( ~ member(g(X0,X1,X1),X1)
| union(X0,X1,X1) )).
cnf(union_axiom2,axiom,
( ~ member(g(X3,X4,X5),X5)
| union(X3,X4,X5)
| ~ member(g(X3,X4,X5),X3) )).
cnf(union_axiom3,axiom,
( ~ member(g(X3,X4,X5),X5)
| union(X3,X4,X5)
| ~ member(g(X3,X4,X5),X4) )).
cnf(subsets_axiom2,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET778-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : vampire --mode casc -t %d %s
% 0.01/1.07 % Computer : n177.star.cs.uiowa.edu
% 0.01/1.07 % Model : x86_64 x86_64
% 0.01/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.01/1.07 % Memory : 32286.75MB
% 0.01/1.07 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.01/1.07 % CPULimit : 300
% 0.01/1.07 % DateTime : Tue Jul 7 12:05:12 CDT 2015
% 0.01/1.07 % CPUTime :
% 0.01/1.07 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.01/1.07 % remaining time: 3000 next slice time: 14
% 0.01/1.08 dis+2_12_fsr=off:lcm=reverse:nwc=3:spl=off:sp=reverse_arity:updr=off_13 on theBenchmark
% 1.44/2.58 % (13214)Time limit reached!
% 1.44/2.58 % ------------------------------
% 1.44/2.58 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.44/2.58 % Termination reason: Time limit
% 1.44/2.58 % Termination phase: Saturation
% 1.44/2.58
% 1.44/2.58 % Active clauses: 370
% 1.44/2.58 % Passive clauses: 3169
% 1.44/2.58 % Generated clauses: 10814
% 1.44/2.58 % Final active clauses: 370
% 1.44/2.58 % Final passive clauses: 2006
% 1.44/2.58 % Input clauses: 12
% 1.44/2.58 % Initial clauses: 12
% 1.44/2.58 %
% 1.44/2.58 % Duplicate literals: 2791
% 1.44/2.58 %
% 1.44/2.58 % Simple tautologies: 127
% 1.44/2.58 % Forward subsumptions: 5524
% 1.44/2.58 %
% 1.44/2.58 % Binary resolution: 7544
% 1.44/2.58 % Factoring: 612
% 1.44/2.58 %
% 1.44/2.58 % Memory used [KB]: 5884
% 1.44/2.58 % Time elapsed: 1.500 s
% 1.44/2.58 % ------------------------------
% 1.44/2.58 ---- Runtime statistics ----
% 1.44/2.58 clauses created: 10814
% 1.44/2.58 clauses deleted: 7181
% 1.44/2.58 -----------------------------
% 1.44/2.58 % ------------------------------
% 1.44/2.58 % remaining time: 2984 next slice time: 18
% 1.44/2.58 dis+11_128_cond=fast:fsr=off:lcm=reverse:lwlo=on:nwc=1:sos=on:spl=off:sp=reverse_arity:updr=off_17 on theBenchmark
% 1.44/2.58 % Refutation not found, incomplete strategy
% 1.44/2.58 % ------------------------------
% 1.44/2.58 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.44/2.58 % Termination reason: Refutation not found, incomplete strategy
% 1.44/2.58
% 1.44/2.58 % Active clauses: 12
% 1.44/2.58 % Final active clauses: 12
% 1.44/2.58 % Input clauses: 12
% 1.44/2.58 % Initial clauses: 12
% 1.44/2.58 %
% 1.44/2.58 % Memory used [KB]: 511
% 1.44/2.58 % Time elapsed: 0.001 s
% 1.44/2.58 % ------------------------------
% 1.44/2.58 ---- Runtime statistics ----
% 1.44/2.58 clauses created: 12
% 1.44/2.58 -----------------------------
% 1.44/2.58 % ------------------------------
% 1.44/2.58 % remaining time: 2984 next slice time: 50
% 1.44/2.58 lrs+10_4_cond=fast:nwc=1:nicw=on:sas=minisat:stl=60:sfr=on:ssfp=10000:ssfq=1.2:smm=off_47 on theBenchmark
% 1.44/2.58 Satisfiable!
% 1.44/2.58 % SZS status Satisfiable for theBenchmark
% 1.44/2.58 % # SZS output start Saturation.
% 1.44/2.58 cnf(u45,axiom,
% 1.44/2.58 union(X0,X0,X0)).
% 1.44/2.58
% 1.44/2.58 cnf(member_of_set1_is_member_of_union,axiom,
% 1.44/2.58 ~union(X3,X4,X5) | member(X0,X5) | ~member(X0,X3)).
% 1.44/2.58
% 1.44/2.58 cnf(member_of_set2_is_member_of_union,axiom,
% 1.44/2.58 ~union(X3,X4,X5) | member(X0,X5) | ~member(X0,X4)).
% 1.44/2.58
% 1.44/2.58 cnf(member_of_union_is_member_of_one_set,axiom,
% 1.44/2.58 ~union(X3,X4,X5) | member(X0,X4) | member(X0,X3) | ~member(X0,X5)).
% 1.44/2.58
% 1.44/2.58 cnf(u17,axiom,
% 1.44/2.58 equal_sets(X0,X0)).
% 1.44/2.58
% 1.44/2.58 cnf(set_equal_sets_are_subsets1,axiom,
% 1.44/2.58 ~equal_sets(X1,X2) | subset(X1,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(set_equal_sets_are_subsets2,axiom,
% 1.44/2.58 ~equal_sets(X2,X1) | subset(X1,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(u14,axiom,
% 1.44/2.58 subset(X0,X0)).
% 1.44/2.58
% 1.44/2.58 cnf(membership_in_subsets,axiom,
% 1.44/2.58 ~subset(X1,X2) | ~member(X0,X1) | member(X0,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(subsets_are_set_equal_sets,axiom,
% 1.44/2.58 ~subset(X4,X3) | ~subset(X3,X4) | equal_sets(X4,X3)).
% 1.44/2.58
% 1.44/2.58 cnf(u28,axiom,
% 1.44/2.58 member(g(X4,X4,X5),X5) | member(g(X4,X4,X5),X4) | union(X4,X4,X5)).
% 1.44/2.58
% 1.44/2.58 cnf(u28,axiom,
% 1.44/2.58 member(g(X4,X4,X5),X5) | member(g(X4,X4,X5),X4) | union(X4,X4,X5)).
% 1.44/2.58
% 1.44/2.58 cnf(u27,axiom,
% 1.44/2.58 member(g(X2,X3,X2),X3) | member(g(X2,X3,X2),X2) | union(X2,X3,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(u27,axiom,
% 1.44/2.58 member(g(X2,X3,X2),X3) | member(g(X2,X3,X2),X2) | union(X2,X3,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(u81,axiom,
% 1.44/2.58 member(g(X8,X9,X8),X9) | union(X8,X9,X8)).
% 1.44/2.58
% 1.44/2.58 cnf(u26,axiom,
% 1.44/2.58 member(g(X0,X1,X1),X1) | member(g(X0,X1,X1),X0) | union(X0,X1,X1)).
% 1.44/2.58
% 1.44/2.58 cnf(u70,axiom,
% 1.44/2.58 member(g(X5,X6,X6),X5) | union(X5,X6,X6)).
% 1.44/2.58
% 1.44/2.58 cnf(u26,axiom,
% 1.44/2.58 member(g(X0,X1,X1),X1) | member(g(X0,X1,X1),X0) | union(X0,X1,X1)).
% 1.44/2.58
% 1.44/2.58 cnf(union_axiom1,axiom,
% 1.44/2.58 member(g(X3,X4,X5),X5) | member(g(X3,X4,X5),X4) | member(g(X3,X4,X5),X3) | union(X3,X4,X5)).
% 1.44/2.58
% 1.44/2.58 cnf(union_axiom1,axiom,
% 1.44/2.58 member(g(X3,X4,X5),X5) | member(g(X3,X4,X5),X4) | member(g(X3,X4,X5),X3) | union(X3,X4,X5)).
% 1.44/2.58
% 1.44/2.58 cnf(union_axiom1,axiom,
% 1.44/2.58 member(g(X3,X4,X5),X5) | member(g(X3,X4,X5),X4) | member(g(X3,X4,X5),X3) | union(X3,X4,X5)).
% 1.44/2.58
% 1.44/2.58 cnf(subsets_axiom1,axiom,
% 1.44/2.58 member(member_of_1_not_of_2(X1,X2),X1) | subset(X1,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(u59,axiom,
% 1.44/2.58 ~member(g(X2,X3,X2),X2) | union(X2,X3,X2)).
% 1.44/2.58
% 1.44/2.58 cnf(u44,axiom,
% 1.44/2.58 ~member(g(X0,X1,X1),X1) | union(X0,X1,X1)).
% 1.44/2.58
% 1.44/2.58 cnf(union_axiom2,axiom,
% 1.44/2.58 ~member(g(X3,X4,X5),X5) | union(X3,X4,X5) | ~member(g(X3,X4,X5),X3)).
% 1.44/2.58
% 1.44/2.58 cnf(union_axiom3,axiom,
% 1.44/2.58 ~member(g(X3,X4,X5),X5) | union(X3,X4,X5) | ~member(g(X3,X4,X5),X4)).
% 1.44/2.58
% 1.44/2.58 cnf(subsets_axiom2,axiom,
% 1.44/2.58 ~member(member_of_1_not_of_2(X1,X2),X2) | subset(X1,X2)).
% 1.44/2.58
% 1.44/2.58 % # SZS output end Saturation.
% 1.44/2.58 % ------------------------------
% 1.44/2.58 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 1.44/2.58 % Termination reason: Satisfiable
% 1.44/2.58
% 1.44/2.58 % Active clauses: 22
% 1.44/2.58 % Passive clauses: 22
% 1.44/2.58 % Generated clauses: 120
% 1.44/2.58 % Final active clauses: 22
% 1.44/2.58 % Input clauses: 12
% 1.44/2.58 % Initial clauses: 12
% 1.44/2.58 %
% 1.44/2.58 % Duplicate literals: 48
% 1.44/2.58 % Fw subsumption resolutions: 4
% 1.44/2.58 %
% 1.44/2.58 % Simple tautologies: 20
% 1.44/2.58 % Forward subsumptions: 28
% 1.44/2.58 %
% 1.44/2.58 % Binary resolution: 52
% 1.44/2.58 % Factoring: 6
% 1.44/2.58 %
% 1.44/2.58 % SAT solver clauses: 1
% 1.44/2.58 %
% 1.44/2.58 % Memory used [KB]: 639
% 1.44/2.58 % Time elapsed: 0.002 s
% 1.44/2.58 % ------------------------------
% 1.44/2.58 ---- Runtime statistics ----
% 1.44/2.58 clauses created: 120
% 1.44/2.58 clauses deleted: 89
% 1.44/2.58 -----------------------------
% 1.44/2.58 % ------------------------------
% 1.44/2.58 % Success in time 1.513 s
%------------------------------------------------------------------------------