%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL525+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:07:41 PM UTC 2026
% Result : Theorem 0.38s 0.68s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 16 unt; 0 nHn; 26 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
op_strict_implies,
file('LCL525+1.p',unknown),
[] ).
cnf(10,axiom,
modus_ponens,
file('LCL525+1.p',unknown),
[] ).
cnf(26,axiom,
necessitation,
file('LCL525+1.p',unknown),
[] ).
cnf(28,axiom,
axiom_M,
file('LCL525+1.p',unknown),
[] ).
cnf(30,axiom,
~ modus_ponens_strict_implies,
file('LCL525+1.p',unknown),
[] ).
cnf(33,axiom,
is_a_theorem(skc151),
file('LCL525+1.p',unknown),
[] ).
cnf(38,axiom,
is_a_theorem(strict_implies(skc151,skc150)),
file('LCL525+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ is_a_theorem(skc150)
| modus_ponens_strict_implies ),
file('LCL525+1.p',unknown),
[] ).
cnf(46,axiom,
( ~ axiom_M
| is_a_theorem(implies__dfg(necessarily(u),u)) ),
file('LCL525+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ is_a_theorem(u)
| ~ necessitation
| is_a_theorem(necessarily(u)) ),
file('LCL525+1.p',unknown),
[] ).
cnf(106,axiom,
( ~ op_strict_implies
| equal(necessarily(implies__dfg(u,v)),strict_implies(u,v)) ),
file('LCL525+1.p',unknown),
[] ).
cnf(108,axiom,
( ~ is_a_theorem(u)
| ~ modus_ponens
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(v) ),
file('LCL525+1.p',unknown),
[] ).
cnf(147,plain,
~ is_a_theorem(skc150),
inference(mrr,[status(thm)],[39,30]),
[iquote('0:MRR:39.1,30.0')] ).
cnf(148,plain,
is_a_theorem(implies__dfg(necessarily(u),u)),
inference(mrr,[status(thm)],[46,28]),
[iquote('0:MRR:46.0,28.0')] ).
cnf(149,plain,
( ~ is_a_theorem(u)
| is_a_theorem(necessarily(u)) ),
inference(mrr,[status(thm)],[68,26]),
[iquote('0:MRR:68.1,26.0')] ).
cnf(159,plain,
equal(necessarily(implies__dfg(u,v)),strict_implies(u,v)),
inference(mrr,[status(thm)],[106,4]),
[iquote('0:MRR:106.0,4.0')] ).
cnf(175,plain,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(v) ),
inference(mrr,[status(thm)],[108,10]),
[iquote('0:MRR:108.1,10.0')] ).
cnf(188,plain,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,skc150)) ),
inference(res,[status(thm),theory(equality)],[175,147]),
[iquote('0:Res:175.2,147.0')] ).
cnf(197,plain,
~ is_a_theorem(necessarily(skc150)),
inference(res,[status(thm),theory(equality)],[148,188]),
[iquote('0:Res:148.0,188.1')] ).
cnf(201,plain,
~ is_a_theorem(skc150),
inference(sor,[status(thm)],[197,149]),
[iquote('0:SoR:197.0,149.1')] ).
cnf(218,plain,
is_a_theorem(implies__dfg(strict_implies(u,v),implies__dfg(u,v))),
inference(spr,[status(thm),theory(equality)],[159,148]),
[iquote('0:SpR:159.0,148.0')] ).
cnf(426,plain,
( ~ is_a_theorem(strict_implies(u,v))
| is_a_theorem(implies__dfg(u,v)) ),
inference(res,[status(thm),theory(equality)],[218,175]),
[iquote('0:Res:218.0,175.1')] ).
cnf(727,plain,
is_a_theorem(implies__dfg(skc151,skc150)),
inference(sor,[status(thm)],[426,38]),
[iquote('0:SoR:426.0,38.0')] ).
cnf(732,plain,
( ~ is_a_theorem(skc151)
| is_a_theorem(skc150) ),
inference(res,[status(thm),theory(equality)],[727,175]),
[iquote('0:Res:727.0,175.1')] ).
cnf(734,plain,
is_a_theorem(skc150),
inference(ssi,[status(thm)],[732,33]),
[iquote('0:SSi:732.0,33.0')] ).
cnf(735,plain,
$false,
inference(mrr,[status(thm)],[734,201]),
[iquote('0:MRR:734.0,201.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL525+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 5 13:10:14 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.38/0.68
% 0.38/0.68 SPASS V 3.9
% 0.38/0.68 SPASS beiseite: Proof found.
% 0.38/0.68 % SZS status Theorem
% 0.38/0.68 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.68 SPASS derived 465 clauses, backtracked 0 clauses, performed 1 splits and kept 399 clauses.
% 0.38/0.68 SPASS allocated 98657 KBytes.
% 0.38/0.68 SPASS spent 0:00:00.30 on the problem.
% 0.38/0.68 0:00:00.06 for the input.
% 0.38/0.68 0:00:00.07 for the FLOTTER CNF translation.
% 0.38/0.68 0:00:00.02 for inferences.
% 0.38/0.68 0:00:00.00 for the backtracking.
% 0.38/0.68 0:00:00.08 for the reduction.
% 0.38/0.68
% 0.38/0.68
% 0.38/0.68 Here is a proof with depth 4, length 26 :
% 0.38/0.68 % SZS output start Refutation
% See solution above
% 0.38/0.68 Formulae used in the proof : s1_0_op_strict_implies hilbert_modus_ponens km5_necessitation km5_axiom_M s1_0_modus_ponens_strict_implies modus_ponens_strict_implies axiom_M necessitation op_strict_implies modus_ponens hilbert_and_3 and_3
% 0.38/0.68
%------------------------------------------------------------------------------