TSTP Solution File: KRS107+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:34 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 25 ( 5 unt; 0 nHn; 25 RR)
% Number of literals : 53 ( 0 equ; 32 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_01226),
file('KRS107+1.p',unknown),
[] ).
cnf(4,axiom,
cc2(skf6(u)),
file('KRS107+1.p',unknown),
[] ).
cnf(5,axiom,
cc1(skf5(u)),
file('KRS107+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cUnsatisfiable(u)
| ca_Cx1(u) ),
file('KRS107+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cUnsatisfiable(u)
| rrx3(u,skf5(u)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cUnsatisfiable(u)
| rrx4(u,skf6(u)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ ca_Cx1(u)
| ra_Px1(u,skf7(u)) ),
file('KRS107+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ ca_Cx1xcomp(u)
| ~ ra_Px1(u,v) ),
file('KRS107+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ rrx4(u,v)
| rrx(u,v) ),
file('KRS107+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ rrx3(u,v)
| rrx(u,v) ),
file('KRS107+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ cc1(u)
| ~ cc2(u)
| ca_Ax2(u) ),
file('KRS107+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ ca_Ax2(u)
| ~ rrx3(v,u)
| ca_Cx1xcomp(v) ),
file('KRS107+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ rrx(u,v)
| ~ rrx(u,w)
| equal(w,v) ),
file('KRS107+1.p',unknown),
[] ).
cnf(49,plain,
( ~ rrx3(u,v)
| ~ rrx(u,w)
| equal(w,v) ),
inference(res,[status(thm),theory(equality)],[26,29]),
[iquote('0:Res:26.1,29.0')] ).
cnf(55,plain,
( ~ cUnsatisfiable(u)
| ~ rrx(u,v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[14,49]),
[iquote('0:Res:14.1,49.0')] ).
cnf(57,plain,
( ~ cUnsatisfiable(u)
| ~ rrx4(u,v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[23,55]),
[iquote('0:Res:23.1,55.1')] ).
cnf(59,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[15,57]),
[iquote('0:Res:15.1,57.1')] ).
cnf(60,plain,
( ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[59]),
[iquote('0:Obv:59.0')] ).
cnf(66,plain,
( ~ cUnsatisfiable(u)
| cc2(skf5(u)) ),
inference(spr,[status(thm),theory(equality)],[60,4]),
[iquote('0:SpR:60.1,4.0')] ).
cnf(77,plain,
( ~ ca_Cx1(u)
| ~ ca_Cx1xcomp(u) ),
inference(res,[status(thm),theory(equality)],[16,18]),
[iquote('0:Res:16.1,18.1')] ).
cnf(79,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf5(u))
| ca_Cx1xcomp(u) ),
inference(res,[status(thm),theory(equality)],[14,28]),
[iquote('0:Res:14.1,28.1')] ).
cnf(81,plain,
( ~ cUnsatisfiable(u)
| ca_Cx1xcomp(u) ),
inference(ssi,[status(thm)],[79,27,5,66]),
[iquote('0:SSi:79.1,27.1,5.0,66.2')] ).
cnf(83,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[77,7,81]),
[iquote('0:EmS:77.0,77.1,7.1,81.1')] ).
cnf(84,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[83]),
[iquote('0:Obv:83.0')] ).
cnf(85,plain,
$false,
inference(unc,[status(thm)],[84,2]),
[iquote('0:UnC:84.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 10:00:19 EDT 2022
% 0.12/0.33 % 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 43 clauses, backtracked 12 clauses, performed 1 splits and kept 71 clauses.
% 0.19/0.45 SPASS allocated 97890 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.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 5, length 25 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : axiom_12 axiom_2 axiom_4 axiom_6 axiom_17 axiom_20 axiom_3 axiom_5 axiom_7
% 0.19/0.45
%------------------------------------------------------------------------------