TSTP Solution File: SWV454+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV454+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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 23.35s 23.53s
% Output : Refutation 23.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 15 unt; 0 nHn; 22 RR)
% Number of literals : 42 ( 0 equ; 28 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 : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
setIn(skc11,alive),
file('SWV454+1.p',unknown),
[] ).
cnf(4,axiom,
setIn(skc7,alive),
file('SWV454+1.p',unknown),
[] ).
cnf(6,axiom,
elem(m_Down(skc12),skc9),
file('SWV454+1.p',unknown),
[] ).
cnf(22,axiom,
equal(host(skc13),host(skc10)),
file('SWV454+1.p',unknown),
[] ).
cnf(23,axiom,
equal(host(skc12),host(skc11)),
file('SWV454+1.p',unknown),
[] ).
cnf(24,axiom,
equal(host(skc10),host(skc7)),
file('SWV454+1.p',unknown),
[] ).
cnf(32,axiom,
elem(m_Down(skc13),queue(host(skc11))),
file('SWV454+1.p',unknown),
[] ).
cnf(33,axiom,
~ equal(host(skc11),host(skc7)),
file('SWV454+1.p',unknown),
[] ).
cnf(67,axiom,
equal(cons(m_Down(skc8),skc9),queue(host(skc7))),
file('SWV454+1.p',unknown),
[] ).
cnf(81,axiom,
( ~ elem(u,v)
| elem(u,cons(w,v)) ),
file('SWV454+1.p',unknown),
[] ).
cnf(122,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('SWV454+1.p',unknown),
[] ).
cnf(123,plain,
equal(host(skc13),host(skc7)),
inference(rew,[status(thm),theory(equality)],[24,22]),
[iquote('0:Rew:24.0,22.0')] ).
cnf(147,plain,
elem(m_Down(skc12),cons(u,skc9)),
inference(res,[status(thm),theory(equality)],[6,81]),
[iquote('0:Res:6.0,81.0')] ).
cnf(270,plain,
( ~ setIn(skc11,alive)
| ~ equal(host(u),host(skc11))
| ~ elem(m_Down(v),queue(host(skc11)))
| ~ elem(m_Down(u),queue(host(skc7)))
| ~ equal(host(v),host(skc7))
| ~ setIn(skc7,alive) ),
inference(res,[status(thm),theory(equality)],[122,33]),
[iquote('0:Res:122.6,33.0')] ).
cnf(485,plain,
( ~ equal(host(u),host(skc7))
| ~ equal(host(v),host(skc11))
| ~ elem(m_Down(v),queue(host(skc7)))
| ~ elem(m_Down(u),queue(host(skc11))) ),
inference(mrr,[status(thm)],[270,3,4]),
[iquote('0:MRR:270.0,270.5,3.0,4.0')] ).
cnf(513,plain,
elem(m_Down(skc12),queue(host(skc7))),
inference(spr,[status(thm),theory(equality)],[67,147]),
[iquote('0:SpR:67.0,147.0')] ).
cnf(24022,plain,
( ~ equal(host(u),host(skc7))
| ~ equal(host(skc12),host(skc11))
| ~ elem(m_Down(u),queue(host(skc11))) ),
inference(res,[status(thm),theory(equality)],[513,485]),
[iquote('0:Res:513.0,485.2')] ).
cnf(24029,plain,
( ~ equal(host(u),host(skc7))
| ~ equal(host(skc11),host(skc11))
| ~ elem(m_Down(u),queue(host(skc11))) ),
inference(rew,[status(thm),theory(equality)],[23,24022]),
[iquote('0:Rew:23.0,24022.1')] ).
cnf(24030,plain,
( ~ equal(host(u),host(skc7))
| ~ elem(m_Down(u),queue(host(skc11))) ),
inference(obv,[status(thm),theory(equality)],[24029]),
[iquote('0:Obv:24029.1')] ).
cnf(26320,plain,
~ equal(host(skc13),host(skc7)),
inference(res,[status(thm),theory(equality)],[32,24030]),
[iquote('0:Res:32.0,24030.1')] ).
cnf(26324,plain,
~ equal(host(skc7),host(skc7)),
inference(rew,[status(thm),theory(equality)],[123,26320]),
[iquote('0:Rew:123.0,26320.0')] ).
cnf(26325,plain,
$false,
inference(obv,[status(thm),theory(equality)],[26324]),
[iquote('0:Obv:26324.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV454+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 14:12:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 23.35/23.53
% 23.35/23.53 SPASS V 3.9
% 23.35/23.53 SPASS beiseite: Proof found.
% 23.35/23.53 % SZS status Theorem
% 23.35/23.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.35/23.53 SPASS derived 24181 clauses, backtracked 150 clauses, performed 13 splits and kept 10871 clauses.
% 23.35/23.53 SPASS allocated 113971 KBytes.
% 23.35/23.53 SPASS spent 0:0:23.04 on the problem.
% 23.35/23.53 0:00:00.04 for the input.
% 23.35/23.53 0:00:00.05 for the FLOTTER CNF translation.
% 23.35/23.53 0:00:00.29 for inferences.
% 23.35/23.53 0:00:00.06 for the backtracking.
% 23.35/23.53 0:0:22.46 for the reduction.
% 23.35/23.53
% 23.35/23.53
% 23.35/23.53 Here is a proof with depth 4, length 22 :
% 23.35/23.53 % SZS output start Refutation
% See solution above
% 23.35/23.53 Formulae used in the proof : conj axiom_46
% 23.35/23.53
%------------------------------------------------------------------------------