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

View Problem - Process Solution

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

% Computer : n024.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:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS174+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.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.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 12:39:34 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 40 clauses, backtracked 21 clauses, performed 4 splits and kept 58 clauses.
% 0.19/0.45  SPASS allocated 97766 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.45  		0:00:00.04 for the input.
% 0.19/0.45  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 3, length 55 :
% 0.19/0.45  % SZS output start Refutation
% 0.19/0.45  1[0:Inp] ||  -> cowlThing(u)*.
% 0.19/0.45  4[0:Inp] cowlNothing(u) ||  -> .
% 0.19/0.45  5[0:Inp] ||  -> xsd_string(u)* xsd_integer(u).
% 0.19/0.45  6[0:Inp] || xsd_integer(skc7) -> xsd_string(skc7)* SkC0.
% 0.19/0.45  7[0:Inp] || xsd_string(skc7)* -> xsd_integer(skc7) SkC0.
% 0.19/0.45  8[0:Inp] xsd_integer(u) xsd_string(u) ||  -> .
% 0.19/0.45  9[0:Inp] cA(u) ||  -> equal(u,ia)*.
% 0.19/0.45  10[0:Inp] || equal(u,ia)+ -> cA(u)*.
% 0.19/0.45  11[0:Inp] || equal(u,ib)+ -> cA_and_B(u)*.
% 0.19/0.45  12[0:Inp] || equal(u,ia)+ -> cA_and_B(u)*.
% 0.19/0.45  13[0:Inp] cB(u) ||  -> equal(u,ib)*.
% 0.19/0.45  14[0:Inp] || equal(u,ib)+ -> cB(u)*.
% 0.19/0.45  15[0:Inp] cA_and_B(u) ||  -> equal(u,ia) equal(u,ib)*.
% 0.19/0.45  16[0:Inp] || cowlThing(skc4) SkC0 -> cA_and_B(skc6) cB(skc6) cA(skc6) cowlNothing(skc5)*.
% 0.19/0.45  17[0:Inp] || cB(skc6) cA_and_B(skc6) cowlThing(skc4) SkC0 -> cowlNothing(skc5)*.
% 0.19/0.45  18[0:Inp] || cA(skc6) cA_and_B(skc6) cowlThing(skc4) SkC0 -> cowlNothing(skc5)*.
% 0.19/0.45  19[0:MRR:7.0,5.1] ||  -> SkC0 xsd_integer(skc7)*.
% 0.19/0.45  20[0:MRR:6.0,19.0] ||  -> SkC0 xsd_string(skc7)*.
% 0.19/0.45  21[0:MRR:18.2,18.4,1.0,4.0] || SkC0 cA_and_B(skc6)+ cA(skc6)* -> .
% 0.19/0.45  22[0:MRR:17.2,17.4,1.0,4.0] || SkC0 cA_and_B(skc6)* cB(skc6) -> .
% 0.19/0.45  23[0:MRR:16.0,16.5,1.0,4.0] || SkC0 -> cA(skc6)* cB(skc6) cA_and_B(skc6).
% 0.19/0.45  24[1:Spt:21.0] || SkC0*+ -> .
% 0.19/0.45  25[1:MRR:19.0,24.0] ||  -> xsd_integer(skc7)*.
% 0.19/0.45  26[1:MRR:20.0,24.0] ||  -> xsd_string(skc7)*.
% 0.19/0.45  28[1:EmS:8.0,8.1,25.0,26.0] ||  -> .
% 0.19/0.45  29[1:Spt:28.0,21.0,24.0] ||  -> SkC0*.
% 0.19/0.45  30[1:Spt:28.0,21.1,21.2] || cA_and_B(skc6)+ cA(skc6)* -> .
% 0.19/0.45  31[1:MRR:22.0,29.0] || cA_and_B(skc6)*+ cB(skc6) -> .
% 0.19/0.45  32[1:MRR:23.0,29.0] ||  -> cA(skc6)* cB(skc6) cA_and_B(skc6).
% 0.19/0.45  33[2:Spt:31.0] || cA_and_B(skc6)*+ -> .
% 0.19/0.45  34[2:MRR:32.2,33.0] ||  -> cA(skc6)* cB(skc6).
% 0.19/0.45  35[2:EmS:9.0,34.0] ||  -> equal(skc6,ia) cB(skc6)*.
% 0.19/0.45  38[3:Spt:35.0] ||  -> equal(skc6,ia)**.
% 0.19/0.45  39[3:Rew:38.0,33.0] || cA_and_B(ia)*+ -> .
% 0.19/0.45  44[0:EqR:14.0] ||  -> cB(ib)*.
% 0.19/0.45  47[0:EqR:10.0] ||  -> cA(ia)*.
% 0.19/0.45  49[0:EqR:12.0] ||  -> cA_and_B(ia)*.
% 0.19/0.45  50[3:MRR:49.0,39.0] ||  -> .
% 0.19/0.45  51[3:Spt:50.0,35.0,38.0] || equal(skc6,ia)** -> .
% 0.19/0.45  52[3:Spt:50.0,35.1] ||  -> cB(skc6)*.
% 0.19/0.45  53[3:EmS:13.0,52.0] ||  -> equal(skc6,ib)**.
% 0.19/0.45  55[3:Rew:53.0,33.0] || cA_and_B(ib)*+ -> .
% 0.19/0.45  58[0:EqR:11.0] ||  -> cA_and_B(ib)*.
% 0.19/0.45  59[3:MRR:58.0,55.0] ||  -> .
% 0.19/0.45  60[2:Spt:59.0,31.0,33.0] ||  -> cA_and_B(skc6)*.
% 0.19/0.45  61[2:Spt:59.0,31.1] || cB(skc6)*+ -> .
% 0.19/0.45  62[2:MRR:30.0,60.0] || cA(skc6)*+ -> .
% 0.19/0.45  63[2:EmS:15.0,60.0] ||  -> equal(skc6,ia) equal(skc6,ib)**.
% 0.19/0.45  68[3:Spt:63.0] ||  -> equal(skc6,ia)**.
% 0.19/0.45  71[3:Rew:68.0,62.0] || cA(ia)* -> .
% 0.19/0.45  72[3:MRR:71.0,47.0] ||  -> .
% 0.19/0.45  73[3:Spt:72.0,63.0,68.0] || equal(skc6,ia)** -> .
% 0.19/0.45  74[3:Spt:72.0,63.1] ||  -> equal(skc6,ib)**.
% 0.19/0.45  77[3:Rew:74.0,61.0] || cB(ib)* -> .
% 0.19/0.45  78[3:MRR:77.0,44.0] ||  -> .
% 0.19/0.45  % SZS output end Refutation
% 0.19/0.45  Formulae used in the proof : axiom_0 axiom_1 the_axiom axiom_2 axiom_3 axiom_4
% 0.19/0.45  
%------------------------------------------------------------------------------