TMTP Model File: SET779-1.008-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : SET779-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n128.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.03s
% Output : Saturation 0.03s
% Verified :
% Statistics : Number of clauses : 21 ( 21 expanded)
% Number of leaves : 21 ( 21 expanded)
% Depth : 0
% Number of atoms : 51 ( 51 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 4 ( 2 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(u42,axiom,
( intersection(X6,X6,X6) )).
cnf(member_of_intersection_is_member_of_set1,axiom,
( ~ intersection(X3,X4,X5)
| member(X0,X3)
| ~ member(X0,X5) )).
cnf(member_of_intersection_is_member_of_set2,axiom,
( ~ intersection(X3,X4,X5)
| member(X0,X4)
| ~ member(X0,X5) )).
cnf(member_of_both_is_member_of_intersection,axiom,
( ~ intersection(X3,X4,X5)
| ~ member(X0,X3)
| member(X0,X5)
| ~ member(X0,X4) )).
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(u21,axiom,
( member(h(X0,X1,X1),X1)
| intersection(X0,X1,X1) )).
cnf(u20,axiom,
( member(h(X0,X1,X0),X0)
| intersection(X0,X1,X0) )).
cnf(intersection_axiom2,axiom,
( member(h(X3,X4,X5),X5)
| member(h(X3,X4,X5),X4)
| intersection(X3,X4,X5) )).
cnf(intersection_axiom1,axiom,
( member(h(X3,X4,X5),X5)
| member(h(X3,X4,X5),X3)
| intersection(X3,X4,X5) )).
cnf(intersection_axiom1_001,axiom,
( member(h(X3,X4,X5),X5)
| member(h(X3,X4,X5),X3)
| intersection(X3,X4,X5) )).
cnf(intersection_axiom2_002,axiom,
( member(h(X3,X4,X5),X5)
| member(h(X3,X4,X5),X4)
| intersection(X3,X4,X5) )).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) )).
cnf(u35,axiom,
( ~ member(h(X12,X13,X13),X12)
| intersection(X12,X13,X13) )).
cnf(u34,axiom,
( ~ member(h(X10,X11,X10),X11)
| intersection(X10,X11,X10) )).
cnf(intersection_axiom3,axiom,
( ~ member(h(X3,X4,X5),X5)
| ~ member(h(X3,X4,X5),X3)
| ~ member(h(X3,X4,X5),X4)
| intersection(X3,X4,X5) )).
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 : SET779-1 : TPTP v6.2.0. Released v2.5.0.
% 0.01/0.04 % Command : vampire --mode casc_sat -t %d %s
% 0.03/1.08 % Computer : n128.star.cs.uiowa.edu
% 0.03/1.08 % Model : x86_64 x86_64
% 0.03/1.08 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/1.08 % Memory : 32286.75MB
% 0.03/1.08 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.03/1.08 % CPULimit : 300
% 0.03/1.08 % DateTime : Tue Jul 7 12:05:12 CDT 2015
% 0.03/1.09 % CPUTime :
% 0.03/1.09 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.03/1.09 % remaining time: 3000 next slice time: 3
% 0.03/1.10 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.03/1.10 Satisfiable!
% 0.03/1.10 % SZS status Satisfiable for theBenchmark
% 0.03/1.10 % # SZS output start Saturation.
% 0.03/1.10 cnf(u42,axiom,
% 0.03/1.10 intersection(X6,X6,X6)).
% 0.03/1.10
% 0.03/1.10 cnf(member_of_intersection_is_member_of_set1,axiom,
% 0.03/1.10 ~intersection(X3,X4,X5) | member(X0,X3) | ~member(X0,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(member_of_intersection_is_member_of_set2,axiom,
% 0.03/1.10 ~intersection(X3,X4,X5) | member(X0,X4) | ~member(X0,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(member_of_both_is_member_of_intersection,axiom,
% 0.03/1.10 ~intersection(X3,X4,X5) | ~member(X0,X3) | member(X0,X5) | ~member(X0,X4)).
% 0.03/1.10
% 0.03/1.10 cnf(u17,axiom,
% 0.03/1.10 equal_sets(X0,X0)).
% 0.03/1.10
% 0.03/1.10 cnf(set_equal_sets_are_subsets1,axiom,
% 0.03/1.10 ~equal_sets(X1,X2) | subset(X1,X2)).
% 0.03/1.10
% 0.03/1.10 cnf(set_equal_sets_are_subsets2,axiom,
% 0.03/1.10 ~equal_sets(X2,X1) | subset(X1,X2)).
% 0.03/1.10
% 0.03/1.10 cnf(u14,axiom,
% 0.03/1.10 subset(X0,X0)).
% 0.03/1.10
% 0.03/1.10 cnf(membership_in_subsets,axiom,
% 0.03/1.10 ~subset(X1,X2) | ~member(X0,X1) | member(X0,X2)).
% 0.03/1.10
% 0.03/1.10 cnf(subsets_are_set_equal_sets,axiom,
% 0.03/1.10 ~subset(X4,X3) | ~subset(X3,X4) | equal_sets(X4,X3)).
% 0.03/1.10
% 0.03/1.10 cnf(u21,axiom,
% 0.03/1.10 member(h(X0,X1,X1),X1) | intersection(X0,X1,X1)).
% 0.03/1.10
% 0.03/1.10 cnf(u20,axiom,
% 0.03/1.10 member(h(X0,X1,X0),X0) | intersection(X0,X1,X0)).
% 0.03/1.10
% 0.03/1.10 cnf(intersection_axiom2,axiom,
% 0.03/1.10 member(h(X3,X4,X5),X5) | member(h(X3,X4,X5),X4) | intersection(X3,X4,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(intersection_axiom1,axiom,
% 0.03/1.10 member(h(X3,X4,X5),X5) | member(h(X3,X4,X5),X3) | intersection(X3,X4,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(intersection_axiom1,axiom,
% 0.03/1.10 member(h(X3,X4,X5),X5) | member(h(X3,X4,X5),X3) | intersection(X3,X4,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(intersection_axiom2,axiom,
% 0.03/1.10 member(h(X3,X4,X5),X5) | member(h(X3,X4,X5),X4) | intersection(X3,X4,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(subsets_axiom1,axiom,
% 0.03/1.10 member(member_of_1_not_of_2(X1,X2),X1) | subset(X1,X2)).
% 0.03/1.10
% 0.03/1.10 cnf(u35,axiom,
% 0.03/1.10 ~member(h(X12,X13,X13),X12) | intersection(X12,X13,X13)).
% 0.03/1.10
% 0.03/1.10 cnf(u34,axiom,
% 0.03/1.10 ~member(h(X10,X11,X10),X11) | intersection(X10,X11,X10)).
% 0.03/1.10
% 0.03/1.10 cnf(intersection_axiom3,axiom,
% 0.03/1.10 ~member(h(X3,X4,X5),X5) | ~member(h(X3,X4,X5),X3) | ~member(h(X3,X4,X5),X4) | intersection(X3,X4,X5)).
% 0.03/1.10
% 0.03/1.10 cnf(subsets_axiom2,axiom,
% 0.03/1.10 ~member(member_of_1_not_of_2(X1,X2),X2) | subset(X1,X2)).
% 0.03/1.10
% 0.03/1.10 % # SZS output end Saturation.
% 0.03/1.10 % ------------------------------
% 0.03/1.10 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.03/1.10 % Termination reason: Satisfiable
% 0.03/1.10
% 0.03/1.10 % Active clauses: 19
% 0.03/1.10 % Passive clauses: 22
% 0.03/1.10 % Generated clauses: 63
% 0.03/1.10 % Final active clauses: 19
% 0.03/1.10 % Input clauses: 12
% 0.03/1.10 % Initial clauses: 12
% 0.03/1.10 %
% 0.03/1.10 % Duplicate literals: 20
% 0.03/1.10 % Global subsumptions: 3
% 0.03/1.10 %
% 0.03/1.10 % Simple tautologies: 8
% 0.03/1.10 % Forward subsumptions: 13
% 0.03/1.10 %
% 0.03/1.10 % Binary resolution: 26
% 0.03/1.10 % Factoring: 2
% 0.03/1.10 %
% 0.03/1.10 % SAT solver clauses: 58
% 0.03/1.10 % SAT solver unit clauses: 15
% 0.03/1.10 % SAT solver binary clauses: 23
% 0.03/1.10 % SAT solver learnt clauses: 10
% 0.03/1.10 % SAT solver learnt literals: 14
% 0.03/1.10 %
% 0.03/1.10 % TWLsolver clauses: 44
% 0.03/1.10 % TWLsolver calls for satisfiability: 375
% 0.03/1.10 %
% 0.03/1.10 % Memory used [KB]: 511
% 0.03/1.10 % Time elapsed: 0.002 s
% 0.03/1.10 % ------------------------------
% 0.03/1.10 ---- Runtime statistics ----
% 0.03/1.10 clauses created: 63
% 0.03/1.10 clauses deleted: 31
% 0.03/1.10 -----------------------------
% 0.03/1.10 % ------------------------------
% 0.03/1.10 % Success in time 0.011 s
%------------------------------------------------------------------------------