TSTP Solution File: LCL187-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL187-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 14:35:14 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 29 ( 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(p),or__dfg(not__dfg(not__dfg(p)),q))),
file('LCL187-1.p',unknown),
[] ).
cnf(3,axiom,
axiom(or__dfg(not__dfg(u),or__dfg(v,u))),
file('LCL187-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL187-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('LCL187-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL187-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL187-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('LCL187-1.p',unknown),
[] ).
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(28,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,
( ~ 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(49,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)],[24,9]),
[iquote('0:SoR:24.0,9.2')] ).
cnf(59,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(273,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,49]),
[iquote('0:Res:3.0,49.0')] ).
cnf(524,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(u))),
inference(res,[status(thm),theory(equality)],[59,273]),
[iquote('0:Res:59.0,273.0')] ).
cnf(567,plain,
theorem(or__dfg(not__dfg(u),or__dfg(u,v))),
inference(sor,[status(thm)],[24,524]),
[iquote('0:SoR:24.0,524.0')] ).
cnf(571,plain,
theorem(or__dfg(u,or__dfg(not__dfg(u),v))),
inference(sor,[status(thm)],[28,567]),
[iquote('0:SoR:28.0,567.0')] ).
cnf(576,plain,
$false,
inference(unc,[status(thm)],[571,1]),
[iquote('0:UnC:571.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL187-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 20:22:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49
% 0.20/0.49 SPASS V 3.9
% 0.20/0.49 SPASS beiseite: Proof found.
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 SPASS derived 557 clauses, backtracked 0 clauses, performed 0 splits and kept 341 clauses.
% 0.20/0.49 SPASS allocated 76482 KBytes.
% 0.20/0.49 SPASS spent 0:00:00.13 on the problem.
% 0.20/0.49 0:00:00.04 for the input.
% 0.20/0.49 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.49 0:00:00.02 for inferences.
% 0.20/0.49 0:00:00.00 for the backtracking.
% 0.20/0.49 0:00:00.05 for the reduction.
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Here is a proof with depth 7, length 18 :
% 0.20/0.49 % SZS output start Refutation
% See solution above
% 0.20/0.49 Formulae used in the proof : prove_this axiom_1_3 axiom_1_4 axiom_1_5 rule_1 rule_2 rule_3
% 0.20/0.49
%------------------------------------------------------------------------------