TSTP Solution File: SWV476+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV476+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:13 EDT 2022
% Result : Theorem 40.07s 40.28s
% Output : Refutation 40.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV476+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n016.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 : Tue Jun 14 16:27:31 EDT 2022
% 0.13/0.35 % CPUTime :
% 40.07/40.28
% 40.07/40.28 SPASS V 3.9
% 40.07/40.28 SPASS beiseite: Proof found.
% 40.07/40.28 % SZS status Theorem
% 40.07/40.28 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 40.07/40.28 SPASS derived 27455 clauses, backtracked 2 clauses, performed 11 splits and kept 11213 clauses.
% 40.07/40.28 SPASS allocated 117015 KBytes.
% 40.07/40.28 SPASS spent 0:0:39.72 on the problem.
% 40.07/40.28 0:00:00.04 for the input.
% 40.07/40.28 0:00:00.06 for the FLOTTER CNF translation.
% 40.07/40.28 0:00:00.36 for inferences.
% 40.07/40.28 0:00:00.03 for the backtracking.
% 40.07/40.28 0:0:39.05 for the reduction.
% 40.07/40.28
% 40.07/40.28
% 40.07/40.28 Here is a proof with depth 6, length 55 :
% 40.07/40.28 % SZS output start Refutation
% 40.07/40.28 2[0:Inp] || -> setIn(skc13,alive)*.
% 40.07/40.28 4[0:Inp] || -> setIn(skc8,alive)*.
% 40.07/40.28 7[0:Inp] || -> leq(host(u),nbr_proc)*l.
% 40.07/40.28 22[0:Inp] || -> leq(nbr_proc,s(host(skc13)))*r.
% 40.07/40.28 23[0:Inp] || -> leq(s(zero),host(u))*r.
% 40.07/40.28 27[0:Inp] || leq(s(u),u)*l -> .
% 40.07/40.28 28[0:Inp] || -> elem(m_Down(skc15),queue(host(skc13)))*.
% 40.07/40.28 29[0:Inp] || -> elem(m_Down(skc14),queue(host(skc13)))*.
% 40.07/40.28 31[0:Inp] || equal(host(skc13),host(skc8))** -> .
% 40.07/40.28 33[0:Inp] || -> equal(s(host(skc13)),host(skc15))**.
% 40.07/40.28 34[0:Inp] || -> equal(index(status__dfg,host(skc8)),elec_2)**.
% 40.07/40.28 35[0:Inp] || -> leq(nbr_proc,index(pendack,host(skc8)))*r.
% 40.07/40.28 52[0:Inp] || -> leq(u,v)* leq(v,u)*.
% 40.07/40.28 55[0:Inp] || -> equal(index(pendack,host(skc8)),host(skc9))**.
% 40.07/40.28 67[0:Inp] || equal(u,v)* -> leq(v,u).
% 40.07/40.28 97[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u).
% 40.07/40.28 98[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 40.07/40.28 105[0:Inp] || leq(u,s(v))* -> leq(u,v) equal(u,s(v)).
% 40.07/40.28 117[0:Inp] || leq(s(zero),u) -> equal(u,host(skc14)) setIn(u,index(down,host(skc13)))* leq(host(skc13),u).
% 40.07/40.28 121[0:Inp] || setIn(u,alive) setIn(v,alive) setIn(host(u),index(down,host(v)))* equal(index(status__dfg,host(u)),elec_2) -> leq(index(pendack,host(u)),host(v)).
% 40.07/40.28 123[0:Inp] || setIn(u,alive) setIn(v,alive) equal(host(u),host(w))* elem(m_Down(w),queue(host(v)))*+ equal(index(status__dfg,host(u)),elec_2) -> leq(index(pendack,host(u)),host(v))*.
% 40.07/40.28 137[0:Rew:33.0,22.0] || -> leq(nbr_proc,host(skc15))*r.
% 40.07/40.28 138[0:Rew:55.0,35.0] || -> leq(nbr_proc,host(skc9))*r.
% 40.07/40.28 263[0:Res:34.0,121.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* setIn(skc8,alive) -> leq(index(pendack,host(skc8)),host(u)).
% 40.07/40.28 267[0:Res:34.0,123.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) setIn(skc8,alive) -> leq(index(pendack,host(skc8)),host(u)).
% 40.07/40.28 361[0:Rew:55.0,263.3] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* setIn(skc8,alive) -> leq(host(skc9),host(u)).
% 40.07/40.28 362[0:MRR:361.2,4.0] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(host(skc9),host(u)).
% 40.07/40.28 375[0:Rew:55.0,267.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) setIn(skc8,alive) -> leq(host(skc9),host(u)).
% 40.07/40.28 376[0:MRR:375.3,4.0] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(host(skc9),host(u)).
% 40.07/40.28 689[0:SpL:33.0,27.0] || leq(host(skc15),host(skc13))*l -> .
% 40.07/40.28 733[0:NCh:98.2,98.0,689.0,7.0] || leq(nbr_proc,host(skc13))*r -> .
% 40.07/40.28 1656[0:Res:137.0,97.0] || leq(host(skc15),nbr_proc)*l -> equal(host(skc15),nbr_proc).
% 40.07/40.28 1657[0:Res:138.0,97.0] || leq(host(skc9),nbr_proc)*l -> equal(host(skc9),nbr_proc).
% 40.07/40.28 1747[0:MRR:1656.0,7.0] || -> equal(host(skc15),nbr_proc)**.
% 40.07/40.28 1748[0:Rew:1747.0,33.0] || -> equal(s(host(skc13)),nbr_proc)**.
% 40.07/40.28 1802[0:MRR:1657.0,7.0] || -> equal(host(skc9),nbr_proc)**.
% 40.07/40.28 1808[0:Rew:1802.0,376.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(nbr_proc,host(u)).
% 40.07/40.28 1809[0:Rew:1802.0,362.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(nbr_proc,host(u)).
% 40.07/40.28 1946[0:Res:52.0,105.0] || -> leq(s(u),v)* leq(v,u)* equal(v,s(u)).
% 40.07/40.28 2005[0:MRR:1946.2,67.0] || -> leq(s(u),v)* leq(v,u)*.
% 40.07/40.28 11511[0:Res:117.2,1809.1] || leq(s(zero),host(skc8)) setIn(skc13,alive)* -> equal(host(skc14),host(skc8)) leq(host(skc13),host(skc8)) leq(nbr_proc,host(skc13)).
% 40.07/40.28 11516[0:MRR:11511.0,11511.1,11511.4,23.0,2.0,733.0] || -> equal(host(skc14),host(skc8))** leq(host(skc13),host(skc8)).
% 40.07/40.28 20637[0:Res:29.0,1808.1] || setIn(skc13,alive)* equal(host(skc14),host(skc8)) -> leq(nbr_proc,host(skc13)).
% 40.07/40.28 20638[0:Res:28.0,1808.1] || setIn(skc13,alive)* equal(host(skc15),host(skc8)) -> leq(nbr_proc,host(skc13)).
% 40.07/40.28 20641[0:MRR:20637.0,20637.2,2.0,733.0] || equal(host(skc14),host(skc8))** -> .
% 40.07/40.28 20642[0:MRR:11516.0,20641.0] || -> leq(host(skc13),host(skc8))*l.
% 40.07/40.28 20643[0:Rew:1747.0,20638.1] || setIn(skc13,alive)* equal(host(skc8),nbr_proc) -> leq(nbr_proc,host(skc13)).
% 40.07/40.28 20644[0:MRR:20643.0,20643.2,2.0,733.0] || equal(host(skc8),nbr_proc)** -> .
% 40.07/40.28 20666[0:Res:20642.0,97.0] || leq(host(skc8),host(skc13))*r -> equal(host(skc13),host(skc8)).
% 40.07/40.28 20753[0:MRR:20666.1,31.0] || leq(host(skc8),host(skc13))*r -> .
% 40.07/40.28 21862[0:NCh:98.2,98.1,20753.0,2005.1] || equal(host(skc8),u)* -> leq(s(host(skc13)),u)*.
% 40.07/40.28 21883[0:Rew:1748.0,21862.1] || equal(host(skc8),u)* -> leq(nbr_proc,u).
% 40.07/40.28 29225[0:EqR:21883.0] || -> leq(nbr_proc,host(skc8))*r.
% 40.07/40.28 29254[0:Res:29225.0,97.0] || leq(host(skc8),nbr_proc)*l -> equal(host(skc8),nbr_proc).
% 40.07/40.28 29375[0:MRR:29254.0,29254.1,7.0,20644.0] || -> .
% 40.07/40.28 % SZS output end Refutation
% 40.07/40.28 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_04 axiom_60 axiom_61 axiom_64
% 40.07/40.28
%------------------------------------------------------------------------------