%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL197-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:00 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.48s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 17 RR)
% Number of literals : 26 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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(or__dfg(q,or__dfg(p,q))),or__dfg(p,q))),
file('LCL197-1.p',unknown),
[] ).
cnf(2,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,u)),u)),
file('LCL197-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL197-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('LCL197-1.p',unknown),
[] ).
cnf(6,axiom,
axiom(or__dfg(not__dfg(or__dfg(not__dfg(u),v)),or__dfg(not__dfg(or__dfg(w,u)),or__dfg(w,v)))),
file('LCL197-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL197-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL197-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('LCL197-1.p',unknown),
[] ).
cnf(12,plain,
( ~ theorem(or__dfg(not__dfg(u),or__dfg(p,q)))
| ~ axiom(or__dfg(not__dfg(or__dfg(q,or__dfg(p,q))),u)) ),
inference(res,[status(thm),theory(equality)],[9,1]),
[iquote('0:Res:9.2,1.0')] ).
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(43,plain,
theorem(or__dfg(u,not__dfg(or__dfg(u,u)))),
inference(sor,[status(thm)],[27,2]),
[iquote('0:SoR:27.0,2.0')] ).
cnf(45,plain,
theorem(or__dfg(not__dfg(or__dfg(u,u)),u)),
inference(sor,[status(thm)],[23,43]),
[iquote('0:SoR:23.0,43.0')] ).
cnf(48,plain,
( ~ theorem(or__dfg(not__dfg(u),v))
| theorem(or__dfg(not__dfg(or__dfg(w,u)),or__dfg(w,v))) ),
inference(res,[status(thm),theory(equality)],[6,8]),
[iquote('0:Res:6.0,8.1')] ).
cnf(106,plain,
theorem(or__dfg(not__dfg(or__dfg(u,or__dfg(v,v))),or__dfg(u,v))),
inference(sor,[status(thm)],[48,45]),
[iquote('0:SoR:48.0,45.0')] ).
cnf(141,plain,
~ theorem(or__dfg(not__dfg(or__dfg(p,or__dfg(q,q))),or__dfg(p,q))),
inference(res,[status(thm),theory(equality)],[5,12]),
[iquote('0:Res:5.0,12.1')] ).
cnf(142,plain,
$false,
inference(mrr,[status(thm)],[141,106]),
[iquote('0:MRR:141.0,106.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL197-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : run_spass %d %s
% 0.09/0.35 % Computer : n004.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 18:32:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.22/0.48
% 0.22/0.48 SPASS V 3.9
% 0.22/0.48 SPASS beiseite: Proof found.
% 0.22/0.48 % SZS status Theorem
% 0.22/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 SPASS derived 123 clauses, backtracked 0 clauses, performed 0 splits and kept 91 clauses.
% 0.22/0.48 SPASS allocated 75816 KBytes.
% 0.22/0.48 SPASS spent 0:00:00.11 on the problem.
% 0.22/0.48 0:00:00.06 for the input.
% 0.22/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.48 0:00:00.00 for inferences.
% 0.22/0.48 0:00:00.00 for the backtracking.
% 0.22/0.48 0:00:00.01 for the reduction.
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 Here is a proof with depth 5, length 17 :
% 0.22/0.48 % SZS output start Refutation
% See solution above
% 0.22/0.48 Formulae used in the proof : prove_this axiom_1_2 axiom_1_4 axiom_1_5 axiom_1_6 rule_1 rule_2 rule_3
% 0.22/0.48
%------------------------------------------------------------------------------