TSTP Solution File: HWV023-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HWV023-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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 : Sat Jul 16 19:14:53 EDT 2022
% Result : Unsatisfiable 0.20s 0.66s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.31 % Problem : HWV023-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.32 % Command : run_spass %d %s
% 0.13/0.53 % Computer : n010.cluster.edu
% 0.13/0.53 % Model : x86_64 x86_64
% 0.13/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.53 % Memory : 8042.1875MB
% 0.13/0.53 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.53 % CPULimit : 300
% 0.13/0.53 % WCLimit : 600
% 0.13/0.53 % DateTime : Thu Jun 16 23:21:08 EDT 2022
% 0.13/0.54 % CPUTime :
% 0.20/0.66
% 0.20/0.66 SPASS V 3.9
% 0.20/0.66 SPASS beiseite: Proof found.
% 0.20/0.66 % SZS status Theorem
% 0.20/0.66 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.66 SPASS derived 334 clauses, backtracked 49 clauses, performed 3 splits and kept 257 clauses.
% 0.20/0.66 SPASS allocated 76046 KBytes.
% 0.20/0.66 SPASS spent 0:00:00.11 on the problem.
% 0.20/0.66 0:00:00.04 for the input.
% 0.20/0.66 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.66 0:00:00.01 for inferences.
% 0.20/0.66 0:00:00.00 for the backtracking.
% 0.20/0.66 0:00:00.03 for the reduction.
% 0.20/0.66
% 0.20/0.66
% 0.20/0.66 Here is a proof with depth 3, length 37 :
% 0.20/0.66 % SZS output start Refutation
% 0.20/0.66 1[0:Inp] || -> equal(level(t_139),n1)**.
% 0.20/0.66 2[0:Inp] || p_Wr(t_139)* -> .
% 0.20/0.66 3[0:Inp] || -> p_Rd(t_139)*.
% 0.20/0.66 4[0:Inp] || p_Reset(t_139)* -> .
% 0.20/0.66 5[0:Inp] || p_Empty(plus(t_139,n1))* -> .
% 0.20/0.66 7[0:Inp] || -> gt(plus(u,n1),n0)*l.
% 0.20/0.66 10[0:Inp] || equal(plus(u,v),w)*+ -> def_10(v,w) equal(minus(w,v),u)*.
% 0.20/0.66 12[0:Inp] || equal(u,v) def_10(v,u)* -> .
% 0.20/0.66 24[0:Inp] || -> equal(plus(n0,u),u)**.
% 0.20/0.66 26[0:Inp] || -> equal(int_level(u),level(u))**.
% 0.20/0.66 29[0:Inp] || equal(int_level(u),n0)** -> p_Empty(u).
% 0.20/0.66 76[0:Inp] p_Rd(u) || gt(int_level(u),n0) -> p_Reset(u) p_Wr(u) equal(int_level(plus(u,n1)),minus(int_level(u),n1))**.
% 0.20/0.66 83[0:Inp] p_Rd(u) || -> p_Reset(u) p_Wr(u) gt(int_level(u),n0) equal(int_level(plus(u,n1)),int_level(u))**.
% 0.20/0.66 87[0:Inp] || -> p_Reset(u) p_Wr(u) p_Rd(u) equal(int_level(plus(u,n1)),int_level(u))**.
% 0.20/0.66 97[0:Rew:26.0,29.0] || equal(level(u),n0)** -> p_Empty(u).
% 0.20/0.66 103[0:Rew:26.0,87.3,26.0,87.3] || -> p_Rd(u) p_Wr(u) p_Reset(u) equal(level(plus(u,n1)),level(u))**.
% 0.20/0.66 131[0:Rew:26.0,83.4,26.0,83.4,26.0,83.3] p_Rd(u) || -> p_Reset(u) p_Wr(u) gt(level(u),n0) equal(level(plus(u,n1)),level(u))**.
% 0.20/0.66 132[0:MRR:131.0,103.2] || -> p_Wr(u) p_Reset(u) gt(level(u),n0) equal(level(plus(u,n1)),level(u))**.
% 0.20/0.66 147[0:Rew:26.0,76.4,26.0,76.4,26.0,76.1] p_Rd(u) || gt(level(u),n0) -> p_Wr(u) p_Reset(u) equal(minus(level(u),n1),level(plus(u,n1)))**.
% 0.20/0.66 183[0:Res:3.0,147.0] || gt(level(t_139),n0) -> p_Reset(t_139) p_Wr(t_139) equal(minus(level(t_139),n1),level(plus(t_139,n1)))**.
% 0.20/0.66 202[0:Res:132.0,4.0] || -> p_Wr(t_139) gt(level(t_139),n0) equal(level(plus(t_139,n1)),level(t_139))**.
% 0.20/0.66 240[0:Rew:1.0,202.2,1.0,202.1] || -> p_Wr(t_139) gt(n1,n0) equal(level(plus(t_139,n1)),n1)**.
% 0.20/0.66 241[0:MRR:240.0,2.0] || -> gt(n1,n0) equal(level(plus(t_139,n1)),n1)**.
% 0.20/0.66 251[0:Rew:1.0,183.3,1.0,183.0] || gt(n1,n0) -> p_Reset(t_139) p_Wr(t_139) equal(level(plus(t_139,n1)),minus(n1,n1))**.
% 0.20/0.66 252[0:MRR:251.1,251.2,4.0,2.0] || gt(n1,n0) -> equal(level(plus(t_139,n1)),minus(n1,n1))**.
% 0.20/0.66 267[1:Spt:241.0] || -> gt(n1,n0)*r.
% 0.20/0.66 269[1:MRR:252.0,267.0] || -> equal(level(plus(t_139,n1)),minus(n1,n1))**.
% 0.20/0.66 297[1:SpL:269.0,97.0] || equal(minus(n1,n1),n0) -> p_Empty(plus(t_139,n1))*.
% 0.20/0.66 298[1:MRR:297.1,5.0] || equal(minus(n1,n1),n0)** -> .
% 0.20/0.66 346[0:SpR:24.0,7.0] || -> gt(n1,n0)*r.
% 0.20/0.66 565[0:SpL:24.0,10.0] || equal(u,v) -> def_10(u,v) equal(minus(v,u),n0)**.
% 0.20/0.66 566[0:MRR:565.1,12.1] || equal(u,v) -> equal(minus(v,u),n0)**.
% 0.20/0.66 568[1:SpL:566.1,298.0] || equal(n1,n1) equal(n0,n0)* -> .
% 0.20/0.66 570[1:Obv:568.1] || -> .
% 0.20/0.66 576[1:Spt:570.0,241.0,267.0] || gt(n1,n0)*r -> .
% 0.20/0.66 577[1:Spt:570.0,241.1] || -> equal(level(plus(t_139,n1)),n1)**.
% 0.20/0.66 578[1:MRR:576.0,346.0] || -> .
% 0.20/0.66 % SZS output end Refutation
% 0.20/0.66 Formulae used in the proof : quest_1 quest_2 quest_3 quest_4 quest_5 axiom_2 axiom_5 axiom_7 axiom_19 axiom_21 axiom_24 axiom_71 axiom_78 axiom_82
% 0.20/0.66
%------------------------------------------------------------------------------