%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL205-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:02 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.61s
% Output : Refutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 13 unt; 0 nHn; 24 RR)
% Number of literals : 38 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(or__dfg(not__dfg(not__dfg(or__dfg(not__dfg(p),q))),or__dfg(not__dfg(p),not__dfg(q)))),
file('LCL205-1.p',unknown),
[] ).
cnf(2,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,u)),u)),
file('LCL205-1.p',unknown),
[] ).
cnf(3,axiom,
axiom(or__dfg(not__dfg(u),or__dfg(v,u))),
file('LCL205-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL205-1.p',unknown),
[] ).
cnf(5,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,or__dfg(v,w))),or__dfg(v,or__dfg(u,w)))),
file('LCL205-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL205-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL205-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ theorem(or__dfg(not__dfg(u),v))
| ~ axiom(or__dfg(not__dfg(w),u))
| theorem(or__dfg(not__dfg(w),v)) ),
file('LCL205-1.p',unknown),
[] ).
cnf(21,plain,
( ~ theorem(or__dfg(u,u))
| theorem(u) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.1')] ).
cnf(22,plain,
( ~ theorem(u)
| theorem(or__dfg(v,u)) ),
inference(res,[status(thm),theory(equality)],[3,8]),
[iquote('0:Res:3.0,8.1')] ).
cnf(23,plain,
( ~ theorem(or__dfg(u,v))
| theorem(or__dfg(v,u)) ),
inference(res,[status(thm),theory(equality)],[4,8]),
[iquote('0:Res:4.0,8.1')] ).
cnf(27,plain,
( ~ axiom(or__dfg(u,v))
| theorem(or__dfg(v,u)) ),
inference(sor,[status(thm)],[23,7]),
[iquote('0:SoR:23.0,7.1')] ).
cnf(30,plain,
( ~ theorem(or__dfg(u,or__dfg(v,w)))
| theorem(or__dfg(v,or__dfg(u,w))) ),
inference(res,[status(thm),theory(equality)],[5,8]),
[iquote('0:Res:5.0,8.1')] ).
cnf(33,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(v))),
inference(sor,[status(thm)],[27,3]),
[iquote('0:SoR:27.0,3.0')] ).
cnf(35,plain,
theorem(or__dfg(not__dfg(u),or__dfg(v,u))),
inference(sor,[status(thm)],[23,33]),
[iquote('0:SoR:23.0,33.0')] ).
cnf(53,plain,
theorem(or__dfg(u,or__dfg(not__dfg(v),v))),
inference(sor,[status(thm)],[30,35]),
[iquote('0:SoR:30.0,35.0')] ).
cnf(56,plain,
( ~ theorem(or__dfg(u,v))
| theorem(or__dfg(u,or__dfg(w,v))) ),
inference(sor,[status(thm)],[30,22]),
[iquote('0:SoR:30.0,22.1')] ).
cnf(59,plain,
( ~ axiom(or__dfg(not__dfg(u),v))
| ~ theorem(or__dfg(not__dfg(v),w))
| theorem(or__dfg(w,not__dfg(u))) ),
inference(sor,[status(thm)],[23,9]),
[iquote('0:SoR:23.0,9.2')] ).
cnf(69,plain,
theorem(or__dfg(not__dfg(u),u)),
inference(sor,[status(thm)],[21,53]),
[iquote('0:SoR:21.0,53.0')] ).
cnf(73,plain,
theorem(or__dfg(u,not__dfg(u))),
inference(sor,[status(thm)],[23,69]),
[iquote('0:SoR:23.0,69.0')] ).
cnf(280,plain,
( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
| theorem(or__dfg(w,not__dfg(v))) ),
inference(res,[status(thm),theory(equality)],[3,59]),
[iquote('0:Res:3.0,59.0')] ).
cnf(603,plain,
theorem(or__dfg(not__dfg(not__dfg(or__dfg(u,v))),not__dfg(v))),
inference(res,[status(thm),theory(equality)],[73,280]),
[iquote('0:Res:73.0,280.0')] ).
cnf(672,plain,
theorem(or__dfg(not__dfg(not__dfg(or__dfg(u,v))),or__dfg(w,not__dfg(v)))),
inference(sor,[status(thm)],[56,603]),
[iquote('0:SoR:56.0,603.0')] ).
cnf(679,plain,
$false,
inference(unc,[status(thm)],[672,1]),
[iquote('0:UnC:672.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL205-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.02/0.36 % Computer : n019.cluster.edu
% 0.02/0.36 % Model : x86_64 x86_64
% 0.02/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.36 % Memory : 8046.5625MB
% 0.02/0.36 % OS : Linux 6.8.0-71-generic
% 0.02/0.36 % CPULimit : 300
% 0.02/0.36 % WCLimit : 300
% 0.02/0.36 % DateTime : Sat Sep 5 11:26:38 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.31/0.61
% 0.31/0.61 SPASS V 3.9
% 0.31/0.61 SPASS beiseite: Proof found.
% 0.31/0.61 % SZS status Theorem
% 0.31/0.61 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.31/0.61 SPASS derived 660 clauses, backtracked 0 clauses, performed 0 splits and kept 410 clauses.
% 0.31/0.61 SPASS allocated 76669 KBytes.
% 0.31/0.61 SPASS spent 0:00:00.22 on the problem.
% 0.31/0.61 0:00:00.06 for the input.
% 0.31/0.61 0:00:00.00 for the FLOTTER CNF translation.
% 0.31/0.61 0:00:00.02 for inferences.
% 0.31/0.61 0:00:00.00 for the backtracking.
% 0.31/0.61 0:00:00.09 for the reduction.
% 0.31/0.61
% 0.31/0.61
% 0.31/0.61 Here is a proof with depth 9, length 24 :
% 0.31/0.61 % SZS output start Refutation
% See solution above
% 0.31/0.61 Formulae used in the proof : prove_this axiom_1_2 axiom_1_3 axiom_1_4 axiom_1_5 rule_1 rule_2 rule_3
% 0.31/0.61
%------------------------------------------------------------------------------