TSTP Solution File: SWV455+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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 33.40s 33.60s
% Output : Refutation 33.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 51 ( 0 equ; 30 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 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(2,axiom,
setIn(skc11,alive),
file('SWV455+1.p',unknown),
[] ).
cnf(4,axiom,
setIn(skc8,alive),
file('SWV455+1.p',unknown),
[] ).
cnf(6,axiom,
elem(m_Down(skc14),skc10),
file('SWV455+1.p',unknown),
[] ).
cnf(23,axiom,
equal(host(skc14),host(skc11)),
file('SWV455+1.p',unknown),
[] ).
cnf(24,axiom,
equal(host(skc13),host(skc12)),
file('SWV455+1.p',unknown),
[] ).
cnf(25,axiom,
equal(host(skc12),host(skc8)),
file('SWV455+1.p',unknown),
[] ).
cnf(31,axiom,
elem(m_Down(skc13),queue(host(skc11))),
file('SWV455+1.p',unknown),
[] ).
cnf(33,axiom,
~ equal(host(skc11),host(skc8)),
file('SWV455+1.p',unknown),
[] ).
cnf(64,axiom,
equal(cons(m_Down(skc9),skc10),queue(host(skc8))),
file('SWV455+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ elem(u,v)
| elem(u,cons(w,v)) ),
file('SWV455+1.p',unknown),
[] ).
cnf(121,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('SWV455+1.p',unknown),
[] ).
cnf(122,plain,
equal(host(skc13),host(skc8)),
inference(rew,[status(thm),theory(equality)],[25,24]),
[iquote('0:Rew:25.0,24.0')] ).
cnf(143,plain,
elem(m_Down(skc14),cons(u,skc10)),
inference(res,[status(thm),theory(equality)],[6,78]),
[iquote('0:Res:6.0,78.0')] ).
cnf(270,plain,
( ~ setIn(u,alive)
| ~ equal(host(skc13),host(u))
| ~ elem(m_Down(v),queue(host(u)))
| ~ equal(host(v),host(skc11))
| ~ setIn(skc11,alive)
| equal(host(skc11),host(u)) ),
inference(res,[status(thm),theory(equality)],[31,121]),
[iquote('0:Res:31.0,121.3')] ).
cnf(403,plain,
( ~ setIn(u,alive)
| ~ equal(host(skc8),host(u))
| ~ elem(m_Down(v),queue(host(u)))
| ~ equal(host(v),host(skc11))
| ~ setIn(skc11,alive)
| equal(host(skc11),host(u)) ),
inference(rew,[status(thm),theory(equality)],[122,270]),
[iquote('0:Rew:122.0,270.1')] ).
cnf(404,plain,
( ~ setIn(u,alive)
| ~ equal(host(v),host(skc11))
| ~ elem(m_Down(v),queue(host(u)))
| ~ equal(host(skc8),host(u))
| equal(host(skc11),host(u)) ),
inference(mrr,[status(thm)],[403,2]),
[iquote('0:MRR:403.4,2.0')] ).
cnf(436,plain,
elem(m_Down(skc14),queue(host(skc8))),
inference(spr,[status(thm),theory(equality)],[64,143]),
[iquote('0:SpR:64.0,143.0')] ).
cnf(31234,plain,
( ~ setIn(skc8,alive)
| ~ equal(host(skc14),host(skc11))
| ~ equal(host(skc8),host(skc8))
| equal(host(skc11),host(skc8)) ),
inference(res,[status(thm),theory(equality)],[436,404]),
[iquote('0:Res:436.0,404.2')] ).
cnf(31242,plain,
( ~ setIn(skc8,alive)
| ~ equal(host(skc14),host(skc11))
| equal(host(skc11),host(skc8)) ),
inference(obv,[status(thm),theory(equality)],[31234]),
[iquote('0:Obv:31234.2')] ).
cnf(31243,plain,
( ~ setIn(skc8,alive)
| ~ equal(host(skc11),host(skc11))
| equal(host(skc11),host(skc8)) ),
inference(rew,[status(thm),theory(equality)],[23,31242]),
[iquote('0:Rew:23.0,31242.1')] ).
cnf(31244,plain,
( ~ setIn(skc8,alive)
| equal(host(skc11),host(skc8)) ),
inference(obv,[status(thm),theory(equality)],[31243]),
[iquote('0:Obv:31243.1')] ).
cnf(31245,plain,
$false,
inference(mrr,[status(thm)],[31244,4,33]),
[iquote('0:MRR:31244.0,31244.1,4.0,33.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Tue Jun 14 19:54:28 EDT 2022
% 0.11/0.31 % CPUTime :
% 33.40/33.60
% 33.40/33.60 SPASS V 3.9
% 33.40/33.60 SPASS beiseite: Proof found.
% 33.40/33.60 % SZS status Theorem
% 33.40/33.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 33.40/33.60 SPASS derived 29137 clauses, backtracked 147 clauses, performed 14 splits and kept 12906 clauses.
% 33.40/33.60 SPASS allocated 116759 KBytes.
% 33.40/33.60 SPASS spent 0:0:33.12 on the problem.
% 33.40/33.60 0:00:00.03 for the input.
% 33.40/33.60 0:00:00.03 for the FLOTTER CNF translation.
% 33.40/33.60 0:00:00.36 for inferences.
% 33.40/33.60 0:00:00.08 for the backtracking.
% 33.40/33.60 0:0:32.47 for the reduction.
% 33.40/33.60
% 33.40/33.60
% 33.40/33.60 Here is a proof with depth 3, length 22 :
% 33.40/33.60 % SZS output start Refutation
% See solution above
% 33.40/33.60 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_46
% 33.40/33.60
%------------------------------------------------------------------------------