%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS256+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:59 EDT 2022
% Result : Theorem 1.35s 1.55s
% Output : Refutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 6 unt; 2 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 10 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; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(8,axiom,
model(skc75,skc72),
file('KRS256+1.p',unknown),
[] ).
cnf(9,axiom,
~ mighta(esa,thm),
file('KRS256+1.p',unknown),
[] ).
cnf(32,axiom,
( model(skf61(u,v),v)
| status__dfg(v,u,thm) ),
file('KRS256+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ model(skf61(u,v),u)
| status__dfg(w,u,thm) ),
file('KRS256+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ model(u,v)
| ~ model(w,x)
| status__dfg(x,v,esa) ),
file('KRS256+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ status__dfg(u,v,w)
| ~ status__dfg(u,v,x)
| mighta(x,w) ),
file('KRS256+1.p',unknown),
[] ).
cnf(112,plain,
( ~ status__dfg(u,v,thm)
| ~ status__dfg(u,v,esa) ),
inference(res,[status(thm),theory(equality)],[92,9]),
[iquote('0:Res:92.2,9.0')] ).
cnf(341,plain,
( status__dfg(u,u,thm)
| status__dfg(v,u,thm) ),
inference(res,[status(thm),theory(equality)],[32,50]),
[iquote('0:Res:32.0,50.0')] ).
cnf(342,plain,
status__dfg(u,u,thm),
inference(con,[status(thm)],[341]),
[iquote('0:Con:341.1')] ).
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(5240,plain,
status__dfg(skc72,skc72,esa),
inference(res,[status(thm),theory(equality)],[8,1141]),
[iquote('0:Res:8.0,1141.0')] ).
cnf(5314,plain,
~ status__dfg(skc72,skc72,thm),
inference(res,[status(thm),theory(equality)],[5240,112]),
[iquote('0:Res:5240.0,112.1')] ).
cnf(5320,plain,
$false,
inference(mrr,[status(thm)],[5314,342]),
[iquote('0:MRR:5314.0,342.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS256+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.14/0.33 % Computer : n022.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue Jun 7 19:29:05 EDT 2022
% 0.14/0.33 % CPUTime :
% 1.35/1.55
% 1.35/1.55 SPASS V 3.9
% 1.35/1.55 SPASS beiseite: Proof found.
% 1.35/1.55 % SZS status Theorem
% 1.35/1.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.35/1.55 SPASS derived 5098 clauses, backtracked 55 clauses, performed 39 splits and kept 2714 clauses.
% 1.35/1.55 SPASS allocated 88653 KBytes.
% 1.35/1.55 SPASS spent 0:00:01.18 on the problem.
% 1.35/1.55 0:00:00.04 for the input.
% 1.35/1.55 0:00:00.21 for the FLOTTER CNF translation.
% 1.35/1.55 0:00:00.03 for inferences.
% 1.35/1.55 0:00:00.01 for the backtracking.
% 1.35/1.55 0:00:00.84 for the reduction.
% 1.35/1.55
% 1.35/1.55
% 1.35/1.55 Here is a proof with depth 3, length 13 :
% 1.35/1.55 % SZS output start Refutation
% See solution above
% 1.35/1.55 Formulae used in the proof : non_thm_spt mighta_esa_thm thm esa mighta
% 1.35/1.55
%------------------------------------------------------------------------------