TMTP Model File: SET778-1.006-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : SPASS---3.7
% Problem : SET778-1 : TPTP v6.0.0. Released v2.5.0.
% Transform : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16127.75MB
% OS : Linux 2.6.32-431.1.2.el6.x86_64
% CPULimit : 300s
% DateTime : Fri Apr 4 05:54:39 EDT 2014
% Result : Satisfiable 1.10s
% Output : Saturation 1.10s
% Verified :
% Statistics : ERROR: Analysing output (Could not find formula named 31)
% Comments :
%------------------------------------------------------------------------------
cnf(20,plain,
( member(g(U,U,V),V)
| member(g(U,U,V),U)
| union(U,U,V) ),
inference(fac,[status(thm)],[10]),
[iquote('0:Fac:10.1,10.2')]).
cnf(32,plain,
( member(g(U,V,U),V)
| union(U,V,U) ),
inference(mrr,[status(thm)],[31,19]),
[iquote('0:MRR:31.0,19.1')]).
cnf(36,plain,
( union(U,U,U) ),
inference(mrr,[status(thm)],[35,27]),
[iquote('0:MRR:35.0,27.0')]).
cnf(27,plain,
( member(g(U,V,V),U)
| union(U,V,V) ),
inference(mrr,[status(thm)],[26,18]),
[iquote('0:MRR:26.0,18.0')]).
cnf(10,axiom,
( member(g(U,V,W),W)
| member(g(U,V,W),V)
| member(g(U,V,W),U)
| union(U,V,W) ),
file('SET778-1.p',unknown),
[]).
cnf(11,axiom,
( ~ member(g(U,V,W),W)
| ~ member(g(U,V,W),U)
| union(U,V,W) ),
file('SET778-1.p',unknown),
[]).
cnf(12,axiom,
( ~ member(g(U,V,W),W)
| ~ member(g(U,V,W),V)
| union(U,V,W) ),
file('SET778-1.p',unknown),
[]).
cnf(7,axiom,
( ~ member(U,V)
| ~ union(W,X,V)
| member(U,X)
| member(U,W) ),
file('SET778-1.p',unknown),
[]).
cnf(8,axiom,
( ~ member(U,V)
| ~ union(V,W,X)
| member(U,X) ),
file('SET778-1.p',unknown),
[]).
cnf(9,axiom,
( ~ member(U,V)
| ~ union(W,V,X)
| member(U,X) ),
file('SET778-1.p',unknown),
[]).
cnf(1,axiom,
( ~ subset(U,V)
| ~ member(W,U)
| member(W,V) ),
file('SET778-1.p',unknown),
[]).
cnf(14,plain,
( subset(U,U) ),
inference(obv,[status(thm),theory(equality)],[13]),
[iquote('0:Obv:13.0')]).
cnf(6,axiom,
( ~ subset(U,V)
| ~ subset(V,U)
| equal_sets(U,V) ),
file('SET778-1.p',unknown),
[]).
cnf(3,axiom,
( ~ member(member_of_1_not_of_2(U,V),V)
| subset(U,V) ),
file('SET778-1.p',unknown),
[]).
cnf(2,axiom,
( subset(U,V)
| member(member_of_1_not_of_2(U,V),U) ),
file('SET778-1.p',unknown),
[]).
cnf(4,axiom,
( ~ equal_sets(U,V)
| subset(U,V) ),
file('SET778-1.p',unknown),
[]).
cnf(5,axiom,
( ~ equal_sets(U,V)
| subset(V,U) ),
file('SET778-1.p',unknown),
[]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SET778-1 : TPTP v6.0.0. Released v2.5.0.
% % Command : run_spass %d %s
% % Computer : n020.star.cs.uiowa.edu
% % Model : x86_64 x86_64
% % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory : 16127.75MB
% % OS : Linux 2.6.32-431.1.2.el6.x86_64
% % CPULimit : 300
% % DateTime : Wed Apr 2 23:45:15 CDT 2014
% % CPUTime : 1.10
%
% SPASS V 3.7
% SPASS beiseite: Completion found.
% % SZS status CounterSatisfiable
% Problem: /export/starexec/sandbox/benchmark/SET778-1.p
% SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 20 clauses.
% SPASS allocated 20640 KBytes.
% SPASS spent 0:00:00.01 on the problem.
% 0:00:00.01 for the input.
% 0:00:00.00 for the FLOTTER CNF translation.
% 0:00:00.00 for inferences.
% 0:00:00.00 for the backtracking.
% 0:00:00.00 for the reduction.
%
%
% The saturated set of worked-off clauses is :
% % SZS output start Saturation
% 20[0:Fac:10.1,10.2] || -> member(g(U,U,V),V)* member(g(U,U,V),U)* union(U,U,V).
% 32[0:MRR:31.0,19.1] || -> member(g(U,V,U),V)* union(U,V,U).
% 36[0:MRR:35.0,27.0] || -> union(U,U,U)*.
% 27[0:MRR:26.0,18.0] || -> member(g(U,V,V),U)* union(U,V,V).
% 10[0:Inp] || -> member(g(U,V,W),W)* member(g(U,V,W),V)* member(g(U,V,W),U)* union(U,V,W).
% 11[0:Inp] || member(g(U,V,W),W)*+ member(g(U,V,W),U)* -> union(U,V,W).
% 12[0:Inp] || member(g(U,V,W),W)*+ member(g(U,V,W),V)* -> union(U,V,W).
% 7[0:Inp] || member(U,V)* union(W,X,V)*+ -> member(U,X)* member(U,W)*.
% 8[0:Inp] || member(U,V)* union(V,W,X)*+ -> member(U,X)*.
% 9[0:Inp] || member(U,V)* union(W,V,X)*+ -> member(U,X)*.
% 1[0:Inp] || subset(U,V)*+ member(W,U)* -> member(W,V)*.
% 14[0:Obv:13.0] || -> subset(U,U)*.
% 6[0:Inp] || subset(U,V) subset(V,U) -> equal_sets(U,V)*.
% 3[0:Inp] || member(member_of_1_not_of_2(U,V),V)* -> subset(U,V).
% 2[0:Inp] || -> subset(U,V) member(member_of_1_not_of_2(U,V),U)*.
% 4[0:Inp] || equal_sets(U,V)* -> subset(U,V).
% 5[0:Inp] || equal_sets(U,V)* -> subset(V,U).
% % SZS output end Saturation
%
% EOF
%------------------------------------------------------------------------------