%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL185-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:58 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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(p),or__dfg(p,q))),
file('LCL185-1.p',unknown),
[] ).
cnf(3,axiom,
axiom(or__dfg(not__dfg(u),or__dfg(v,u))),
file('LCL185-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL185-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL185-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL185-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('LCL185-1.p',unknown),
[] ).
cnf(11,plain,
( ~ theorem(or__dfg(not__dfg(u),or__dfg(p,q)))
| ~ axiom(or__dfg(not__dfg(p),u)) ),
inference(res,[status(thm),theory(equality)],[9,1]),
[iquote('0:Res:9.2,1.0')] ).
cnf(24,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(33,plain,
( ~ axiom(or__dfg(u,v))
| theorem(or__dfg(v,u)) ),
inference(sor,[status(thm)],[24,7]),
[iquote('0:SoR:24.0,7.1')] ).
cnf(43,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(or__dfg(v,u)))),
inference(sor,[status(thm)],[33,4]),
[iquote('0:SoR:33.0,4.0')] ).
cnf(58,plain,
theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
inference(sor,[status(thm)],[24,43]),
[iquote('0:SoR:24.0,43.0')] ).
cnf(85,plain,
~ axiom(or__dfg(not__dfg(p),or__dfg(q,p))),
inference(res,[status(thm),theory(equality)],[58,11]),
[iquote('0:Res:58.0,11.0')] ).
cnf(87,plain,
$false,
inference(mrr,[status(thm)],[85,3]),
[iquote('0:MRR:85.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL185-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.08/0.35 % Computer : n028.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 01:00:13 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.21/0.48
% 0.21/0.48 SPASS V 3.9
% 0.21/0.48 SPASS beiseite: Proof found.
% 0.21/0.48 % SZS status Theorem
% 0.21/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 SPASS derived 68 clauses, backtracked 0 clauses, performed 0 splits and kept 58 clauses.
% 0.21/0.48 SPASS allocated 75714 KBytes.
% 0.21/0.48 SPASS spent 0:00:00.11 on the problem.
% 0.21/0.48 0:00:00.06 for the input.
% 0.21/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.48 0:00:00.00 for inferences.
% 0.21/0.48 0:00:00.00 for the backtracking.
% 0.21/0.48 0:00:00.00 for the reduction.
% 0.21/0.48
% 0.21/0.48
% 0.21/0.48 Here is a proof with depth 5, length 13 :
% 0.21/0.48 % SZS output start Refutation
% See solution above
% 0.21/0.48 Formulae used in the proof : prove_this axiom_1_3 axiom_1_4 rule_1 rule_2 rule_3
% 0.21/0.48
%------------------------------------------------------------------------------