TSTP Solution File: SWV403+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV403+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n011.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:42:40 EDT 2022

% Result   : Theorem 0.69s 0.87s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV403+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n011.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 20:40:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.69/0.87  
% 0.69/0.87  SPASS V 3.9 
% 0.69/0.87  SPASS beiseite: Proof found.
% 0.69/0.87  % SZS status Theorem
% 0.69/0.87  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.69/0.87  SPASS derived 2166 clauses, backtracked 58 clauses, performed 5 splits and kept 622 clauses.
% 0.69/0.87  SPASS allocated 87831 KBytes.
% 0.69/0.87  SPASS spent	0:00:00.50 on the problem.
% 0.69/0.87  		0:00:00.04 for the input.
% 0.69/0.87  		0:00:00.03 for the FLOTTER CNF translation.
% 0.69/0.87  		0:00:00.06 for inferences.
% 0.69/0.87  		0:00:00.00 for the backtracking.
% 0.69/0.87  		0:00:00.33 for the reduction.
% 0.69/0.87  
% 0.69/0.87  
% 0.69/0.87  Here is a proof with depth 5, length 54 :
% 0.69/0.87  % SZS output start Refutation
% 0.69/0.87  1[0:Inp] ||  -> strictly_less_than(skc7,skc8)*.
% 0.69/0.87  2[0:Inp] ||  -> less_than(u,u)*.
% 0.69/0.87  8[0:Inp] ||  -> less_than(u,v)* less_than(v,u)*.
% 0.69/0.87  11[0:Inp] ||  -> pair_in_list(insert_slb(skc6,pair(skc10,skc9)),skc11,skc7)*.
% 0.69/0.87  15[0:Inp] || less_than(u,v) -> less_than(v,u) strictly_less_than(u,v)*.
% 0.69/0.87  16[0:Inp] || pair_in_list(update_slb(insert_slb(skc6,pair(skc10,skc9)),skc8),skc11,skc8)* -> .
% 0.69/0.87  20[0:Inp] || pair_in_list(u,v,w) -> pair_in_list(insert_slb(u,pair(x,y)),v,w)*.
% 0.69/0.87  22[0:Inp] || strictly_less_than(u,v)* pair_in_list(skc6,w,u)*+ -> pair_in_list(update_slb(skc6,v),w,v)*.
% 0.69/0.87  23[0:Inp] || pair_in_list(insert_slb(u,pair(v,w)),x,y)* -> equal(v,x) pair_in_list(u,x,y).
% 0.69/0.87  24[0:Inp] || pair_in_list(insert_slb(u,pair(v,w)),x,y)* -> equal(w,y) pair_in_list(u,x,y).
% 0.69/0.87  25[0:Inp] || equal(u,v) equal(w,x) -> pair_in_list(insert_slb(y,pair(w,u)),x,v)*.
% 0.69/0.87  27[0:Inp] || strictly_less_than(u,v) -> equal(update_slb(insert_slb(w,pair(x,u)),v),insert_slb(update_slb(w,v),pair(x,v)))*.
% 0.69/0.87  28[0:Inp] || less_than(u,v) -> equal(insert_slb(update_slb(w,u),pair(x,v)),update_slb(insert_slb(w,pair(x,v)),u))**.
% 0.69/0.87  30[0:MRR:15.0,8.0] ||  -> strictly_less_than(u,v)* less_than(v,u).
% 0.69/0.87  31[0:Res:1.0,27.0] ||  -> equal(insert_slb(update_slb(u,skc8),pair(v,skc8)),update_slb(insert_slb(u,pair(v,skc7)),skc8))**.
% 0.69/0.87  34[0:Res:1.0,22.1] || pair_in_list(skc6,u,skc7) -> pair_in_list(update_slb(skc6,skc8),u,skc8)*.
% 0.69/0.87  36[0:Res:11.0,23.0] ||  -> equal(skc11,skc10) pair_in_list(skc6,skc11,skc7)*.
% 0.69/0.87  37[0:Res:11.0,24.0] ||  -> equal(skc9,skc7) pair_in_list(skc6,skc11,skc7)*.
% 0.69/0.87  43[1:Spt:36.0] ||  -> equal(skc11,skc10)**.
% 0.69/0.87  44[1:Rew:43.0,37.1] ||  -> equal(skc9,skc7) pair_in_list(skc6,skc10,skc7)*.
% 0.69/0.87  46[1:Rew:43.0,16.0] || pair_in_list(update_slb(insert_slb(skc6,pair(skc10,skc9)),skc8),skc10,skc8)* -> .
% 0.69/0.87  49[2:Spt:44.0] ||  -> equal(skc9,skc7)**.
% 0.69/0.87  51[2:Rew:49.0,46.0] || pair_in_list(update_slb(insert_slb(skc6,pair(skc10,skc7)),skc8),skc10,skc8)* -> .
% 0.69/0.87  119[0:SpR:31.0,25.2] || equal(skc8,u) equal(v,w) -> pair_in_list(update_slb(insert_slb(x,pair(v,skc7)),skc8),w,u)*.
% 0.69/0.87  189[0:SpR:27.1,20.1] || strictly_less_than(u,v) pair_in_list(update_slb(w,v),x,y) -> pair_in_list(update_slb(insert_slb(w,pair(z,u)),v),x,y)*.
% 0.69/0.87  273[0:SpR:28.1,20.1] || less_than(u,v) pair_in_list(update_slb(w,u),x,y) -> pair_in_list(update_slb(insert_slb(w,pair(z,v)),u),x,y)*.
% 0.69/0.87  283[0:SpR:28.1,31.0] || less_than(skc8,skc8) -> equal(update_slb(insert_slb(u,pair(v,skc8)),skc8),update_slb(insert_slb(u,pair(v,skc7)),skc8))**.
% 0.69/0.87  287[0:SpR:28.1,27.1] || less_than(u,u) strictly_less_than(v,u) -> equal(update_slb(insert_slb(w,pair(x,v)),u),update_slb(insert_slb(w,pair(x,u)),u))*.
% 0.69/0.87  298[0:MRR:283.0,2.0] ||  -> equal(update_slb(insert_slb(u,pair(v,skc8)),skc8),update_slb(insert_slb(u,pair(v,skc7)),skc8))**.
% 0.69/0.87  299[0:MRR:287.0,2.0] || strictly_less_than(u,v) -> equal(update_slb(insert_slb(w,pair(x,u)),v),update_slb(insert_slb(w,pair(x,v)),v))*.
% 0.69/0.87  396[2:Res:119.2,51.0] || equal(skc8,skc8) equal(skc10,skc10)* -> .
% 0.69/0.87  397[2:Obv:396.1] ||  -> .
% 0.69/0.87  398[2:Spt:397.0,44.0,49.0] || equal(skc9,skc7)** -> .
% 0.69/0.87  399[2:Spt:397.0,44.1] ||  -> pair_in_list(skc6,skc10,skc7)*.
% 0.69/0.87  542[1:SpL:299.1,46.0] || strictly_less_than(skc9,skc8) pair_in_list(update_slb(insert_slb(skc6,pair(skc10,skc8)),skc8),skc10,skc8)* -> .
% 0.69/0.87  543[1:Rew:298.0,542.1] || strictly_less_than(skc9,skc8) pair_in_list(update_slb(insert_slb(skc6,pair(skc10,skc7)),skc8),skc10,skc8)* -> .
% 0.69/0.87  605[1:Res:119.2,543.1] || equal(skc8,skc8) equal(skc10,skc10) strictly_less_than(skc9,skc8)* -> .
% 0.69/0.87  606[1:Obv:605.1] || strictly_less_than(skc9,skc8)* -> .
% 0.69/0.87  607[1:Res:30.0,606.0] ||  -> less_than(skc8,skc9)*r.
% 0.69/0.87  2679[1:Res:273.2,46.0] || less_than(skc8,skc9) pair_in_list(update_slb(skc6,skc8),skc10,skc8)* -> .
% 0.69/0.87  2682[1:MRR:2679.0,607.0] || pair_in_list(update_slb(skc6,skc8),skc10,skc8)* -> .
% 0.69/0.87  2685[1:Res:34.1,2682.0] || pair_in_list(skc6,skc10,skc7)* -> .
% 0.69/0.87  2688[2:MRR:2685.0,399.0] ||  -> .
% 0.69/0.87  2689[1:Spt:2688.0,36.0,43.0] || equal(skc11,skc10)** -> .
% 0.69/0.87  2690[1:Spt:2688.0,36.1] ||  -> pair_in_list(skc6,skc11,skc7)*.
% 0.69/0.87  2691[1:Res:2690.0,22.1] || strictly_less_than(skc7,u) -> pair_in_list(update_slb(skc6,u),skc11,u)*.
% 0.69/0.87  2717[0:Res:189.2,16.0] || strictly_less_than(skc9,skc8) pair_in_list(update_slb(skc6,skc8),skc11,skc8)* -> .
% 0.69/0.87  2718[0:Res:273.2,16.0] || less_than(skc8,skc9) pair_in_list(update_slb(skc6,skc8),skc11,skc8)* -> .
% 0.69/0.87  2722[1:Res:2691.1,2717.1] || strictly_less_than(skc7,skc8) strictly_less_than(skc9,skc8)* -> .
% 0.69/0.87  2723[1:MRR:2722.0,1.0] || strictly_less_than(skc9,skc8)* -> .
% 0.69/0.87  2724[1:Res:30.0,2723.0] ||  -> less_than(skc8,skc9)*r.
% 0.69/0.87  2725[1:MRR:2718.0,2724.0] || pair_in_list(update_slb(skc6,skc8),skc11,skc8)* -> .
% 0.69/0.87  2726[1:Res:34.1,2725.0] || pair_in_list(skc6,skc11,skc7)* -> .
% 0.69/0.87  2729[1:MRR:2726.0,2690.0] ||  -> .
% 0.69/0.87  % SZS output end Refutation
% 0.69/0.87  Formulae used in the proof : l39_co reflexivity totality stricly_smaller_definition ax23 ax29 ax30
% 0.69/0.87  
%------------------------------------------------------------------------------