TSTP Solution File: KRS202+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS202+1 : TPTP v8.1.0. Bugfixed v5.4.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:52 EDT 2022
% Result : Theorem 1.64s 1.81s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 1 nHn; 14 RR)
% Number of literals : 23 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
model(u,skc57),
file('KRS202+1.p',unknown),
[] ).
cnf(8,axiom,
model(skc75,skc72),
file('KRS202+1.p',unknown),
[] ).
cnf(9,axiom,
~ nota(esa,thm),
file('KRS202+1.p',unknown),
[] ).
cnf(14,axiom,
~ model(skc73,skc72),
file('KRS202+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ model(u,v)
| ~ model(w,x)
| status__dfg(x,v,esa) ),
file('KRS202+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ model(u,v)
| ~ status__dfg(v,w,thm)
| model(u,w) ),
file('KRS202+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ status__dfg(u,v,w)
| nota(w,x)
| status__dfg(u,v,x) ),
file('KRS202+1.p',unknown),
[] ).
cnf(112,plain,
( ~ status__dfg(u,v,esa)
| status__dfg(u,v,thm) ),
inference(res,[status(thm),theory(equality)],[82,9]),
[iquote('0:Res:82.2,9.0')] ).
cnf(1141,plain,
( ~ model(u,v)
| status__dfg(v,skc72,esa) ),
inference(res,[status(thm),theory(equality)],[8,69]),
[iquote('0:Res:8.0,69.0')] ).
cnf(5228,plain,
status__dfg(skc57,skc72,esa),
inference(res,[status(thm),theory(equality)],[1,1141]),
[iquote('0:Res:1.0,1141.0')] ).
cnf(5419,plain,
status__dfg(skc57,skc72,thm),
inference(res,[status(thm),theory(equality)],[5228,112]),
[iquote('0:Res:5228.0,112.0')] ).
cnf(5821,plain,
( ~ model(u,skc57)
| model(u,skc72) ),
inference(res,[status(thm),theory(equality)],[5419,71]),
[iquote('0:Res:5419.0,71.1')] ).
cnf(5827,plain,
model(u,skc72),
inference(mrr,[status(thm)],[5821,1]),
[iquote('0:MRR:5821.0,1.0')] ).
cnf(5828,plain,
$false,
inference(unc,[status(thm)],[5827,14]),
[iquote('0:UnC:5827.0,14.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS202+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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 06:48:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.81
% 1.64/1.81 SPASS V 3.9
% 1.64/1.81 SPASS beiseite: Proof found.
% 1.64/1.81 % SZS status Theorem
% 1.64/1.81 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.64/1.81 SPASS derived 5578 clauses, backtracked 248 clauses, performed 61 splits and kept 3325 clauses.
% 1.64/1.81 SPASS allocated 88906 KBytes.
% 1.64/1.81 SPASS spent 0:00:01.44 on the problem.
% 1.64/1.81 0:00:00.04 for the input.
% 1.64/1.81 0:00:00.21 for the FLOTTER CNF translation.
% 1.64/1.81 0:00:00.04 for inferences.
% 1.64/1.81 0:00:00.02 for the backtracking.
% 1.64/1.81 0:00:01.08 for the reduction.
% 1.64/1.81
% 1.64/1.81
% 1.64/1.81 Here is a proof with depth 4, length 14 :
% 1.64/1.81 % SZS output start Refutation
% See solution above
% 1.64/1.81 Formulae used in the proof : tautology non_thm_spt nota_esa_thm esa thm nota
% 1.64/1.81
%------------------------------------------------------------------------------