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

View Problem - Process Solution

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

% Computer : n028.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 : Sun Jul 17 03:30:42 EDT 2022

% Result   : Theorem 0.18s 0.45s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS144+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun  7 11:00:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  
% 0.18/0.45  SPASS V 3.9 
% 0.18/0.45  SPASS beiseite: Proof found.
% 0.18/0.45  % SZS status Theorem
% 0.18/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.45  SPASS derived 34 clauses, backtracked 17 clauses, performed 3 splits and kept 55 clauses.
% 0.18/0.45  SPASS allocated 97877 KBytes.
% 0.18/0.45  SPASS spent	0:00:00.11 on the problem.
% 0.18/0.45  		0:00:00.04 for the input.
% 0.18/0.45  		0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.45  		0:00:00.00 for inferences.
% 0.18/0.45  		0:00:00.00 for the backtracking.
% 0.18/0.45  		0:00:00.00 for the reduction.
% 0.18/0.45  
% 0.18/0.45  
% 0.18/0.45  Here is a proof with depth 3, length 54 :
% 0.18/0.45  % SZS output start Refutation
% 0.18/0.45  1[0:Inp] ||  -> cowlThing(u)*.
% 0.18/0.45  2[0:Inp] ||  -> SkC1 cc(skc12)*.
% 0.18/0.45  3[0:Inp] cowlNothing(u) ||  -> .
% 0.18/0.45  4[0:Inp] ||  -> SkC1 rp(skc12,skc15)*.
% 0.18/0.45  5[0:Inp] ||  -> SkC1 rp(skc12,skc14)*.
% 0.18/0.45  6[0:Inp] ||  -> SkC1 rp(skc12,skc13)*.
% 0.18/0.45  7[0:Inp] ||  -> xsd_string(u)* xsd_integer(u).
% 0.18/0.45  8[0:Inp] || equal(skc15,skc14) -> SkC1*.
% 0.18/0.45  9[0:Inp] || equal(skc15,skc13) -> SkC1*.
% 0.18/0.45  10[0:Inp] || equal(skc14,skc13) -> SkC1*.
% 0.18/0.45  11[0:Inp] || xsd_integer(skc11) -> xsd_string(skc11)* SkC0.
% 0.18/0.45  12[0:Inp] || xsd_string(skc11)* -> xsd_integer(skc11) SkC0.
% 0.18/0.45  13[0:Inp] xsd_integer(u) xsd_string(u) ||  -> .
% 0.18/0.45  14[0:Inp] cc(u) ||  -> rp(u,skf5(u))*.
% 0.18/0.45  15[0:Inp] cc(u) ||  -> rp(u,skf4(u))*.
% 0.18/0.45  16[0:Inp] cc(u) || equal(skf5(u),skf4(u))** -> .
% 0.18/0.45  17[0:Inp] || cowlThing(skc8) SkC0 SkC1 -> cc(skc10) cowlNothing(skc9)*.
% 0.18/0.45  18[0:Inp] || rp(skc10,u)* rp(skc10,v)* cowlThing(skc8) SkC0 SkC1 -> equal(u,v)* cowlNothing(skc9).
% 0.18/0.45  19[0:Inp] cc(u) || rp(u,v)*+ rp(u,w)* rp(u,x)* -> equal(x,w)* equal(v,w)* equal(v,x)*.
% 0.18/0.45  20[0:MRR:12.0,7.1] ||  -> SkC0 xsd_integer(skc11)*.
% 0.18/0.45  21[0:MRR:11.0,20.0] ||  -> SkC0 xsd_string(skc11)*.
% 0.18/0.45  22[0:MRR:17.0,17.4,1.0,3.0] || SkC1 SkC0 -> cc(skc10)*.
% 0.18/0.45  23[0:MRR:18.2,18.6,1.0,3.0] || SkC1 SkC0 rp(skc10,u)* rp(skc10,v)* -> equal(v,u)*.
% 0.18/0.45  24[1:Spt:2.0] ||  -> SkC1*.
% 0.18/0.45  25[1:MRR:22.0,24.0] || SkC0 -> cc(skc10)*.
% 0.18/0.45  26[1:MRR:23.0,24.0] || SkC0 rp(skc10,u)* rp(skc10,v)* -> equal(v,u)*.
% 0.18/0.45  27[2:Spt:20.0] ||  -> SkC0*.
% 0.18/0.45  28[2:MRR:25.0,27.0] ||  -> cc(skc10)*.
% 0.18/0.45  29[2:MRR:26.0,27.0] || rp(skc10,u)*+ rp(skc10,v)* -> equal(v,u)*.
% 0.18/0.45  30[2:Res:15.1,29.0] cc(skc10) || rp(skc10,u)* -> equal(u,skf4(skc10)).
% 0.18/0.45  32[2:SSi:30.0,28.0] || rp(skc10,u)* -> equal(u,skf4(skc10)).
% 0.18/0.45  39[2:Res:14.1,32.0] cc(skc10) ||  -> equal(skf5(skc10),skf4(skc10))**.
% 0.18/0.45  40[2:SSi:39.0,28.0] ||  -> equal(skf5(skc10),skf4(skc10))**.
% 0.18/0.45  44[2:SpL:40.0,16.1] cc(skc10) || equal(skf4(skc10),skf4(skc10))* -> .
% 0.18/0.45  45[2:Obv:44.1] cc(skc10) ||  -> .
% 0.18/0.45  46[2:SSi:45.0,28.0] ||  -> .
% 0.18/0.45  47[2:Spt:46.0,20.0,27.0] || SkC0* -> .
% 0.18/0.45  48[2:Spt:46.0,20.1] ||  -> xsd_integer(skc11)*.
% 0.18/0.45  49[2:MRR:21.0,47.0] ||  -> xsd_string(skc11)*.
% 0.18/0.45  51[2:EmS:13.0,13.1,48.0,49.0] ||  -> .
% 0.18/0.45  52[1:Spt:51.0,2.0,24.0] || SkC1* -> .
% 0.18/0.45  53[1:Spt:51.0,2.1] ||  -> cc(skc12)*.
% 0.18/0.45  54[1:MRR:6.0,52.0] ||  -> rp(skc12,skc13)*.
% 0.18/0.45  55[1:MRR:5.0,52.0] ||  -> rp(skc12,skc14)*.
% 0.18/0.45  56[1:MRR:4.0,52.0] ||  -> rp(skc12,skc15)*.
% 0.18/0.45  57[1:MRR:10.1,52.0] || equal(skc14,skc13)** -> .
% 0.18/0.45  58[1:MRR:9.1,52.0] || equal(skc15,skc13)** -> .
% 0.18/0.45  59[1:MRR:8.1,52.0] || equal(skc15,skc14)** -> .
% 0.18/0.45  61[1:Res:54.0,19.1] cc(skc12) || rp(skc12,u)* rp(skc12,v)* -> equal(v,u)* equal(skc13,u) equal(skc13,v).
% 0.18/0.45  62[1:SSi:61.0,53.0] || rp(skc12,u)*+ rp(skc12,v)* -> equal(v,u)* equal(skc13,u) equal(skc13,v).
% 0.18/0.45  70[1:Res:55.0,62.0] || rp(skc12,u)* -> equal(u,skc14) equal(skc14,skc13) equal(skc13,u).
% 0.18/0.45  72[1:MRR:70.2,57.0] || rp(skc12,u)* -> equal(u,skc14) equal(skc13,u).
% 0.18/0.45  80[1:Res:56.0,72.0] ||  -> equal(skc15,skc14)** equal(skc15,skc13).
% 0.18/0.45  81[1:MRR:80.0,80.1,59.0,58.0] ||  -> .
% 0.18/0.45  % SZS output end Refutation
% 0.18/0.45  Formulae used in the proof : axiom_0 the_axiom axiom_1 axiom_2
% 0.18/0.45  
%------------------------------------------------------------------------------