TSTP Solution File: SWV456+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV456+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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 21.21s 21.39s
% Output : Refutation 21.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 22 unt; 1 nHn; 30 RR)
% Number of literals : 53 ( 0 equ; 32 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 : 19 ( 19 usr; 14 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
setIn(skc8,alive),
file('SWV456+1.p',unknown),
[] ).
cnf(4,axiom,
elem(m_Down(skc14),skc11),
file('SWV456+1.p',unknown),
[] ).
cnf(21,axiom,
equal(host(skc15),host(skc12)),
file('SWV456+1.p',unknown),
[] ).
cnf(22,axiom,
equal(host(skc14),host(skc13)),
file('SWV456+1.p',unknown),
[] ).
cnf(23,axiom,
equal(host(skc12),host(skc8)),
file('SWV456+1.p',unknown),
[] ).
cnf(24,axiom,
equal(host(skc10),host(skc8)),
file('SWV456+1.p',unknown),
[] ).
cnf(31,axiom,
( equal(skc10,skc13)
| setIn(skc13,alive) ),
file('SWV456+1.p',unknown),
[] ).
cnf(34,axiom,
~ equal(host(skc10),host(skc13)),
file('SWV456+1.p',unknown),
[] ).
cnf(56,axiom,
setIn(host(skc15),index(down,host(skc13))),
file('SWV456+1.p',unknown),
[] ).
cnf(69,axiom,
equal(cons(m_Down(skc9),skc11),queue(host(skc8))),
file('SWV456+1.p',unknown),
[] ).
cnf(85,axiom,
( ~ elem(u,v)
| elem(u,cons(w,v)) ),
file('SWV456+1.p',unknown),
[] ).
cnf(127,axiom,
( ~ setIn(u,alive)
| ~ setIn(v,alive)
| ~ equal(host(w),host(u))
| ~ equal(host(x),host(v))
| ~ elem(m_Down(w),queue(host(v)))
| ~ setIn(host(x),index(down,host(u)))
| equal(host(u),host(v)) ),
file('SWV456+1.p',unknown),
[] ).
cnf(128,plain,
equal(host(skc15),host(skc8)),
inference(rew,[status(thm),theory(equality)],[23,21]),
[iquote('0:Rew:23.0,21.0')] ).
cnf(130,plain,
~ equal(host(skc13),host(skc8)),
inference(rew,[status(thm),theory(equality)],[24,34]),
[iquote('0:Rew:24.0,34.0')] ).
cnf(133,plain,
setIn(host(skc8),index(down,host(skc13))),
inference(rew,[status(thm),theory(equality)],[128,56]),
[iquote('0:Rew:128.0,56.0')] ).
cnf(144,plain,
elem(m_Down(skc14),cons(u,skc11)),
inference(res,[status(thm),theory(equality)],[4,85]),
[iquote('0:Res:4.0,85.0')] ).
cnf(311,plain,
( ~ setIn(skc8,alive)
| ~ equal(host(u),host(skc8))
| ~ elem(m_Down(v),queue(host(skc8)))
| ~ setIn(host(u),index(down,host(skc13)))
| ~ equal(host(v),host(skc13))
| ~ setIn(skc13,alive) ),
inference(res,[status(thm),theory(equality)],[127,130]),
[iquote('0:Res:127.6,130.0')] ).
cnf(420,plain,
( ~ setIn(skc13,alive)
| ~ equal(host(u),host(skc13))
| ~ equal(host(v),host(skc8))
| ~ elem(m_Down(u),queue(host(skc8)))
| ~ setIn(host(v),index(down,host(skc13))) ),
inference(mrr,[status(thm)],[311,2]),
[iquote('0:MRR:311.0,2.0')] ).
cnf(421,plain,
equal(skc10,skc13),
inference(spt,[spt(split,[position(s1)])],[31]),
[iquote('1:Spt:31.0')] ).
cnf(431,plain,
equal(host(skc13),host(skc8)),
inference(rew,[status(thm),theory(equality)],[421,24]),
[iquote('1:Rew:421.0,24.0')] ).
cnf(438,plain,
$false,
inference(mrr,[status(thm)],[431,130]),
[iquote('1:MRR:431.0,130.0')] ).
cnf(457,plain,
~ equal(skc10,skc13),
inference(spt,[spt(split,[position(sa)])],[438,421]),
[iquote('1:Spt:438.0,31.0,421.0')] ).
cnf(458,plain,
setIn(skc13,alive),
inference(spt,[spt(split,[position(s2)])],[31]),
[iquote('1:Spt:438.0,31.1')] ).
cnf(463,plain,
( ~ equal(host(u),host(skc13))
| ~ equal(host(v),host(skc8))
| ~ elem(m_Down(u),queue(host(skc8)))
| ~ setIn(host(v),index(down,host(skc13))) ),
inference(mrr,[status(thm)],[420,458]),
[iquote('1:MRR:420.0,458.0')] ).
cnf(512,plain,
elem(m_Down(skc14),queue(host(skc8))),
inference(spr,[status(thm),theory(equality)],[69,144]),
[iquote('0:SpR:69.0,144.0')] ).
cnf(25080,plain,
( ~ equal(host(u),host(skc13))
| ~ equal(host(skc8),host(skc8))
| ~ elem(m_Down(u),queue(host(skc8))) ),
inference(res,[status(thm),theory(equality)],[133,463]),
[iquote('1:Res:133.0,463.3')] ).
cnf(25081,plain,
( ~ equal(host(u),host(skc13))
| ~ elem(m_Down(u),queue(host(skc8))) ),
inference(obv,[status(thm),theory(equality)],[25080]),
[iquote('1:Obv:25080.1')] ).
cnf(25085,plain,
~ equal(host(skc14),host(skc13)),
inference(res,[status(thm),theory(equality)],[512,25081]),
[iquote('1:Res:512.0,25081.1')] ).
cnf(25092,plain,
~ equal(host(skc13),host(skc13)),
inference(rew,[status(thm),theory(equality)],[22,25085]),
[iquote('1:Rew:22.0,25085.0')] ).
cnf(25093,plain,
$false,
inference(obv,[status(thm),theory(equality)],[25092]),
[iquote('1:Obv:25092.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV456+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 01:00:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 21.21/21.39
% 21.21/21.39 SPASS V 3.9
% 21.21/21.39 SPASS beiseite: Proof found.
% 21.21/21.39 % SZS status Theorem
% 21.21/21.39 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.21/21.39 SPASS derived 22981 clauses, backtracked 167 clauses, performed 17 splits and kept 10225 clauses.
% 21.21/21.39 SPASS allocated 113640 KBytes.
% 21.21/21.39 SPASS spent 0:0:20.90 on the problem.
% 21.21/21.39 0:00:00.04 for the input.
% 21.21/21.39 0:00:00.05 for the FLOTTER CNF translation.
% 21.21/21.39 0:00:00.26 for inferences.
% 21.21/21.39 0:00:00.50 for the backtracking.
% 21.21/21.39 0:0:19.92 for the reduction.
% 21.21/21.39
% 21.21/21.39
% 21.21/21.39 Here is a proof with depth 3, length 30 :
% 21.21/21.39 % SZS output start Refutation
% See solution above
% 21.21/21.39 Formulae used in the proof : conj axiom_46
% 21.21/21.39
%------------------------------------------------------------------------------