TSTP Solution File: KRS082+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:30 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 18:26:50 EDT 2022
% 0.13/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 67 clauses.
% 0.18/0.45 SPASS allocated 97878 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.01 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 6, length 24 :
% 0.18/0.45 % SZS output start Refutation
% 0.18/0.45 2[0:Inp] || -> cUnsatisfiable(i2003_11_14_17_19_28752)*.
% 0.18/0.45 10[0:Inp] || -> rp(skf8(u),skf9(u))*l.
% 0.18/0.45 11[0:Inp] cUnsatisfiable(u) || -> ca(u)*.
% 0.18/0.45 16[0:Inp] cUnsatisfiable(u) || -> rs(u,skf8(u))*.
% 0.18/0.45 18[0:Inp] || rp(u,v) -> rinvP(v,u)*.
% 0.18/0.45 20[0:Inp] || rr(u,v) -> rinvR(v,u)*.
% 0.18/0.45 22[0:Inp] || rs(u,v) -> rinvS(v,u)*.
% 0.18/0.45 26[0:Inp] cUnsatisfiable(u) || rp(skf8(u),v)*+ -> rr(v,skf10(v))*.
% 0.18/0.45 28[0:Inp] cUnsatisfiable(u) || rr(v,w)* rp(skf8(u),v)*+ -> cc(w).
% 0.18/0.45 29[0:Inp] ca(u) cc(v) || rinvR(v,w)*+ rinvS(x,u)* rinvP(w,x)* -> .
% 0.18/0.45 47[0:Res:10.0,26.1] cUnsatisfiable(u) || -> rr(skf9(u),skf10(skf9(u)))*.
% 0.18/0.45 52[0:Res:20.1,29.2] ca(u) cc(v) || rr(w,v)*+ rinvS(x,u)* rinvP(w,x)* -> .
% 0.18/0.45 55[0:Res:47.1,52.2] cUnsatisfiable(u) ca(v) cc(skf10(skf9(u))) || rinvS(w,v)* rinvP(skf9(u),w)* -> .
% 0.18/0.45 57[0:Res:10.0,28.2] cUnsatisfiable(u) || rr(skf9(u),v)* -> cc(v).
% 0.18/0.45 60[0:Res:47.1,57.1] cUnsatisfiable(u) cUnsatisfiable(u) || -> cc(skf10(skf9(u)))*.
% 0.18/0.45 61[0:Obv:60.0] cUnsatisfiable(u) || -> cc(skf10(skf9(u)))*.
% 0.18/0.45 62[0:MRR:55.2,61.1] cUnsatisfiable(u) ca(v) || rinvS(w,v)* rinvP(skf9(u),w)*+ -> .
% 0.18/0.45 64[0:Res:18.1,62.3] cUnsatisfiable(u) ca(v) || rp(w,skf9(u))*+ rinvS(w,v)* -> .
% 0.18/0.45 95[0:Res:10.0,64.2] cUnsatisfiable(u) ca(v) || rinvS(skf8(u),v)* -> .
% 0.18/0.45 97[0:Res:22.1,95.2] cUnsatisfiable(u) ca(v) || rs(v,skf8(u))* -> .
% 0.18/0.45 98[0:Res:16.1,97.2] cUnsatisfiable(u) cUnsatisfiable(u) ca(u) || -> .
% 0.18/0.45 99[0:Obv:98.0] cUnsatisfiable(u) ca(u) || -> .
% 0.18/0.45 100[0:SSi:99.1,11.1] cUnsatisfiable(u) || -> .
% 0.18/0.45 101[0:UnC:100.0,2.0] || -> .
% 0.18/0.45 % SZS output end Refutation
% 0.18/0.45 Formulae used in the proof : axiom_9 axiom_2 axiom_5 axiom_0 axiom_3 axiom_6 axiom_7 axiom_4
% 0.18/0.45
%------------------------------------------------------------------------------