TSTP Solution File: KRS201+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS201+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 7 unt; 3 nHn; 14 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 : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(8,axiom,
model(skc75,skc72),
file('KRS201+1.p',unknown),
[] ).
cnf(9,axiom,
~ nota(sap,thm),
file('KRS201+1.p',unknown),
[] ).
cnf(14,axiom,
~ model(skc73,skc72),
file('KRS201+1.p',unknown),
[] ).
cnf(18,axiom,
( model(u,v)
| model(u,not__dfg(v)) ),
file('KRS201+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ model(u,v)
| status__dfg(w,v,sap) ),
file('KRS201+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ model(u,v)
| ~ status__dfg(v,w,thm)
| model(u,w) ),
file('KRS201+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ status__dfg(u,v,w)
| nota(w,x)
| status__dfg(u,v,x) ),
file('KRS201+1.p',unknown),
[] ).
cnf(112,plain,
( ~ status__dfg(u,v,sap)
| status__dfg(u,v,thm) ),
inference(res,[status(thm),theory(equality)],[82,9]),
[iquote('0:Res:82.2,9.0')] ).
cnf(115,plain,
status__dfg(u,skc72,sap),
inference(res,[status(thm),theory(equality)],[8,23]),
[iquote('0:Res:8.0,23.0')] ).
cnf(251,plain,
status__dfg(u,skc72,thm),
inference(res,[status(thm),theory(equality)],[115,112]),
[iquote('0:Res:115.0,112.0')] ).
cnf(1104,plain,
( ~ model(u,v)
| model(u,skc72) ),
inference(res,[status(thm),theory(equality)],[251,71]),
[iquote('0:Res:251.0,71.1')] ).
cnf(1219,plain,
( model(u,v)
| model(u,skc72) ),
inference(res,[status(thm),theory(equality)],[18,1104]),
[iquote('0:Res:18.1,1104.0')] ).
cnf(1275,plain,
model(u,skc72),
inference(con,[status(thm)],[1219]),
[iquote('0:Con:1219.0')] ).
cnf(1276,plain,
$false,
inference(unc,[status(thm)],[1275,14]),
[iquote('0:UnC:1275.0,14.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS201+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 11:33:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.59/0.76
% 0.59/0.76 SPASS V 3.9
% 0.59/0.76 SPASS beiseite: Proof found.
% 0.59/0.76 % SZS status Theorem
% 0.59/0.76 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.59/0.76 SPASS derived 1145 clauses, backtracked 7 clauses, performed 8 splits and kept 986 clauses.
% 0.59/0.76 SPASS allocated 87719 KBytes.
% 0.59/0.76 SPASS spent 0:00:00.41 on the problem.
% 0.59/0.76 0:00:00.04 for the input.
% 0.59/0.76 0:00:00.19 for the FLOTTER CNF translation.
% 0.59/0.76 0:00:00.01 for inferences.
% 0.59/0.76 0:00:00.00 for the backtracking.
% 0.59/0.76 0:00:00.15 for the reduction.
% 0.59/0.76
% 0.59/0.76
% 0.59/0.76 Here is a proof with depth 4, length 14 :
% 0.59/0.76 % SZS output start Refutation
% See solution above
% 0.59/0.76 Formulae used in the proof : non_thm_spt nota_sap_thm not__dfg sap thm nota
% 0.59/0.76
%------------------------------------------------------------------------------