%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL193-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:59 PM UTC 2026
% Result : Unsatisfiable 49.44s 49.77s
% Output : Refutation 49.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 15 RR)
% Number of literals : 24 ( 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(or__dfg(not__dfg(or__dfg(not__dfg(q),r)),or__dfg(not__dfg(or__dfg(p,q)),or__dfg(r,p)))),
file('LCL193-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL193-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('LCL193-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL193-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL193-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('LCL193-1.p',unknown),
[] ).
cnf(12,plain,
( ~ theorem(or__dfg(not__dfg(u),or__dfg(not__dfg(or__dfg(p,q)),or__dfg(r,p))))
| ~ axiom(or__dfg(not__dfg(or__dfg(not__dfg(q),r)),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(32,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(or__dfg(v,u)))),
inference(sor,[status(thm)],[27,4]),
[iquote('0:SoR:27.0,4.0')] ).
cnf(39,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(41,plain,
theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
inference(sor,[status(thm)],[23,32]),
[iquote('0:SoR:23.0,32.0')] ).
cnf(87,plain,
theorem(or__dfg(not__dfg(or__dfg(u,or__dfg(v,w))),or__dfg(u,or__dfg(w,v)))),
inference(sor,[status(thm)],[39,41]),
[iquote('0:SoR:39.0,41.0')] ).
cnf(21013,plain,
~ axiom(or__dfg(not__dfg(or__dfg(not__dfg(q),r)),or__dfg(not__dfg(or__dfg(p,q)),or__dfg(p,r)))),
inference(res,[status(thm),theory(equality)],[87,12]),
[iquote('0:Res:87.0,12.0')] ).
cnf(21033,plain,
$false,
inference(mrr,[status(thm)],[21013,6]),
[iquote('0:MRR:21013.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL193-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.09/0.36 % Computer : n029.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 4 13:48:24 UTC 2026
% 0.09/0.36 % CPUTime :
% 49.44/49.77
% 49.44/49.77 SPASS V 3.9
% 49.44/49.77 SPASS beiseite: Proof found.
% 49.44/49.77 % SZS status Theorem
% 49.44/49.77 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 49.44/49.77 SPASS derived 21008 clauses, backtracked 0 clauses, performed 0 splits and kept 12606 clauses.
% 49.44/49.77 SPASS allocated 108810 KBytes.
% 49.44/49.77 SPASS spent 0:0:48.11 on the problem.
% 49.44/49.77 0:00:00.06 for the input.
% 49.44/49.77 0:00:00.00 for the FLOTTER CNF translation.
% 49.44/49.77 0:00:01.15 for inferences.
% 49.44/49.77 0:00:00.00 for the backtracking.
% 49.44/49.77 0:0:46.32 for the reduction.
% 49.44/49.77
% 49.44/49.77
% 49.44/49.77 Here is a proof with depth 6, length 15 :
% 49.44/49.77 % SZS output start Refutation
% See solution above
% 49.44/49.77 Formulae used in the proof : prove_this axiom_1_4 axiom_1_6 rule_1 rule_2 rule_3
% 49.44/49.77
%------------------------------------------------------------------------------