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

View Problem - Process Solution

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

% Computer : n032.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:36 EDT 2022

% Result   : Unsatisfiable 0.13s 0.46s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : KRS116+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.10  % Command  : run_spass %d %s
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Tue Jun  7 17:33:36 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.13/0.46  
% 0.13/0.46  SPASS V 3.9 
% 0.13/0.46  SPASS beiseite: Proof found.
% 0.13/0.46  % SZS status Theorem
% 0.13/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.13/0.46  SPASS derived 278 clauses, backtracked 39 clauses, performed 1 splits and kept 215 clauses.
% 0.13/0.46  SPASS allocated 99152 KBytes.
% 0.13/0.46  SPASS spent	0:00:00.15 on the problem.
% 0.13/0.46  		0:00:00.03 for the input.
% 0.13/0.46  		0:00:00.09 for the FLOTTER CNF translation.
% 0.13/0.46  		0:00:00.00 for inferences.
% 0.13/0.46  		0:00:00.00 for the backtracking.
% 0.13/0.46  		0:00:00.01 for the reduction.
% 0.13/0.46  
% 0.13/0.46  
% 0.13/0.46  Here is a proof with depth 6, length 43 :
% 0.13/0.46  % SZS output start Refutation
% 0.13/0.46  2[0:Inp] ||  -> cUnsatisfiable(i2003_11_14_17_21_33997)*.
% 0.13/0.46  4[0:Inp] ||  -> ca_Ax2(skf15(u))*.
% 0.13/0.46  13[0:Inp] cUnsatisfiable(u) ||  -> ca(u)*.
% 0.13/0.46  14[0:Inp] ca_Ax2(u) ||  -> SkP0(u)*.
% 0.13/0.46  15[0:Inp] ca_Ax2(u) ||  -> SkP1(u)*.
% 0.13/0.46  28[0:Inp] cUnsatisfiable(u) ||  -> rs(u,skf15(u))*.
% 0.13/0.46  29[0:Inp] ca(u) || ra_Px1(u,v)* -> .
% 0.13/0.46  30[0:Inp] caxcomp(u) ||  -> ra_Px1(u,skf17(u))*.
% 0.13/0.46  32[0:Inp] ca_Ax2(u) ||  -> rp(u,skf20(u))*r.
% 0.13/0.46  33[0:Inp] ca_Vx3(u) ||  -> rr(u,skf25(u))*.
% 0.13/0.46  36[0:Inp] || rp(u,v) -> rinvP(v,u)*.
% 0.13/0.46  38[0:Inp] || rr(u,v)* -> rinvR(v,u).
% 0.13/0.46  40[0:Inp] || rs(u,v) -> rinvS(v,u)*.
% 0.13/0.46  41[0:Inp] cc(u) || rinvR(u,v)* -> ca_Vx7(v).
% 0.13/0.46  43[0:Inp] ca_Ax2(u) || rp(u,v)*+ -> ca_Vx4(v)*.
% 0.13/0.46  44[0:Inp] SkP0(u) || rp(u,v)*+ -> ca_Vx3(v)*.
% 0.13/0.46  45[0:Inp] SkP1(u) || rp(u,v)*+ -> ca_Vx5(v)*.
% 0.13/0.46  48[0:Inp] ca_Vx5(u) || rr(u,v)* -> cc(v).
% 0.13/0.46  49[0:Inp] ca_Vx6(u) || rinvS(u,v)* -> caxcomp(v).
% 0.13/0.46  50[0:Inp] ca_Vx7(u) || rinvP(u,v)* -> ca_Vx6(v).
% 0.13/0.46  110[0:Res:30.1,29.1] caxcomp(u) ca(u) ||  -> .
% 0.13/0.46  116[0:Res:33.1,38.0] ca_Vx3(u) ||  -> rinvR(skf25(u),u)*.
% 0.13/0.46  126[0:Res:40.1,49.1] ca_Vx6(u) || rs(v,u)* -> caxcomp(v).
% 0.13/0.46  129[0:Res:116.1,41.1] ca_Vx3(u) cc(skf25(u)) ||  -> ca_Vx7(u)*.
% 0.13/0.46  132[0:Res:33.1,48.1] ca_Vx3(u) ca_Vx5(u) ||  -> cc(skf25(u))*.
% 0.13/0.46  135[0:SoR:129.1,132.2] ca_Vx3(u) ca_Vx5(u) ca_Vx3(u) ||  -> ca_Vx7(u)*.
% 0.13/0.46  136[0:Obv:135.0] ca_Vx5(u) ca_Vx3(u) ||  -> ca_Vx7(u)*.
% 0.13/0.46  158[0:Res:28.1,126.1] cUnsatisfiable(u) ca_Vx6(skf15(u)) ||  -> caxcomp(u)*.
% 0.13/0.46  189[0:Res:36.1,50.1] ca_Vx7(u) || rp(v,u)*+ -> ca_Vx6(v)*.
% 0.13/0.46  214[0:Res:32.1,44.1] ca_Ax2(u) SkP0(u) ||  -> ca_Vx3(skf20(u))*.
% 0.13/0.46  221[0:SSi:214.1,14.1] ca_Ax2(u) ||  -> ca_Vx3(skf20(u))*.
% 0.13/0.46  228[0:Res:32.1,43.1] ca_Ax2(u) ca_Ax2(u) ||  -> ca_Vx4(skf20(u))*.
% 0.13/0.46  235[0:Obv:228.0] ca_Ax2(u) ||  -> ca_Vx4(skf20(u))*.
% 0.13/0.46  259[0:Res:32.1,189.1] ca_Ax2(u) ca_Vx7(skf20(u)) ||  -> ca_Vx6(u)*.
% 0.13/0.46  351[0:Res:32.1,45.1] ca_Ax2(u) SkP1(u) ||  -> ca_Vx5(skf20(u))*.
% 0.13/0.46  359[0:SSi:351.1,15.1] ca_Ax2(u) ||  -> ca_Vx5(skf20(u))*.
% 0.13/0.46  382[0:SoR:259.1,136.2] ca_Ax2(u) ca_Vx3(skf20(u)) ca_Vx5(skf20(u)) ||  -> ca_Vx6(u)*.
% 0.13/0.46  384[0:SSi:382.2,382.1,221.1,235.1,359.1,221.1,235.1,359.1] ca_Ax2(u) ||  -> ca_Vx6(u)*.
% 0.13/0.46  400[0:SoR:158.1,384.1] cUnsatisfiable(u) ca_Ax2(skf15(u)) ||  -> caxcomp(u)*.
% 0.13/0.46  401[0:SSi:400.1,4.0] cUnsatisfiable(u) ||  -> caxcomp(u)*.
% 0.13/0.46  403[0:EmS:110.0,110.1,401.1,13.1] cUnsatisfiable(u) cUnsatisfiable(u) ||  -> .
% 0.13/0.46  405[0:Obv:403.0] cUnsatisfiable(u) ||  -> .
% 0.13/0.46  406[0:UnC:405.0,2.0] ||  -> .
% 0.13/0.46  % SZS output end Refutation
% 0.13/0.46  Formulae used in the proof : axiom_17 axiom_3 axiom_2 axiom_7 axiom_0 axiom_4 axiom_5 axiom_8 axiom_13 axiom_14 axiom_15 axiom_6 axiom_12 axiom_11 axiom_10
% 0.13/0.46  
%------------------------------------------------------------------------------