TSTP Solution File: KRS105+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS105+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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.18s 0.42s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 15 ( 4 unt; 2 nHn; 15 RR)
% Number of literals : 28 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_20_53634),
file('KRS105+1.p',unknown),
[] ).
cnf(5,axiom,
~ cc(skf5(u)),
file('KRS105+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ cUnsatisfiable(u)
| cdxcomp(u) ),
file('KRS105+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cUnsatisfiable(u)
| cc(u) ),
file('KRS105+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ca_Ax2(u)
| cd(u) ),
file('KRS105+1.p',unknown),
[] ).
cnf(12,axiom,
( ca_Ax2(u)
| rr(u,skf5(u)) ),
file('KRS105+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cd(u)
| ~ ra_Px1(u,v) ),
file('KRS105+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cdxcomp(u)
| ra_Px1(u,skf4(u)) ),
file('KRS105+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cc(u)
| ~ rr(u,v)
| cc(v) ),
file('KRS105+1.p',unknown),
[] ).
cnf(33,plain,
( ~ cdxcomp(u)
| ~ cd(u) ),
inference(res,[status(thm),theory(equality)],[14,13]),
[iquote('0:Res:14.1,13.1')] ).
cnf(34,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(u) ),
inference(ems,[status(thm)],[33,6,8]),
[iquote('0:EmS:33.0,33.1,6.1,8.1')] ).
cnf(37,plain,
( ~ cc(u)
| ca_Ax2(u)
| cc(skf5(u)) ),
inference(res,[status(thm),theory(equality)],[12,15]),
[iquote('0:Res:12.1,15.1')] ).
cnf(38,plain,
( ~ cc(u)
| ca_Ax2(u) ),
inference(mrr,[status(thm)],[37,5]),
[iquote('0:MRR:37.2,5.0')] ).
cnf(39,plain,
~ cc(i2003_11_14_17_20_53634),
inference(ems,[status(thm)],[34,2,38]),
[iquote('0:EmS:34.0,34.1,2.0,38.1')] ).
cnf(40,plain,
$false,
inference(ssi,[status(thm)],[39,7,2]),
[iquote('0:SSi:39.0,7.0,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS105+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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 17:42:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.42
% 0.18/0.42 SPASS V 3.9
% 0.18/0.42 SPASS beiseite: Proof found.
% 0.18/0.42 % SZS status Theorem
% 0.18/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.42 SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 21 clauses.
% 0.18/0.42 SPASS allocated 97627 KBytes.
% 0.18/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.18/0.42 0:00:00.03 for the input.
% 0.18/0.42 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.42 0:00:00.00 for inferences.
% 0.18/0.42 0:00:00.00 for the backtracking.
% 0.18/0.42 0:00:00.00 for the reduction.
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 Here is a proof with depth 3, length 15 :
% 0.18/0.42 % SZS output start Refutation
% See solution above
% 0.18/0.42 Formulae used in the proof : axiom_9 axiom_7 axiom_8 axiom_2 axiom_6 axiom_5 axiom_3 axiom_4
% 0.18/0.42
%------------------------------------------------------------------------------