TSTP Solution File: LCL199-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL199-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:22 EDT 2022
% Result : Unsatisfiable 0.39s 0.54s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 24 RR)
% Number of literals : 37 ( 0 equ; 14 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(not__dfg(or__dfg(p,q))),not__dfg(p))),
file('LCL199-1.p',unknown),
[] ).
cnf(2,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,u)),u)),
file('LCL199-1.p',unknown),
[] ).
cnf(3,axiom,
axiom(or__dfg(not__dfg(u),or__dfg(v,u))),
file('LCL199-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL199-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('LCL199-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL199-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL199-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('LCL199-1.p',unknown),
[] ).
cnf(22,plain,
( ~ theorem(or__dfg(u,u))
| theorem(u) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.1')] ).
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(31,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(40,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(v))),
inference(sor,[status(thm)],[31,3]),
[iquote('0:SoR:31.0,3.0')] ).
cnf(42,plain,
theorem(or__dfg(not__dfg(u),or__dfg(v,u))),
inference(sor,[status(thm)],[24,40]),
[iquote('0:SoR:24.0,40.0')] ).
cnf(46,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(63,plain,
theorem(or__dfg(u,or__dfg(not__dfg(v),v))),
inference(sor,[status(thm)],[28,42]),
[iquote('0:SoR:28.0,42.0')] ).
cnf(67,plain,
theorem(or__dfg(not__dfg(u),u)),
inference(sor,[status(thm)],[22,63]),
[iquote('0:SoR:22.0,63.0')] ).
cnf(71,plain,
theorem(or__dfg(u,not__dfg(u))),
inference(sor,[status(thm)],[24,67]),
[iquote('0:SoR:24.0,67.0')] ).
cnf(276,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,46]),
[iquote('0:Res:3.0,46.0')] ).
cnf(277,plain,
( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
| theorem(or__dfg(w,not__dfg(or__dfg(v,u)))) ),
inference(res,[status(thm),theory(equality)],[4,46]),
[iquote('0:Res:4.0,46.0')] ).
cnf(743,plain,
theorem(or__dfg(not__dfg(not__dfg(or__dfg(u,v))),not__dfg(or__dfg(v,u)))),
inference(res,[status(thm),theory(equality)],[71,277]),
[iquote('0:Res:71.0,277.0')] ).
cnf(817,plain,
theorem(or__dfg(not__dfg(or__dfg(u,v)),not__dfg(not__dfg(or__dfg(v,u))))),
inference(sor,[status(thm)],[24,743]),
[iquote('0:SoR:24.0,743.0')] ).
cnf(871,plain,
theorem(or__dfg(not__dfg(not__dfg(or__dfg(u,v))),not__dfg(u))),
inference(res,[status(thm),theory(equality)],[817,276]),
[iquote('0:Res:817.0,276.0')] ).
cnf(873,plain,
$false,
inference(unc,[status(thm)],[871,1]),
[iquote('0:UnC:871.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL199-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 2 21:39:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.39/0.54
% 0.39/0.54 SPASS V 3.9
% 0.39/0.54 SPASS beiseite: Proof found.
% 0.39/0.54 % SZS status Theorem
% 0.39/0.54 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.54 SPASS derived 854 clauses, backtracked 0 clauses, performed 0 splits and kept 533 clauses.
% 0.39/0.54 SPASS allocated 76958 KBytes.
% 0.39/0.54 SPASS spent 0:00:00.19 on the problem.
% 0.39/0.54 0:00:00.03 for the input.
% 0.39/0.54 0:00:00.00 for the FLOTTER CNF translation.
% 0.39/0.54 0:00:00.03 for inferences.
% 0.39/0.54 0:00:00.00 for the backtracking.
% 0.39/0.54 0:00:00.10 for the reduction.
% 0.39/0.54
% 0.39/0.54
% 0.39/0.54 Here is a proof with depth 10, length 24 :
% 0.39/0.54 % SZS output start Refutation
% See solution above
% 0.39/0.54 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.39/0.54
%------------------------------------------------------------------------------