%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS255+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:59 EDT 2022
% Result : Theorem 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 4 unt; 3 nHn; 12 RR)
% Number of literals : 21 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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,
~ mighta(sap,thm),
file('KRS255+1.p',unknown),
[] ).
cnf(11,axiom,
~ model(u,skc61),
file('KRS255+1.p',unknown),
[] ).
cnf(18,axiom,
( model(u,v)
| model(u,not__dfg(v)) ),
file('KRS255+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ model(u,v)
| status__dfg(w,v,sap) ),
file('KRS255+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ model(skf61(u,v),u)
| status__dfg(w,u,thm) ),
file('KRS255+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ status__dfg(u,v,w)
| ~ status__dfg(u,v,x)
| mighta(x,w) ),
file('KRS255+1.p',unknown),
[] ).
cnf(112,plain,
( ~ status__dfg(u,v,thm)
| ~ status__dfg(u,v,sap) ),
inference(res,[status(thm),theory(equality)],[92,9]),
[iquote('0:Res:92.2,9.0')] ).
cnf(124,plain,
( model(u,v)
| status__dfg(w,not__dfg(v),sap) ),
inference(res,[status(thm),theory(equality)],[18,23]),
[iquote('0:Res:18.1,23.0')] ).
cnf(339,plain,
( model(skf61(not__dfg(u),v),u)
| status__dfg(w,not__dfg(u),thm) ),
inference(res,[status(thm),theory(equality)],[18,50]),
[iquote('0:Res:18.1,50.0')] ).
cnf(368,plain,
( ~ status__dfg(u,not__dfg(v),thm)
| model(w,v) ),
inference(res,[status(thm),theory(equality)],[124,112]),
[iquote('0:Res:124.1,112.1')] ).
cnf(392,plain,
model(skf61(not__dfg(u),v),u),
inference(mrr,[status(thm)],[339,368]),
[iquote('0:MRR:339.1,368.0')] ).
cnf(393,plain,
$false,
inference(unc,[status(thm)],[392,11]),
[iquote('0:UnC:392.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS255+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 07:10:31 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.47/0.65
% 0.47/0.65 SPASS V 3.9
% 0.47/0.65 SPASS beiseite: Proof found.
% 0.47/0.65 % SZS status Theorem
% 0.47/0.65 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65 SPASS derived 265 clauses, backtracked 0 clauses, performed 1 splits and kept 291 clauses.
% 0.47/0.65 SPASS allocated 87719 KBytes.
% 0.47/0.65 SPASS spent 0:00:00.30 on the problem.
% 0.47/0.65 0:00:00.03 for the input.
% 0.47/0.65 0:00:00.21 for the FLOTTER CNF translation.
% 0.47/0.65 0:00:00.00 for inferences.
% 0.47/0.65 0:00:00.00 for the backtracking.
% 0.47/0.65 0:00:00.02 for the reduction.
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 Here is a proof with depth 2, length 12 :
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.65 Formulae used in the proof : mighta_sap_thm contradiction not__dfg sap thm mighta
% 0.47/0.65
%------------------------------------------------------------------------------