TMTP Model File: SET778-1.008-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : SET778-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n124.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:31:16 EDT 2015
% Result : Satisfiable 0.02s
% Output : Saturation 0.02s
% Verified :
% Statistics : Number of clauses : 26 ( 26 expanded)
% Number of leaves : 26 ( 26 expanded)
% Depth : 0
% Number of atoms : 69 ( 69 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 4 ( 3 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(u49,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(u39,axiom,
( member(g(X0,X0,X0),X0)
| union(X0,X0,X0) )).
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(u64,axiom,
( member(g(X2,X3,X2),X3)
| union(X2,X3,X2) )).
cnf(u26,axiom,
( member(g(X0,X1,X1),X1)
| member(g(X0,X1,X1),X0)
| union(X0,X1,X1) )).
cnf(u44,axiom,
( member(g(X0,X1,X1),X0)
| union(X0,X1,X1) )).
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(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.04 % Command : vampire --mode casc_sat -t %d %s
% 0.02/1.07 % Computer : n124.star.cs.uiowa.edu
% 0.02/1.07 % Model : x86_64 x86_64
% 0.02/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.07 % Memory : 32286.75MB
% 0.02/1.07 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.02/1.07 % CPULimit : 300
% 0.02/1.07 % DateTime : Tue Jul 7 12:05:12 CDT 2015
% 0.02/1.07 % CPUTime :
% 0.02/1.07 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.02/1.07 % remaining time: 3000 next slice time: 3
% 0.02/1.08 dis+10_3_cond=fast:fsr=off:gs=on:gsaa=full_model:gsssp=full:nwc=1:sac=on:sdd=large:sser=off:sfr=on:ssfp=10000:ssfq=1.2:ssnc=none:sp=occurrence_1 on theBenchmark
% 0.02/1.08 Satisfiable!
% 0.02/1.08 % SZS status Satisfiable for theBenchmark
% 0.02/1.08 % # SZS output start Saturation.
% 0.02/1.08 cnf(u49,axiom,
% 0.02/1.08 union(X0,X0,X0)).
% 0.02/1.08
% 0.02/1.08 cnf(member_of_set1_is_member_of_union,axiom,
% 0.02/1.08 ~union(X3,X4,X5) | member(X0,X5) | ~member(X0,X3)).
% 0.02/1.08
% 0.02/1.08 cnf(member_of_set2_is_member_of_union,axiom,
% 0.02/1.08 ~union(X3,X4,X5) | member(X0,X5) | ~member(X0,X4)).
% 0.02/1.08
% 0.02/1.08 cnf(member_of_union_is_member_of_one_set,axiom,
% 0.02/1.08 ~union(X3,X4,X5) | member(X0,X4) | member(X0,X3) | ~member(X0,X5)).
% 0.02/1.08
% 0.02/1.08 cnf(u17,axiom,
% 0.02/1.08 equal_sets(X0,X0)).
% 0.02/1.08
% 0.02/1.08 cnf(set_equal_sets_are_subsets1,axiom,
% 0.02/1.08 ~equal_sets(X1,X2) | subset(X1,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(set_equal_sets_are_subsets2,axiom,
% 0.02/1.08 ~equal_sets(X2,X1) | subset(X1,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(u14,axiom,
% 0.02/1.08 subset(X0,X0)).
% 0.02/1.08
% 0.02/1.08 cnf(membership_in_subsets,axiom,
% 0.02/1.08 ~subset(X1,X2) | ~member(X0,X1) | member(X0,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(subsets_are_set_equal_sets,axiom,
% 0.02/1.08 ~subset(X4,X3) | ~subset(X3,X4) | equal_sets(X4,X3)).
% 0.02/1.08
% 0.02/1.08 cnf(u28,axiom,
% 0.02/1.08 member(g(X4,X4,X5),X5) | member(g(X4,X4,X5),X4) | union(X4,X4,X5)).
% 0.02/1.08
% 0.02/1.08 cnf(u28,axiom,
% 0.02/1.08 member(g(X4,X4,X5),X5) | member(g(X4,X4,X5),X4) | union(X4,X4,X5)).
% 0.02/1.08
% 0.02/1.08 cnf(u39,axiom,
% 0.02/1.08 member(g(X0,X0,X0),X0) | union(X0,X0,X0)).
% 0.02/1.08
% 0.02/1.08 cnf(u27,axiom,
% 0.02/1.08 member(g(X2,X3,X2),X3) | member(g(X2,X3,X2),X2) | union(X2,X3,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(u27,axiom,
% 0.02/1.08 member(g(X2,X3,X2),X3) | member(g(X2,X3,X2),X2) | union(X2,X3,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(u64,axiom,
% 0.02/1.08 member(g(X2,X3,X2),X3) | union(X2,X3,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(u26,axiom,
% 0.02/1.08 member(g(X0,X1,X1),X1) | member(g(X0,X1,X1),X0) | union(X0,X1,X1)).
% 0.02/1.08
% 0.02/1.08 cnf(u44,axiom,
% 0.02/1.08 member(g(X0,X1,X1),X0) | union(X0,X1,X1)).
% 0.02/1.08
% 0.02/1.08 cnf(u26,axiom,
% 0.02/1.09 member(g(X0,X1,X1),X1) | member(g(X0,X1,X1),X0) | union(X0,X1,X1)).
% 0.02/1.09
% 0.02/1.09 cnf(union_axiom1,axiom,
% 0.02/1.09 member(g(X3,X4,X5),X5) | member(g(X3,X4,X5),X4) | member(g(X3,X4,X5),X3) | union(X3,X4,X5)).
% 0.02/1.09
% 0.02/1.09 cnf(union_axiom1,axiom,
% 0.02/1.09 member(g(X3,X4,X5),X5) | member(g(X3,X4,X5),X4) | member(g(X3,X4,X5),X3) | union(X3,X4,X5)).
% 0.02/1.09
% 0.02/1.09 cnf(union_axiom1,axiom,
% 0.02/1.09 member(g(X3,X4,X5),X5) | member(g(X3,X4,X5),X4) | member(g(X3,X4,X5),X3) | union(X3,X4,X5)).
% 0.02/1.09
% 0.02/1.09 cnf(subsets_axiom1,axiom,
% 0.02/1.09 member(member_of_1_not_of_2(X1,X2),X1) | subset(X1,X2)).
% 0.02/1.09
% 0.02/1.09 cnf(union_axiom2,axiom,
% 0.02/1.09 ~member(g(X3,X4,X5),X5) | union(X3,X4,X5) | ~member(g(X3,X4,X5),X3)).
% 0.02/1.09
% 0.02/1.09 cnf(union_axiom3,axiom,
% 0.02/1.09 ~member(g(X3,X4,X5),X5) | union(X3,X4,X5) | ~member(g(X3,X4,X5),X4)).
% 0.02/1.09
% 0.02/1.09 cnf(subsets_axiom2,axiom,
% 0.02/1.09 ~member(member_of_1_not_of_2(X1,X2),X2) | subset(X1,X2)).
% 0.02/1.09
% 0.02/1.09 % # SZS output end Saturation.
% 0.02/1.09 % ------------------------------
% 0.02/1.09 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.02/1.09 % Termination reason: Satisfiable
% 0.02/1.09
% 0.02/1.09 % Active clauses: 21
% 0.02/1.09 % Passive clauses: 22
% 0.02/1.09 % Generated clauses: 81
% 0.02/1.09 % Final active clauses: 21
% 0.02/1.09 % Input clauses: 12
% 0.02/1.09 % Initial clauses: 12
% 0.02/1.09 %
% 0.02/1.09 % Duplicate literals: 26
% 0.02/1.09 % Global subsumptions: 5
% 0.02/1.09 %
% 0.02/1.09 % Simple tautologies: 20
% 0.02/1.09 % Forward subsumptions: 9
% 0.02/1.09 %
% 0.02/1.09 % Binary resolution: 32
% 0.02/1.09 % Factoring: 6
% 0.02/1.09 %
% 0.02/1.09 % SAT solver clauses: 71
% 0.02/1.09 % SAT solver unit clauses: 21
% 0.02/1.09 % SAT solver binary clauses: 21
% 0.02/1.09 % SAT solver learnt clauses: 15
% 0.02/1.09 % SAT solver learnt literals: 14
% 0.02/1.09 %
% 0.02/1.09 % TWLsolver clauses: 48
% 0.02/1.09 % TWLsolver calls for satisfiability: 465
% 0.02/1.09 %
% 0.02/1.09 % Memory used [KB]: 511
% 0.02/1.09 % Time elapsed: 0.003 s
% 0.02/1.09 % ------------------------------
% 0.02/1.09 ---- Runtime statistics ----
% 0.02/1.09 clauses created: 81
% 0.02/1.09 clauses deleted: 49
% 0.02/1.09 -----------------------------
% 0.02/1.09 % ------------------------------
% 0.02/1.09 % Success in time 0.012 s
%------------------------------------------------------------------------------