TSTP Solution File: HWV022-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : HWV022-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n008.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:52 EDT 2022

% Result   : Unsatisfiable 0.36s 0.53s
% Output   : Refutation 0.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : HWV022-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.14/0.33  % Computer : n008.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Fri Jun 17 01:31:37 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.36/0.53  
% 0.36/0.53  SPASS V 3.9 
% 0.36/0.53  SPASS beiseite: Proof found.
% 0.36/0.53  % SZS status Theorem
% 0.36/0.53  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.36/0.53  SPASS derived 1062 clauses, backtracked 71 clauses, performed 8 splits and kept 578 clauses.
% 0.36/0.53  SPASS allocated 76569 KBytes.
% 0.36/0.53  SPASS spent	0:00:00.19 on the problem.
% 0.36/0.53  		0:00:00.04 for the input.
% 0.36/0.53  		0:00:00.00 for the FLOTTER CNF translation.
% 0.36/0.53  		0:00:00.02 for inferences.
% 0.36/0.53  		0:00:00.00 for the backtracking.
% 0.36/0.53  		0:00:00.10 for the reduction.
% 0.36/0.53  
% 0.36/0.53  
% 0.36/0.53  Here is a proof with depth 5, length 68 :
% 0.36/0.53  % SZS output start Refutation
% 0.36/0.53  1[0:Inp] ||  -> equal(plus(level(t_139),n1),fifo_length)**.
% 0.36/0.53  2[0:Inp] || p_Rd(t_139)* -> .
% 0.36/0.53  3[0:Inp] ||  -> p_Wr(t_139)*.
% 0.36/0.53  4[0:Inp] || p_Reset(t_139)* -> .
% 0.36/0.53  5[0:Inp] || equal(level(plus(t_139,n1)),fifo_length)** -> .
% 0.36/0.53  6[0:Inp] || equal(plus(u,n1),n0)** -> .
% 0.36/0.53  7[0:Inp] ||  -> gt(plus(u,n1),n0)*l.
% 0.36/0.53  8[0:Inp] || gt(u,n0) -> gt(u,minus(u,n1))*r.
% 0.36/0.53  10[0:Inp] || equal(plus(u,v),w)*+ -> def_10(v,w) equal(minus(w,v),u)*.
% 0.36/0.53  11[0:Inp] || gt(u,v) def_10(v,u)* -> .
% 0.36/0.53  15[0:Inp] || gt(plus(u,n1),v)* -> equal(v,u) gt(u,v).
% 0.36/0.54  17[0:Inp] ||  -> gt(u,v)* equal(u,v) gt(v,u)*.
% 0.36/0.54  18[0:Inp] || gt(u,v)* gt(v,w)* -> gt(u,w)*.
% 0.36/0.54  20[0:Inp] ||  -> gt(u,n0)* equal(u,n0).
% 0.36/0.54  22[0:Inp] || gt(u,u)* -> .
% 0.36/0.54  23[0:Inp] || equal(plus(u,n1),plus(v,n1))* -> equal(u,v).
% 0.36/0.54  24[0:Inp] ||  -> equal(plus(n0,u),u)**.
% 0.36/0.54  26[0:Inp] ||  -> equal(int_level(u),level(u))**.
% 0.36/0.54  29[0:Inp] || equal(int_level(u),n0)** -> p_Empty(u).
% 0.36/0.54  30[0:Inp] p_Empty(u) ||  -> equal(int_level(u),n0)**.
% 0.36/0.54  40[0:Inp] p_Wr(u) || gt(fifo_length,int_level(u)) -> p_Reset(u) p_Rd(u) equal(plus(int_level(u),n1),int_level(plus(u,n1)))**.
% 0.36/0.54  49[0:Inp] p_Wr(u) ||  -> p_Reset(u) p_Rd(u) gt(fifo_length,int_level(u)) equal(int_level(plus(u,n1)),int_level(u))**.
% 0.36/0.54  87[0:Inp] ||  -> p_Reset(u) p_Wr(u) p_Rd(u) equal(int_level(plus(u,n1)),int_level(u))**.
% 0.36/0.54  96[0:Rew:26.0,30.1] p_Empty(u) ||  -> equal(level(u),n0)**.
% 0.36/0.54  97[0:Rew:26.0,29.0] || equal(level(u),n0)** -> p_Empty(u).
% 0.36/0.54  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.36/0.54  123[0:Rew:26.0,49.4,26.0,49.4,26.0,49.3] p_Wr(u) ||  -> p_Reset(u) p_Rd(u) gt(fifo_length,level(u)) equal(level(plus(u,n1)),level(u))**.
% 0.36/0.54  124[0:MRR:123.0,103.1] ||  -> p_Rd(u) p_Reset(u) gt(fifo_length,level(u)) equal(level(plus(u,n1)),level(u))**.
% 0.36/0.54  141[0:Rew:26.0,40.4,26.0,40.4,26.0,40.1] p_Wr(u) || gt(fifo_length,level(u)) -> p_Rd(u) p_Reset(u) equal(plus(level(u),n1),level(plus(u,n1)))**.
% 0.36/0.54  184[0:Res:3.0,141.0] || gt(fifo_length,level(t_139)) -> p_Reset(t_139) p_Rd(t_139) equal(plus(level(t_139),n1),level(plus(t_139,n1)))**.
% 0.36/0.54  203[0:Res:124.0,4.0] ||  -> p_Rd(t_139) gt(fifo_length,level(t_139)) equal(level(plus(t_139,n1)),level(t_139))**.
% 0.36/0.54  230[0:Res:1.0,10.0] ||  -> def_10(n1,fifo_length) equal(minus(fifo_length,n1),level(t_139))**.
% 0.36/0.54  238[0:Res:17.1,5.0] ||  -> gt(level(plus(t_139,n1)),fifo_length)*l gt(fifo_length,level(plus(t_139,n1))).
% 0.36/0.54  247[0:MRR:203.0,2.0] ||  -> gt(fifo_length,level(t_139)) equal(level(plus(t_139,n1)),level(t_139))**.
% 0.36/0.54  251[0:Rew:1.0,184.3] || gt(fifo_length,level(t_139)) -> p_Reset(t_139) p_Rd(t_139) equal(level(plus(t_139,n1)),fifo_length)**.
% 0.36/0.54  252[0:MRR:251.1,251.2,251.3,4.0,2.0,5.0] || gt(fifo_length,level(t_139))*r -> .
% 0.36/0.54  254[0:MRR:247.0,252.0] ||  -> equal(level(plus(t_139,n1)),level(t_139))**.
% 0.36/0.54  260[0:Rew:254.0,238.0] ||  -> gt(level(t_139),fifo_length) gt(fifo_length,level(plus(t_139,n1)))*r.
% 0.36/0.54  261[0:Rew:254.0,260.1] ||  -> gt(level(t_139),fifo_length)*l gt(fifo_length,level(t_139)).
% 0.36/0.54  262[0:MRR:261.1,252.0] ||  -> gt(level(t_139),fifo_length)*l.
% 0.36/0.54  265[1:Spt:230.1] ||  -> equal(minus(fifo_length,n1),level(t_139))**.
% 0.36/0.54  276[0:SpL:1.0,6.0] || equal(n0,fifo_length)** -> .
% 0.36/0.54  278[0:SpR:96.1,1.0] p_Empty(t_139) ||  -> equal(plus(n0,n1),fifo_length)**.
% 0.36/0.54  281[0:Rew:24.0,278.1] p_Empty(t_139) ||  -> equal(fifo_length,n1)**.
% 0.36/0.54  309[0:SpR:96.1,262.0] p_Empty(t_139) ||  -> gt(n0,fifo_length)*l.
% 0.36/0.54  310[0:Rew:281.1,309.1] p_Empty(t_139) ||  -> gt(n0,n1)*l.
% 0.36/0.54  355[0:SpR:1.0,7.0] ||  -> gt(fifo_length,n0)*r.
% 0.36/0.54  357[0:SpR:24.0,7.0] ||  -> gt(n1,n0)*r.
% 0.36/0.54  360[0:NCh:18.2,18.1,357.0,22.0] || gt(n0,n1)*l -> .
% 0.36/0.54  362[0:MRR:310.1,360.0] p_Empty(t_139) ||  -> .
% 0.36/0.54  369[0:NCh:18.2,18.1,20.0,22.0] || gt(n0,u)* -> equal(u,n0).
% 0.36/0.54  421[0:SpL:24.0,23.0] || equal(plus(u,n1),n1)** -> equal(n0,u).
% 0.36/0.54  429[0:SpL:1.0,421.0] || equal(fifo_length,n1) -> equal(level(t_139),n0)**.
% 0.36/0.54  441[0:SpL:429.1,97.0] || equal(fifo_length,n1) equal(n0,n0) -> p_Empty(t_139)*.
% 0.36/0.54  444[0:Obv:441.1] || equal(fifo_length,n1) -> p_Empty(t_139)*.
% 0.36/0.54  445[0:MRR:444.1,362.0] || equal(fifo_length,n1)** -> .
% 0.36/0.54  1000[1:SpR:265.0,8.1] || gt(fifo_length,n0) -> gt(fifo_length,level(t_139))*r.
% 0.36/0.54  1011[1:MRR:1000.0,1000.1,355.0,252.0] ||  -> .
% 0.36/0.54  1014[1:Spt:1011.0,230.1,265.0] || equal(minus(fifo_length,n1),level(t_139))** -> .
% 0.36/0.54  1015[1:Spt:1011.0,230.0] ||  -> def_10(n1,fifo_length)*.
% 0.36/0.54  1019[1:Res:1015.0,11.1] || gt(fifo_length,n1)*l -> .
% 0.36/0.54  1241[1:Res:17.0,1019.0] ||  -> equal(fifo_length,n1) gt(n1,fifo_length)*r.
% 0.36/0.54  1247[1:MRR:1241.0,445.0] ||  -> gt(n1,fifo_length)*r.
% 0.36/0.54  1324[0:SpL:24.0,15.0] || gt(n1,u)* -> equal(u,n0) gt(n0,u)*.
% 0.36/0.54  1350[0:MRR:1324.2,369.0] || gt(n1,u)*+ -> equal(u,n0)*.
% 0.36/0.54  1364[1:NCh:18.2,18.1,1350.0,1247.0] || equal(n1,n1) -> equal(n0,fifo_length)**.
% 0.36/0.54  1380[1:Obv:1364.0] ||  -> equal(n0,fifo_length)**.
% 0.36/0.54  1381[1:MRR:1380.0,276.0] ||  -> .
% 0.36/0.54  % SZS output end Refutation
% 0.36/0.54  Formulae used in the proof : quest_1 quest_2 quest_3 quest_4 quest_5 axiom_1 axiom_2 axiom_3 axiom_5 axiom_6 axiom_10 axiom_12 axiom_13 axiom_15 axiom_17 axiom_18 axiom_19 axiom_21 axiom_24 axiom_25 axiom_35 axiom_44 axiom_82
% 0.36/0.54  
%------------------------------------------------------------------------------