TSTP Solution File: KRS109+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS109+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:35 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 31 ( 5 unt; 0 nHn; 31 RR)
% Number of literals : 66 ( 0 equ; 39 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_21_08508),
file('KRS109+1.p',unknown),
[] ).
cnf(4,axiom,
ca_Ax2(skf6(u)),
file('KRS109+1.p',unknown),
[] ).
cnf(5,axiom,
cp(skf11(u)),
file('KRS109+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cUnsatisfiable(u)
| cpxcomp(u) ),
file('KRS109+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rf(u,skf6(u)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cp(u)
| ~ ra_Px1(u,v) ),
file('KRS109+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cpxcomp(u)
| ra_Px1(u,skf8(u)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ ca_Vx3(u)
| rs(u,skf11(u)) ),
file('KRS109+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ rf(u,v)
| rinvF(v,u) ),
file('KRS109+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ rs(u,v)
| rinvS(v,u) ),
file('KRS109+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ rs(u,v)
| rf(u,v) ),
file('KRS109+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ ca_Ax2(u)
| ~ rinvS(u,v)
| cp(v) ),
file('KRS109+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ ca_Ax2(u)
| ~ rinvF(u,v)
| ca_Vx3(v) ),
file('KRS109+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS109+1.p',unknown),
[] ).
cnf(36,plain,
( ~ cpxcomp(u)
| ~ cp(u) ),
inference(res,[status(thm),theory(equality)],[14,13]),
[iquote('0:Res:14.1,13.1')] ).
cnf(40,plain,
( ~ ca_Vx3(u)
| rinvS(skf11(u),u) ),
inference(res,[status(thm),theory(equality)],[15,21]),
[iquote('0:Res:15.1,21.0')] ).
cnf(42,plain,
( ~ ca_Vx3(u)
| rf(u,skf11(u)) ),
inference(res,[status(thm),theory(equality)],[15,22]),
[iquote('0:Res:15.1,22.0')] ).
cnf(46,plain,
( ~ ca_Ax2(u)
| ~ rf(v,u)
| ca_Vx3(v) ),
inference(res,[status(thm),theory(equality)],[17,25]),
[iquote('0:Res:17.1,25.1')] ).
cnf(50,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf6(u))
| ca_Vx3(u) ),
inference(res,[status(thm),theory(equality)],[12,46]),
[iquote('0:Res:12.1,46.1')] ).
cnf(52,plain,
( ~ cUnsatisfiable(u)
| ca_Vx3(u) ),
inference(ssi,[status(thm)],[50,4]),
[iquote('0:SSi:50.1,4.0')] ).
cnf(62,plain,
( ~ cUnsatisfiable(u)
| ~ rf(u,v)
| equal(v,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[12,29]),
[iquote('0:Res:12.1,29.0')] ).
cnf(66,plain,
( ~ ca_Vx3(u)
| ~ cUnsatisfiable(u)
| equal(skf11(u),skf6(u)) ),
inference(res,[status(thm),theory(equality)],[42,62]),
[iquote('0:Res:42.1,62.1')] ).
cnf(68,plain,
( ~ cUnsatisfiable(u)
| equal(skf11(u),skf6(u)) ),
inference(ssi,[status(thm)],[66,52]),
[iquote('0:SSi:66.0,52.1')] ).
cnf(71,plain,
( ~ cUnsatisfiable(u)
| cp(skf6(u)) ),
inference(spr,[status(thm),theory(equality)],[68,5]),
[iquote('0:SpR:68.1,5.0')] ).
cnf(73,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Vx3(u)
| rinvS(skf6(u),u) ),
inference(spr,[status(thm),theory(equality)],[68,40]),
[iquote('0:SpR:68.1,40.1')] ).
cnf(77,plain,
( ~ cUnsatisfiable(u)
| rinvS(skf6(u),u) ),
inference(ssi,[status(thm)],[73,52]),
[iquote('0:SSi:73.1,52.1')] ).
cnf(88,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf6(u))
| cp(u) ),
inference(res,[status(thm),theory(equality)],[77,24]),
[iquote('0:Res:77.1,24.1')] ).
cnf(90,plain,
( ~ cUnsatisfiable(u)
| cp(u) ),
inference(ssi,[status(thm)],[88,4,71]),
[iquote('0:SSi:88.1,4.1,71.0')] ).
cnf(91,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[36,8,90]),
[iquote('0:EmS:36.0,36.1,8.1,90.1')] ).
cnf(94,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[91]),
[iquote('0:Obv:91.0')] ).
cnf(95,plain,
$false,
inference(unc,[status(thm)],[94,2]),
[iquote('0:UnC:94.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS109+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.10 % Command : run_spass %d %s
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Tue Jun 7 13:38:35 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.13/0.38
% 0.13/0.38 SPASS V 3.9
% 0.13/0.38 SPASS beiseite: Proof found.
% 0.13/0.38 % SZS status Theorem
% 0.13/0.38 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 SPASS derived 56 clauses, backtracked 0 clauses, performed 0 splits and kept 63 clauses.
% 0.13/0.38 SPASS allocated 97862 KBytes.
% 0.13/0.38 SPASS spent 0:00:00.08 on the problem.
% 0.13/0.38 0:00:00.03 for the input.
% 0.13/0.38 0:00:00.02 for the FLOTTER CNF translation.
% 0.13/0.38 0:00:00.00 for inferences.
% 0.13/0.38 0:00:00.00 for the backtracking.
% 0.13/0.38 0:00:00.00 for the reduction.
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 Here is a proof with depth 5, length 31 :
% 0.13/0.38 % SZS output start Refutation
% See solution above
% 0.13/0.38 Formulae used in the proof : axiom_13 axiom_2 axiom_9 axiom_6 axiom_5 axiom_3 axiom_4 axiom_11 axiom_14 axiom_7
% 0.13/0.38
%------------------------------------------------------------------------------