TMTP Model File: HWV034-2.006-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : SPASS---3.7
% Problem : HWV034-2 : TPTP v6.0.0. Bugfixed v2.7.0.
% Transform : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n040.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-431.1.2.el6.x86_64
% CPULimit : 300s
% DateTime : Fri Apr 4 04:22:41 EDT 2014
% Result : Satisfiable 1.09s
% Output : Saturation 1.09s
% Verified :
% Statistics : Number of clauses : 27 ( 27 expanded)
% Number of leaves : 27 ( 27 expanded)
% Depth : 0
% Number of atoms : 81 ( 81 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 4 ( 3 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
cnf(8,axiom,
( ~ and_ok(U)
| ~ one(in2(U))
| ~ one(in1(U))
| one(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(16,axiom,
( ~ or_ok(U)
| ~ zero(in2(U))
| ~ zero(in1(U))
| zero(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(9,axiom,
( ~ and_ok(U)
| ~ zero(out1(U))
| zero(in2(U))
| zero(in1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(17,axiom,
( ~ or_ok(U)
| ~ one(out1(U))
| one(in2(U))
| one(in1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(6,axiom,
( ~ and_ok(U)
| ~ zero(in1(U))
| zero(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(7,axiom,
( ~ and_ok(U)
| ~ zero(in2(U))
| zero(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(10,axiom,
( ~ and_ok(U)
| ~ one(out1(U))
| one(in1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(11,axiom,
( ~ and_ok(U)
| ~ one(out1(U))
| one(in2(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(14,axiom,
( ~ or_ok(U)
| ~ one(in1(U))
| one(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(15,axiom,
( ~ or_ok(U)
| ~ one(in2(U))
| one(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(18,axiom,
( ~ or_ok(U)
| ~ zero(out1(U))
| zero(in1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(19,axiom,
( ~ or_ok(U)
| ~ zero(out1(U))
| zero(in2(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(22,axiom,
( ~ not_ok(U)
| ~ zero(in1(U))
| one(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(23,axiom,
( ~ not_ok(U)
| ~ one(in1(U))
| zero(out1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(24,axiom,
( ~ not_ok(U)
| ~ zero(out1(U))
| one(in1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(25,axiom,
( ~ not_ok(U)
| ~ one(out1(U))
| zero(in1(U)) ),
file('HWV034-2.p',unknown),
[]).
cnf(1,axiom,
( ~ zero(U)
| ~ connection(U,V)
| zero(V) ),
file('HWV034-2.p',unknown),
[]).
cnf(2,axiom,
( ~ one(U)
| ~ connection(U,V)
| one(V) ),
file('HWV034-2.p',unknown),
[]).
cnf(3,axiom,
( ~ zero(U)
| ~ connection(V,U)
| zero(V) ),
file('HWV034-2.p',unknown),
[]).
cnf(4,axiom,
( ~ one(U)
| ~ connection(V,U)
| one(V) ),
file('HWV034-2.p',unknown),
[]).
cnf(13,axiom,
( ~ logic_and(U)
| abnormal(U)
| and_ok(U) ),
file('HWV034-2.p',unknown),
[]).
cnf(21,axiom,
( ~ logic_or(U)
| abnormal(U)
| or_ok(U) ),
file('HWV034-2.p',unknown),
[]).
cnf(27,axiom,
( ~ logic_not(U)
| abnormal(U)
| not_ok(U) ),
file('HWV034-2.p',unknown),
[]).
cnf(5,axiom,
( ~ one(U)
| ~ zero(U) ),
file('HWV034-2.p',unknown),
[]).
cnf(12,axiom,
( ~ abnormal(U)
| ~ and_ok(U) ),
file('HWV034-2.p',unknown),
[]).
cnf(20,axiom,
( ~ abnormal(U)
| ~ or_ok(U) ),
file('HWV034-2.p',unknown),
[]).
cnf(26,axiom,
( ~ abnormal(U)
| ~ not_ok(U) ),
file('HWV034-2.p',unknown),
[]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : HWV034-2 : TPTP v6.0.0. Bugfixed v2.7.0.
% % Command : run_spass %d %s
% % Computer : n040.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-431.1.2.el6.x86_64
% % CPULimit : 300
% % DateTime : Wed Apr 2 14:55:20 CDT 2014
% % CPUTime : 1.09
%
% SPASS V 3.7
% SPASS beiseite: Completion found.
% % SZS status CounterSatisfiable
% Problem: /export/starexec/sandbox/benchmark/HWV034-2.p
% SPASS derived 28 clauses, backtracked 0 clauses, performed 0 splits and kept 27 clauses.
% SPASS allocated 23775 KBytes.
% SPASS spent 0:00:00.02 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
% 8[0:Inp] and_ok(U) || one(in2(U)) one(in1(U))* -> one(out1(U)).
% 16[0:Inp] or_ok(U) || zero(in2(U)) zero(in1(U))* -> zero(out1(U)).
% 9[0:Inp] and_ok(U) || zero(out1(U)) -> zero(in2(U)) zero(in1(U))*.
% 17[0:Inp] or_ok(U) || one(out1(U)) -> one(in2(U)) one(in1(U))*.
% 6[0:Inp] and_ok(U) || zero(in1(U))* -> zero(out1(U)).
% 7[0:Inp] and_ok(U) || zero(in2(U)) -> zero(out1(U))*.
% 10[0:Inp] and_ok(U) || one(out1(U)) -> one(in1(U))*.
% 11[0:Inp] and_ok(U) || one(out1(U))* -> one(in2(U)).
% 14[0:Inp] or_ok(U) || one(in1(U))* -> one(out1(U)).
% 15[0:Inp] or_ok(U) || one(in2(U)) -> one(out1(U))*.
% 18[0:Inp] or_ok(U) || zero(out1(U)) -> zero(in1(U))*.
% 19[0:Inp] or_ok(U) || zero(out1(U))* -> zero(in2(U)).
% 22[0:Inp] not_ok(U) || zero(in1(U)) -> one(out1(U))*.
% 23[0:Inp] not_ok(U) || one(in1(U))* -> zero(out1(U)).
% 24[0:Inp] not_ok(U) || zero(out1(U)) -> one(in1(U))*.
% 25[0:Inp] not_ok(U) || one(out1(U))* -> zero(in1(U)).
% 1[0:Inp] zero(U) || connection(U,V)* -> zero(V).
% 2[0:Inp] one(U) || connection(U,V)* -> one(V).
% 3[0:Inp] zero(U) || connection(V,U)* -> zero(V).
% 4[0:Inp] one(U) || connection(V,U)* -> one(V).
% 13[0:Inp] logic_and(U) || -> abnormal(U) and_ok(U)*.
% 21[0:Inp] logic_or(U) || -> abnormal(U)* or_ok(U).
% 27[0:Inp] logic_not(U) || -> abnormal(U)* not_ok(U).
% 5[0:Inp] one(U) zero(U) || -> .
% 12[0:Inp] abnormal(U) and_ok(U) || -> .
% 20[0:Inp] abnormal(U) or_ok(U) || -> .
% 26[0:Inp] abnormal(U) not_ok(U) || -> .
% % SZS output end Saturation
%
% EOF
%------------------------------------------------------------------------------