%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL046-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:06:39 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.60s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(v) ),
file('LCL046-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
file('LCL046-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),u),u)),
file('LCL046-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(u),v))),
file('LCL046-1.p',unknown),
[] ).
cnf(5,axiom,
~ is_a_theorem(implies__dfg(a,a)),
file('LCL046-1.p',unknown),
[] ).
cnf(13,plain,
( ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(implies__dfg(implies__dfg(v,w),implies__dfg(u,w))) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.0,1.1')] ).
cnf(17,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),v),w),implies__dfg(u,w))),
inference(sor,[status(thm)],[13,4]),
[iquote('0:SoR:13.0,4.0')] ).
cnf(21,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),v),w))
| is_a_theorem(implies__dfg(u,w)) ),
inference(res,[status(thm),theory(equality)],[17,1]),
[iquote('0:Res:17.0,1.1')] ).
cnf(30,plain,
is_a_theorem(implies__dfg(u,u)),
inference(sor,[status(thm)],[21,3]),
[iquote('0:SoR:21.0,3.0')] ).
cnf(31,plain,
$false,
inference(unc,[status(thm)],[30,5]),
[iquote('0:UnC:30.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL046-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_spass %d %s
% 0.17/0.42 % Computer : n027.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Sat Sep 5 22:38:43 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.25/0.60
% 0.25/0.60 SPASS V 3.9
% 0.25/0.60 SPASS beiseite: Proof found.
% 0.25/0.60 % SZS status Theorem
% 0.25/0.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.25/0.60 SPASS derived 20 clauses, backtracked 0 clauses, performed 0 splits and kept 23 clauses.
% 0.25/0.60 SPASS allocated 75632 KBytes.
% 0.25/0.60 SPASS spent 0:00:00.14 on the problem.
% 0.25/0.60 0:00:00.09 for the input.
% 0.25/0.60 0:00:00.00 for the FLOTTER CNF translation.
% 0.25/0.60 0:00:00.00 for inferences.
% 0.25/0.60 0:00:00.00 for the backtracking.
% 0.25/0.60 0:00:00.00 for the reduction.
% 0.25/0.60
% 0.25/0.60
% 0.25/0.60 Here is a proof with depth 4, length 10 :
% 0.25/0.60 % SZS output start Refutation
% See solution above
% 0.25/0.60 Formulae used in the proof : condensed_detachment cn_1 cn_2 cn_3 prove_cn_16
% 0.25/0.60
%------------------------------------------------------------------------------