TSTP Solution File: SWV453+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV453+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 21:43:09 EDT 2022
% Result : Theorem 25.10s 25.30s
% Output : Refutation 25.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 20 unt; 1 nHn; 29 RR)
% Number of literals : 54 ( 0 equ; 34 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
setIn(skc8,alive),
file('SWV453+1.p',unknown),
[] ).
cnf(4,axiom,
elem(m_Down(skc15),skc11),
file('SWV453+1.p',unknown),
[] ).
cnf(21,axiom,
equal(host(skc15),host(skc12)),
file('SWV453+1.p',unknown),
[] ).
cnf(22,axiom,
equal(host(skc14),host(skc13)),
file('SWV453+1.p',unknown),
[] ).
cnf(23,axiom,
equal(host(skc13),host(skc8)),
file('SWV453+1.p',unknown),
[] ).
cnf(24,axiom,
equal(host(skc10),host(skc8)),
file('SWV453+1.p',unknown),
[] ).
cnf(30,axiom,
elem(m_Down(skc14),queue(host(skc12))),
file('SWV453+1.p',unknown),
[] ).
cnf(31,axiom,
( equal(skc10,skc12)
| setIn(skc12,alive) ),
file('SWV453+1.p',unknown),
[] ).
cnf(34,axiom,
~ equal(host(skc12),host(skc8)),
file('SWV453+1.p',unknown),
[] ).
cnf(68,axiom,
equal(cons(m_Down(skc9),skc11),queue(host(skc8))),
file('SWV453+1.p',unknown),
[] ).
cnf(84,axiom,
( ~ elem(u,v)
| elem(u,cons(w,v)) ),
file('SWV453+1.p',unknown),
[] ).
cnf(125,axiom,
( ~ setIn(u,alive)
| ~ setIn(v,alive)
| ~ equal(host(w),host(u))
| ~ equal(host(x),host(v))
| ~ elem(m_Down(x),queue(host(u)))
| ~ elem(m_Down(w),queue(host(v)))
| equal(host(u),host(v)) ),
file('SWV453+1.p',unknown),
[] ).
cnf(126,plain,
equal(host(skc14),host(skc8)),
inference(rew,[status(thm),theory(equality)],[23,22]),
[iquote('0:Rew:23.0,22.0')] ).
cnf(138,plain,
elem(m_Down(skc15),cons(u,skc11)),
inference(res,[status(thm),theory(equality)],[4,84]),
[iquote('0:Res:4.0,84.0')] ).
cnf(301,plain,
( ~ setIn(skc12,alive)
| ~ equal(host(u),host(skc12))
| ~ elem(m_Down(v),queue(host(skc12)))
| ~ elem(m_Down(u),queue(host(skc8)))
| ~ equal(host(v),host(skc8))
| ~ setIn(skc8,alive) ),
inference(res,[status(thm),theory(equality)],[125,34]),
[iquote('0:Res:125.6,34.0')] ).
cnf(458,plain,
( ~ setIn(skc12,alive)
| ~ equal(host(u),host(skc8))
| ~ equal(host(v),host(skc12))
| ~ elem(m_Down(v),queue(host(skc8)))
| ~ elem(m_Down(u),queue(host(skc12))) ),
inference(mrr,[status(thm)],[301,2]),
[iquote('0:MRR:301.5,2.0')] ).
cnf(459,plain,
equal(skc10,skc12),
inference(spt,[spt(split,[position(s1)])],[31]),
[iquote('1:Spt:31.0')] ).
cnf(468,plain,
equal(host(skc12),host(skc8)),
inference(rew,[status(thm),theory(equality)],[459,24]),
[iquote('1:Rew:459.0,24.0')] ).
cnf(475,plain,
$false,
inference(mrr,[status(thm)],[468,34]),
[iquote('1:MRR:468.0,34.0')] ).
cnf(488,plain,
~ equal(skc10,skc12),
inference(spt,[spt(split,[position(sa)])],[475,459]),
[iquote('1:Spt:475.0,31.0,459.0')] ).
cnf(489,plain,
setIn(skc12,alive),
inference(spt,[spt(split,[position(s2)])],[31]),
[iquote('1:Spt:475.0,31.1')] ).
cnf(493,plain,
( ~ equal(host(u),host(skc8))
| ~ equal(host(v),host(skc12))
| ~ elem(m_Down(v),queue(host(skc8)))
| ~ elem(m_Down(u),queue(host(skc12))) ),
inference(mrr,[status(thm)],[458,489]),
[iquote('1:MRR:458.0,489.0')] ).
cnf(538,plain,
elem(m_Down(skc15),queue(host(skc8))),
inference(spr,[status(thm),theory(equality)],[68,138]),
[iquote('0:SpR:68.0,138.0')] ).
cnf(24060,plain,
( ~ equal(host(u),host(skc8))
| ~ equal(host(skc15),host(skc12))
| ~ elem(m_Down(u),queue(host(skc12))) ),
inference(res,[status(thm),theory(equality)],[538,493]),
[iquote('1:Res:538.0,493.2')] ).
cnf(24067,plain,
( ~ equal(host(u),host(skc8))
| ~ equal(host(skc12),host(skc12))
| ~ elem(m_Down(u),queue(host(skc12))) ),
inference(rew,[status(thm),theory(equality)],[21,24060]),
[iquote('1:Rew:21.0,24060.1')] ).
cnf(24068,plain,
( ~ equal(host(u),host(skc8))
| ~ elem(m_Down(u),queue(host(skc12))) ),
inference(obv,[status(thm),theory(equality)],[24067]),
[iquote('1:Obv:24067.1')] ).
cnf(26827,plain,
~ equal(host(skc14),host(skc8)),
inference(res,[status(thm),theory(equality)],[30,24068]),
[iquote('1:Res:30.0,24068.1')] ).
cnf(26831,plain,
~ equal(host(skc8),host(skc8)),
inference(rew,[status(thm),theory(equality)],[126,26827]),
[iquote('1:Rew:126.0,26827.0')] ).
cnf(26832,plain,
$false,
inference(obv,[status(thm),theory(equality)],[26831]),
[iquote('1:Obv:26831.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV453+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 05:50:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 25.10/25.30
% 25.10/25.30 SPASS V 3.9
% 25.10/25.30 SPASS beiseite: Proof found.
% 25.10/25.30 % SZS status Theorem
% 25.10/25.30 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.10/25.30 SPASS derived 24672 clauses, backtracked 163 clauses, performed 17 splits and kept 11169 clauses.
% 25.10/25.30 SPASS allocated 114385 KBytes.
% 25.10/25.30 SPASS spent 0:0:24.80 on the problem.
% 25.10/25.30 0:00:00.04 for the input.
% 25.10/25.30 0:00:00.05 for the FLOTTER CNF translation.
% 25.10/25.30 0:00:00.29 for inferences.
% 25.10/25.30 0:00:00.55 for the backtracking.
% 25.10/25.30 0:0:23.73 for the reduction.
% 25.10/25.30
% 25.10/25.30
% 25.10/25.30 Here is a proof with depth 4, length 29 :
% 25.10/25.30 % SZS output start Refutation
% See solution above
% 25.10/25.30 Formulae used in the proof : conj axiom_46
% 25.10/25.30
%------------------------------------------------------------------------------