TSTP Solution File: KRS200+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS200+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 0.46s 0.63s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 5 unt; 4 nHn; 13 RR)
% Number of literals : 23 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
~ nota(unp,thm),
file('KRS200+1.p',unknown),
[] ).
cnf(11,axiom,
~ model(u,skc61),
file('KRS200+1.p',unknown),
[] ).
cnf(18,axiom,
( model(u,v)
| model(u,not__dfg(v)) ),
file('KRS200+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ model(u,v)
| status__dfg(v,w,unp) ),
file('KRS200+1.p',unknown),
[] ).
cnf(32,axiom,
( model(skf61(u,v),v)
| status__dfg(v,u,thm) ),
file('KRS200+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ model(u,v)
| ~ status__dfg(v,w,thm)
| model(u,w) ),
file('KRS200+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ status__dfg(u,v,w)
| nota(w,x)
| status__dfg(u,v,x) ),
file('KRS200+1.p',unknown),
[] ).
cnf(112,plain,
( ~ status__dfg(u,v,unp)
| status__dfg(u,v,thm) ),
inference(res,[status(thm),theory(equality)],[82,9]),
[iquote('0:Res:82.2,9.0')] ).
cnf(191,plain,
( status__dfg(u,v,thm)
| status__dfg(u,w,unp) ),
inference(res,[status(thm),theory(equality)],[32,20]),
[iquote('0:Res:32.0,20.0')] ).
cnf(195,plain,
status__dfg(u,v,thm),
inference(mrr,[status(thm)],[112,191]),
[iquote('0:MRR:112.0,191.1')] ).
cnf(196,plain,
( ~ model(u,v)
| model(u,w) ),
inference(mrr,[status(thm)],[71,195]),
[iquote('0:MRR:71.1,195.0')] ).
cnf(198,plain,
model(u,v),
inference(mrr,[status(thm)],[18,196]),
[iquote('0:MRR:18.1,196.0')] ).
cnf(217,plain,
$false,
inference(unc,[status(thm)],[198,11]),
[iquote('0:UnC:198.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS200+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/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 14:16:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/0.63
% 0.46/0.63 SPASS V 3.9
% 0.46/0.63 SPASS beiseite: Proof found.
% 0.46/0.63 % SZS status Theorem
% 0.46/0.63 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.63 SPASS derived 111 clauses, backtracked 0 clauses, performed 0 splits and kept 196 clauses.
% 0.46/0.63 SPASS allocated 87718 KBytes.
% 0.46/0.63 SPASS spent 0:00:00.28 on the problem.
% 0.46/0.63 0:00:00.04 for the input.
% 0.46/0.63 0:00:00.19 for the FLOTTER CNF translation.
% 0.46/0.63 0:00:00.00 for inferences.
% 0.46/0.63 0:00:00.00 for the backtracking.
% 0.46/0.63 0:00:00.02 for the reduction.
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Here is a proof with depth 1, length 13 :
% 0.46/0.63 % SZS output start Refutation
% See solution above
% 0.46/0.63 Formulae used in the proof : nota_unp_thm contradiction not__dfg unp thm nota
% 0.46/0.63
%------------------------------------------------------------------------------