TSTP Solution File: KRS084+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS084+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS084+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 07:32:05 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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 51 clauses, backtracked 0 clauses, performed 0 splits and kept 50 clauses.
% 0.19/0.45 SPASS allocated 97903 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.03 for the input.
% 0.19/0.45 0:00:00.04 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 7, length 25 :
% 0.19/0.45 % SZS output start Refutation
% 0.19/0.45 2[0:Inp] || -> cUnsatisfiable(i2003_11_14_17_19_35232)*.
% 0.19/0.45 4[0:Inp] || -> cd(skf5(u))*.
% 0.19/0.45 5[0:Inp] || -> cd(skf4(u))*.
% 0.19/0.45 7[0:Inp] || cc(skf8(u))* -> .
% 0.19/0.45 8[0:Inp] cd(u) || -> cc(u)*.
% 0.19/0.45 11[0:Inp] cUnsatisfiable(u) || -> rinvF(u,skf4(u))*.
% 0.19/0.45 12[0:Inp] cd(u) || -> rf(u,skf8(u))*.
% 0.19/0.45 13[0:Inp] || rinvF(u,v)* -> rf(v,u).
% 0.19/0.45 16[0:Inp] || rr(u,v) -> rinvR(v,u)*.
% 0.19/0.45 17[0:Inp] || rf(u,v)* -> rr(u,v).
% 0.19/0.45 18[0:Inp] cUnsatisfiable(u) || rinvR(u,v)*+ -> rinvF(v,skf5(v))*.
% 0.19/0.45 20[0:Inp] || rf(u,v)*+ rf(u,w)* -> equal(w,v)*.
% 0.19/0.45 26[0:Res:11.1,13.0] cUnsatisfiable(u) || -> rf(skf4(u),u)*.
% 0.19/0.45 30[0:Res:12.1,20.0] cd(u) || rf(u,v)* -> equal(v,skf8(u)).
% 0.19/0.45 42[0:Res:26.1,17.0] cUnsatisfiable(u) || -> rr(skf4(u),u)*l.
% 0.19/0.45 45[0:Res:16.1,18.1] cUnsatisfiable(u) || rr(v,u)*+ -> rinvF(v,skf5(v))*.
% 0.19/0.45 58[0:Res:42.1,45.1] cUnsatisfiable(u) cUnsatisfiable(u) || -> rinvF(skf4(u),skf5(skf4(u)))*.
% 0.19/0.45 64[0:Obv:58.0] cUnsatisfiable(u) || -> rinvF(skf4(u),skf5(skf4(u)))*.
% 0.19/0.45 68[0:Res:64.1,13.0] cUnsatisfiable(u) || -> rf(skf5(skf4(u)),skf4(u))*.
% 0.19/0.45 73[0:Res:68.1,30.1] cUnsatisfiable(u) cd(skf5(skf4(u))) || -> equal(skf8(skf5(skf4(u))),skf4(u))**.
% 0.19/0.45 76[0:SSi:73.1,4.0,5.0] cUnsatisfiable(u) || -> equal(skf8(skf5(skf4(u))),skf4(u))**.
% 0.19/0.45 81[0:SpL:76.1,7.0] cUnsatisfiable(u) || cc(skf4(u))* -> .
% 0.19/0.45 84[0:Res:8.1,81.1] cd(skf4(u)) cUnsatisfiable(u) || -> .
% 0.19/0.45 85[0:SSi:84.0,5.0] cUnsatisfiable(u) || -> .
% 0.19/0.45 86[0:UnC:85.0,2.0] || -> .
% 0.19/0.45 % SZS output end Refutation
% 0.19/0.45 Formulae used in the proof : axiom_8 axiom_2 axiom_3 axiom_5 axiom_6 axiom_9 axiom_4
% 0.19/0.45
%------------------------------------------------------------------------------