TMTP Model File: SET777-1.008-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---SAT-4.0
% Problem : SET777-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -t %d %s
% Computer : n185.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 : 8 ( 8 expanded)
% Number of leaves : 8 ( 8 expanded)
% Depth : 0
% Number of atoms : 16 ( 16 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 3 ( 2 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(u11,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(u8,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(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) )).
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 : SET777-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 : n185.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(u11,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(u8,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(subsets_axiom1,axiom,
% 0.02/1.08 member(member_of_1_not_of_2(X1,X2),X1) | subset(X1,X2)).
% 0.02/1.08
% 0.02/1.08 cnf(subsets_axiom2,axiom,
% 0.02/1.08 ~member(member_of_1_not_of_2(X1,X2),X2) | subset(X1,X2)).
% 0.02/1.08
% 0.02/1.08 % # SZS output end Saturation.
% 0.02/1.08 % ------------------------------
% 0.02/1.08 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.02/1.08 % Termination reason: Satisfiable
% 0.02/1.08
% 0.02/1.08 % Active clauses: 8
% 0.02/1.08 % Passive clauses: 8
% 0.02/1.08 % Generated clauses: 13
% 0.02/1.08 % Final active clauses: 8
% 0.02/1.08 % Input clauses: 6
% 0.02/1.08 % Initial clauses: 6
% 0.02/1.08 %
% 0.02/1.08 % Duplicate literals: 1
% 0.02/1.08 % Global subsumptions: 1
% 0.02/1.08 %
% 0.02/1.08 % Simple tautologies: 1
% 0.02/1.08 % Forward subsumptions: 2
% 0.02/1.08 %
% 0.02/1.08 % Binary resolution: 5
% 0.02/1.08 %
% 0.02/1.08 % SAT solver clauses: 21
% 0.02/1.08 % SAT solver unit clauses: 6
% 0.02/1.08 % SAT solver binary clauses: 9
% 0.02/1.08 % SAT solver learnt clauses: 2
% 0.02/1.08 %
% 0.02/1.08 % TWLsolver clauses: 17
% 0.02/1.08 % TWLsolver calls for satisfiability: 100
% 0.02/1.08 %
% 0.02/1.08 % Memory used [KB]: 511
% 0.02/1.08 % Time elapsed: 0.001 s
% 0.02/1.08 % ------------------------------
% 0.02/1.08 ---- Runtime statistics ----
% 0.02/1.08 clauses created: 13
% 0.02/1.08 clauses deleted: 3
% 0.02/1.08 -----------------------------
% 0.02/1.08 % ------------------------------
% 0.02/1.09 % Success in time 0.01 s
%------------------------------------------------------------------------------