%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL236-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:08 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 21 unt; 0 nHn; 29 RR)
% Number of literals : 39 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(implies__dfg(or__dfg(not__dfg(p),not__dfg(q)),not__dfg(and__dfg(p,q)))),
file('LCL236-3.p',unknown),
[] ).
cnf(2,axiom,
axiom(implies__dfg(or__dfg(u,u),u)),
file('LCL236-3.p',unknown),
[] ).
cnf(3,axiom,
axiom(implies__dfg(u,or__dfg(v,u))),
file('LCL236-3.p',unknown),
[] ).
cnf(4,axiom,
axiom(implies__dfg(or__dfg(u,v),or__dfg(v,u))),
file('LCL236-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies__dfg(or__dfg(u,or__dfg(v,w)),or__dfg(v,or__dfg(u,w)))),
file('LCL236-3.p',unknown),
[] ).
cnf(7,axiom,
equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
file('LCL236-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL236-3.p',unknown),
[] ).
cnf(9,axiom,
( ~ theorem(u)
| ~ theorem(implies__dfg(u,v))
| theorem(v) ),
file('LCL236-3.p',unknown),
[] ).
cnf(10,axiom,
equal(not__dfg(or__dfg(not__dfg(u),not__dfg(v))),and__dfg(u,v)),
file('LCL236-3.p',unknown),
[] ).
cnf(11,plain,
equal(not__dfg(implies__dfg(u,not__dfg(v))),and__dfg(u,v)),
inference(rew,[status(thm),theory(equality)],[7,10]),
[iquote('0:Rew:7.0,10.0')] ).
cnf(12,plain,
~ theorem(implies__dfg(implies__dfg(p,not__dfg(q)),not__dfg(and__dfg(p,q)))),
inference(rew,[status(thm),theory(equality)],[7,1]),
[iquote('0:Rew:7.0,1.0')] ).
cnf(18,plain,
axiom(implies__dfg(or__dfg(u,not__dfg(v)),implies__dfg(v,u))),
inference(spr,[status(thm),theory(equality)],[7,4]),
[iquote('0:SpR:7.0,4.0')] ).
cnf(19,plain,
axiom(implies__dfg(implies__dfg(u,v),or__dfg(v,not__dfg(u)))),
inference(spr,[status(thm),theory(equality)],[7,4]),
[iquote('0:SpR:7.0,4.0')] ).
cnf(20,plain,
equal(implies__dfg(implies__dfg(u,not__dfg(v)),w),or__dfg(and__dfg(u,v),w)),
inference(spr,[status(thm),theory(equality)],[11,7]),
[iquote('0:SpR:11.0,7.0')] ).
cnf(25,plain,
~ theorem(or__dfg(and__dfg(p,q),not__dfg(and__dfg(p,q)))),
inference(rew,[status(thm),theory(equality)],[20,12]),
[iquote('0:Rew:20.0,12.0')] ).
cnf(40,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(41,plain,
( ~ theorem(or__dfg(u,not__dfg(v)))
| theorem(implies__dfg(v,u)) ),
inference(sor,[status(thm)],[40,18]),
[iquote('0:SoR:40.0,18.0')] ).
cnf(43,plain,
( ~ theorem(implies__dfg(u,v))
| theorem(or__dfg(v,not__dfg(u))) ),
inference(sor,[status(thm)],[40,19]),
[iquote('0:SoR:40.0,19.0')] ).
cnf(46,plain,
( ~ theorem(or__dfg(u,u))
| theorem(u) ),
inference(sor,[status(thm)],[40,2]),
[iquote('0:SoR:40.0,2.0')] ).
cnf(52,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(56,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,52]),
[iquote('0:Rew:7.0,52.0')] ).
cnf(117,plain,
( ~ axiom(implies__dfg(u,v))
| theorem(or__dfg(v,not__dfg(u))) ),
inference(sor,[status(thm)],[43,8]),
[iquote('0:SoR:43.0,8.1')] ).
cnf(118,plain,
( ~ theorem(implies__dfg(u,or__dfg(v,w)))
| theorem(or__dfg(v,implies__dfg(u,w))) ),
inference(sor,[status(thm)],[40,56]),
[iquote('0:SoR:40.0,56.0')] ).
cnf(141,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(v))),
inference(sor,[status(thm)],[117,3]),
[iquote('0:SoR:117.0,3.0')] ).
cnf(163,plain,
theorem(implies__dfg(u,or__dfg(v,u))),
inference(sor,[status(thm)],[41,141]),
[iquote('0:SoR:41.0,141.0')] ).
cnf(373,plain,
theorem(or__dfg(u,implies__dfg(v,v))),
inference(sor,[status(thm)],[118,163]),
[iquote('0:SoR:118.0,163.0')] ).
cnf(375,plain,
theorem(implies__dfg(u,u)),
inference(sor,[status(thm)],[46,373]),
[iquote('0:SoR:46.0,373.0')] ).
cnf(380,plain,
theorem(or__dfg(u,not__dfg(u))),
inference(sor,[status(thm)],[43,375]),
[iquote('0:SoR:43.0,375.0')] ).
cnf(384,plain,
$false,
inference(unc,[status(thm)],[380,25]),
[iquote('0:UnC:380.0,25.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL236-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 10:24:24 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.21/0.51
% 0.21/0.51 SPASS V 3.9
% 0.21/0.51 SPASS beiseite: Proof found.
% 0.21/0.51 % SZS status Theorem
% 0.21/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.51 SPASS derived 274 clauses, backtracked 0 clauses, performed 0 splits and kept 145 clauses.
% 0.21/0.51 SPASS allocated 76188 KBytes.
% 0.21/0.51 SPASS spent 0:00:00.14 on the problem.
% 0.21/0.51 0:00:00.06 for the input.
% 0.21/0.51 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.51 0:00:00.01 for inferences.
% 0.21/0.51 0:00:00.00 for the backtracking.
% 0.21/0.51 0:00:00.02 for the reduction.
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 Here is a proof with depth 8, length 29 :
% 0.21/0.51 % SZS output start Refutation
% See solution above
% 0.21/0.51 Formulae used in the proof : prove_this axiom_1_2 axiom_1_3 axiom_1_4 axiom_1_5 implies_definition rule_1 rule_2 and_defn
% 0.21/0.51
%------------------------------------------------------------------------------