%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL226-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:06 PM UTC 2026
% Result : Unsatisfiable 0.47s 0.79s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 16 RR)
% Number of literals : 23 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(implies__dfg(or__dfg(q,r),implies__dfg(or__dfg(not__dfg(r),s),or__dfg(q,s)))),
file('LCL226-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies__dfg(or__dfg(u,or__dfg(v,w)),or__dfg(v,or__dfg(u,w)))),
file('LCL226-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies__dfg(implies__dfg(u,v),implies__dfg(or__dfg(w,u),or__dfg(w,v)))),
file('LCL226-3.p',unknown),
[] ).
cnf(7,axiom,
equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
file('LCL226-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL226-3.p',unknown),
[] ).
cnf(9,axiom,
( ~ theorem(u)
| ~ theorem(implies__dfg(u,v))
| theorem(v) ),
file('LCL226-3.p',unknown),
[] ).
cnf(10,plain,
~ theorem(implies__dfg(or__dfg(q,r),implies__dfg(implies__dfg(r,s),or__dfg(q,s)))),
inference(rew,[status(thm),theory(equality)],[7,1]),
[iquote('0:Rew:7.0,1.0')] ).
cnf(20,plain,
( ~ axiom(implies__dfg(u,v))
| ~ theorem(u)
| theorem(v) ),
inference(res,[status(thm),theory(equality)],[8,9]),
[iquote('0:Res:8.1,9.1')] ).
cnf(32,plain,
axiom(implies__dfg(or__dfg(not__dfg(u),or__dfg(v,w)),or__dfg(v,implies__dfg(u,w)))),
inference(spr,[status(thm),theory(equality)],[7,5]),
[iquote('0:SpR:7.0,5.0')] ).
cnf(36,plain,
axiom(implies__dfg(implies__dfg(u,or__dfg(v,w)),or__dfg(v,implies__dfg(u,w)))),
inference(rew,[status(thm),theory(equality)],[7,32]),
[iquote('0:Rew:7.0,32.0')] ).
cnf(65,plain,
axiom(implies__dfg(implies__dfg(u,or__dfg(not__dfg(v),w)),implies__dfg(v,implies__dfg(u,w)))),
inference(spr,[status(thm),theory(equality)],[7,36]),
[iquote('0:SpR:7.0,36.0')] ).
cnf(67,plain,
axiom(implies__dfg(implies__dfg(u,implies__dfg(v,w)),implies__dfg(v,implies__dfg(u,w)))),
inference(rew,[status(thm),theory(equality)],[7,65]),
[iquote('0:Rew:7.0,65.0')] ).
cnf(123,plain,
( ~ theorem(implies__dfg(u,implies__dfg(v,w)))
| theorem(implies__dfg(v,implies__dfg(u,w))) ),
inference(sor,[status(thm)],[20,67]),
[iquote('0:SoR:20.0,67.0')] ).
cnf(507,plain,
( ~ axiom(implies__dfg(u,implies__dfg(v,w)))
| theorem(implies__dfg(v,implies__dfg(u,w))) ),
inference(sor,[status(thm)],[123,8]),
[iquote('0:SoR:123.0,8.1')] ).
cnf(1398,plain,
theorem(implies__dfg(or__dfg(u,v),implies__dfg(implies__dfg(v,w),or__dfg(u,w)))),
inference(sor,[status(thm)],[507,6]),
[iquote('0:SoR:507.0,6.0')] ).
cnf(1404,plain,
$false,
inference(unc,[status(thm)],[1398,10]),
[iquote('0:UnC:1398.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL226-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sat Sep 5 11:47:27 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.47/0.79
% 0.47/0.79 SPASS V 3.9
% 0.47/0.79 SPASS beiseite: Proof found.
% 0.47/0.79 % SZS status Theorem
% 0.47/0.79 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.79 SPASS derived 1312 clauses, backtracked 0 clauses, performed 0 splits and kept 655 clauses.
% 0.47/0.79 SPASS allocated 77320 KBytes.
% 0.47/0.79 SPASS spent 0:00:00.38 on the problem.
% 0.47/0.79 0:00:00.06 for the input.
% 0.47/0.79 0:00:00.00 for the FLOTTER CNF translation.
% 0.47/0.79 0:00:00.06 for inferences.
% 0.47/0.79 0:00:00.00 for the backtracking.
% 0.47/0.79 0:00:00.21 for the reduction.
% 0.47/0.79
% 0.47/0.79
% 0.47/0.79 Here is a proof with depth 5, length 16 :
% 0.47/0.79 % SZS output start Refutation
% See solution above
% 0.47/0.79 Formulae used in the proof : prove_this axiom_1_5 axiom_1_6 implies_definition rule_1 rule_2
% 0.47/0.79
%------------------------------------------------------------------------------