TSTP Solution File: SWV460+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV460+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:10 EDT 2022
% Result : Theorem 31.89s 32.08s
% Output : Refutation 31.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV460+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Tue Jun 14 21:31:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 31.89/32.08
% 31.89/32.08 SPASS V 3.9
% 31.89/32.08 SPASS beiseite: Proof found.
% 31.89/32.08 % SZS status Theorem
% 31.89/32.08 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.89/32.08 SPASS derived 34757 clauses, backtracked 1431 clauses, performed 12 splits and kept 12685 clauses.
% 31.89/32.08 SPASS allocated 122648 KBytes.
% 31.89/32.08 SPASS spent 0:0:30.99 on the problem.
% 31.89/32.08 0:00:00.04 for the input.
% 31.89/32.08 0:00:00.05 for the FLOTTER CNF translation.
% 31.89/32.08 0:00:00.39 for inferences.
% 31.89/32.08 0:00:00.50 for the backtracking.
% 31.89/32.08 0:0:29.83 for the reduction.
% 31.89/32.08
% 31.89/32.08
% 31.89/32.08 Here is a proof with depth 7, length 58 :
% 31.89/32.08 % SZS output start Refutation
% 31.89/32.08 2[0:Inp] || -> setIn(skc5,alive)*.
% 31.89/32.08 3[0:Inp] || -> setIn(skc9,alive)*.
% 31.89/32.08 8[0:Inp] || equal(elec_1,elec_2)** -> .
% 31.89/32.08 21[0:Inp] || -> equal(host(skc8),host(skc5))**.
% 31.89/32.08 23[0:Inp] || -> leq(s(zero),host(u))*.
% 31.89/32.08 27[0:Inp] || leq(s(u),u)*l -> .
% 31.89/32.08 31[0:Inp] || leq(host(skc8),host(skc9))*r -> .
% 31.89/32.08 32[0:Inp] || -> equal(index(status__dfg,host(skc9)),elec_2)**.
% 31.89/32.08 43[0:Inp] || -> equal(head(cons(u,v)),u)**.
% 31.89/32.08 47[0:Inp] || equal(cons(u,v),q_nil)** -> .
% 31.89/32.08 48[0:Inp] || equal(snoc(u,v),q_nil)** -> .
% 31.89/32.08 62[0:Inp] || -> equal(cons(m_Down(skc6),skc7),queue(host(skc5)))**.
% 31.89/32.08 63[0:Inp] || -> leq(s(host(skc5)),index(pendack,host(skc9)))*r.
% 31.89/32.08 76[0:Inp] || equal(u,v) -> elem(u,cons(v,w))*.
% 31.89/32.08 83[0:Inp] || leq(u,v) -> leq(s(u),s(v))*.
% 31.89/32.08 86[0:Inp] || -> equal(u,q_nil) equal(cons(head(u),tail(u)),u)**.
% 31.89/32.08 92[0:Inp] || -> equal(cons(u,snoc(v,w)),snoc(cons(u,v),w))**.
% 31.89/32.08 94[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 31.89/32.08 96[0:Inp] || elem(u,snoc(v,w))* -> elem(u,v) equal(u,w).
% 31.89/32.08 114[0:Inp] || leq(s(zero),u) -> equal(u,host(skc6)) setIn(u,index(down,host(skc5)))* leq(host(skc5),u).
% 31.89/32.08 119[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)).
% 31.89/32.08 122[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))*.
% 31.89/32.08 126[0:Rew:21.0,31.0] || leq(host(skc5),host(skc9))*r -> .
% 31.89/32.08 217[0:Res:32.0,122.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc9),host(v)) setIn(skc9,alive) -> leq(index(pendack,host(skc9)),host(u)).
% 31.89/32.08 299[0:Res:114.1,126.0] || leq(s(zero),host(skc9)) -> setIn(host(skc9),index(down,host(skc5)))* equal(host(skc9),host(skc6)).
% 31.89/32.08 407[0:MRR:299.0,23.0] || -> equal(host(skc9),host(skc6)) setIn(host(skc9),index(down,host(skc5)))*.
% 31.89/32.08 425[0:MRR:217.3,3.0] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc9),host(v)) -> leq(index(pendack,host(skc9)),host(u)).
% 31.89/32.08 452[1:Spt:407.0] || -> equal(host(skc9),host(skc6))**.
% 31.89/32.08 454[1:Rew:452.0,425.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc9),host(v)) -> leq(index(pendack,host(skc6)),host(u)).
% 31.89/32.08 456[1:Rew:452.0,63.0] || -> leq(s(host(skc5)),index(pendack,host(skc6)))*r.
% 31.89/32.08 477[1:Rew:452.0,454.2] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc6),host(v)) -> leq(index(pendack,host(skc6)),host(u)).
% 31.89/32.08 510[0:SpR:62.0,43.0] || -> equal(head(queue(host(skc5))),m_Down(skc6))**.
% 31.89/32.08 512[0:SpL:62.0,47.0] || equal(queue(host(skc5)),q_nil)** -> .
% 31.89/32.08 728[0:SpR:86.1,76.1] || equal(u,head(v)) -> equal(v,q_nil) elem(u,v)*.
% 31.89/32.08 764[0:SpR:92.0,43.0] || -> equal(head(snoc(cons(u,v),w)),u)**.
% 31.89/32.08 914[0:Res:728.2,96.0] || equal(u,head(snoc(v,w)))* -> equal(snoc(v,w),q_nil) elem(u,v)* equal(u,w).
% 31.89/32.08 926[0:MRR:914.1,48.0] || equal(u,head(snoc(v,w)))*+ -> elem(u,v)* equal(u,w).
% 31.89/32.08 1559[0:NCh:94.2,94.0,83.1,27.0] || leq(u,v)* leq(s(v),u)*+ -> .
% 31.89/32.08 5419[0:EqR:926.0] || -> elem(head(snoc(u,v)),u)* equal(head(snoc(u,v)),v).
% 31.89/32.08 5460[0:SpR:764.0,5419.0] || -> elem(u,cons(u,v))* equal(head(snoc(cons(u,v),w)),w)**.
% 31.89/32.08 5476[0:Rew:764.0,5460.1] || -> elem(u,cons(u,v))* equal(u,w)*.
% 31.89/32.08 5489[0:SpR:86.1,5476.0] || -> equal(u,q_nil) elem(head(u),u)* equal(head(u),v)*.
% 31.89/32.08 6966[0:AED:8.0,5489.2] || -> equal(u,q_nil) elem(head(u),u)*.
% 31.89/32.08 7245[0:SpR:510.0,6966.1] || -> equal(queue(host(skc5)),q_nil) elem(m_Down(skc6),queue(host(skc5)))*.
% 31.89/32.08 13452[1:Res:456.0,1559.1] || leq(index(pendack,host(skc6)),host(skc5))*l -> .
% 31.89/32.08 41304[0:MRR:7245.0,512.0] || -> elem(m_Down(skc6),queue(host(skc5)))*.
% 31.89/32.08 41483[1:Res:41304.0,477.1] || setIn(skc5,alive) equal(host(skc6),host(skc6)) -> leq(index(pendack,host(skc6)),host(skc5))*l.
% 31.89/32.08 41486[1:Obv:41483.1] || setIn(skc5,alive) -> leq(index(pendack,host(skc6)),host(skc5))*l.
% 31.89/32.08 41487[1:MRR:41486.0,2.0] || -> leq(index(pendack,host(skc6)),host(skc5))*l.
% 31.89/32.08 41488[1:MRR:41487.0,13452.0] || -> .
% 31.89/32.08 41490[1:Spt:41488.0,407.0,452.0] || equal(host(skc9),host(skc6))** -> .
% 31.89/32.08 41491[1:Spt:41488.0,407.1] || -> setIn(host(skc9),index(down,host(skc5)))*.
% 31.89/32.08 41497[1:Res:41491.0,119.2] || setIn(skc9,alive) setIn(skc5,alive) equal(index(status__dfg,host(skc9)),elec_2) -> leq(index(pendack,host(skc9)),host(skc5))*l.
% 31.89/32.08 41498[1:Rew:32.0,41497.2] || setIn(skc9,alive) setIn(skc5,alive) equal(elec_2,elec_2) -> leq(index(pendack,host(skc9)),host(skc5))*l.
% 31.89/32.08 41499[1:Obv:41498.2] || setIn(skc9,alive) setIn(skc5,alive) -> leq(index(pendack,host(skc9)),host(skc5))*l.
% 31.89/32.08 41500[1:MRR:41499.0,41499.1,3.0,2.0] || -> leq(index(pendack,host(skc9)),host(skc5))*l.
% 31.89/32.08 42097[0:Res:63.0,1559.1] || leq(index(pendack,host(skc9)),host(skc5))*l -> .
% 31.89/32.08 42193[1:MRR:42097.0,41500.0] || -> .
% 31.89/32.08 % SZS output end Refutation
% 31.89/32.08 Formulae used in the proof : conj axiom_05 axiom_02 axiom_58 axiom_35 axiom_41 axiom_42 axiom_46 axiom_63 axiom_39 axiom_44 axiom_62 axiom_47
% 31.89/32.08
%------------------------------------------------------------------------------