%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL356-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:18 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.50s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 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 : 9 ( 9 usr; 8 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('LCL356-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('LCL356-1.p',unknown),
[] ).
cnf(5,axiom,
~ is_a_theorem(implies__dfg(implies__dfg(x__dfg,implies__dfg(y__dfg,z__dfg)),implies__dfg(implies__dfg(u__dfg,y__dfg),implies__dfg(x__dfg,implies__dfg(u__dfg,z__dfg))))),
file('LCL356-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(implies__dfg(u,v),implies__dfg(w,v)),x),implies__dfg(implies__dfg(w,u),x))),
inference(sor,[status(thm)],[13,2]),
[iquote('0:SoR:13.0,2.0')] ).
cnf(35,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),x))
| is_a_theorem(implies__dfg(implies__dfg(w,u),x)) ),
inference(res,[status(thm),theory(equality)],[17,1]),
[iquote('0:Res:17.0,1.1')] ).
cnf(113,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(v,w)),implies__dfg(implies__dfg(x,v),implies__dfg(u,implies__dfg(x,w))))),
inference(sor,[status(thm)],[35,17]),
[iquote('0:SoR:35.0,17.0')] ).
cnf(122,plain,
$false,
inference(unc,[status(thm)],[113,5]),
[iquote('0:UnC:113.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL356-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 5 09:17:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.22/0.50
% 0.22/0.50 SPASS V 3.9
% 0.22/0.50 SPASS beiseite: Proof found.
% 0.22/0.50 % SZS status Theorem
% 0.22/0.50 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.50 SPASS derived 110 clauses, backtracked 0 clauses, performed 0 splits and kept 86 clauses.
% 0.22/0.50 SPASS allocated 75851 KBytes.
% 0.22/0.50 SPASS spent 0:00:00.11 on the problem.
% 0.22/0.50 0:00:00.06 for the input.
% 0.22/0.50 0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.50 0:00:00.00 for inferences.
% 0.22/0.50 0:00:00.00 for the backtracking.
% 0.22/0.50 0:00:00.01 for the reduction.
% 0.22/0.50
% 0.22/0.50
% 0.22/0.50 Here is a proof with depth 4, length 8 :
% 0.22/0.50 % SZS output start Refutation
% See solution above
% 0.22/0.50 Formulae used in the proof : condensed_detachment cn_1 prove_cn_05
% 0.22/0.50
%------------------------------------------------------------------------------