TSTP Solution File: LCL211-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL211-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:30 EDT 2022
% Result : Unsatisfiable 1.62s 1.84s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 36 ( 25 unt; 0 nHn; 36 RR)
% Number of literals : 49 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(implies__dfg(not__dfg(q),implies__dfg(or__dfg(p,q),p))),
file('LCL211-3.p',unknown),
[] ).
cnf(2,axiom,
axiom(implies__dfg(or__dfg(u,u),u)),
file('LCL211-3.p',unknown),
[] ).
cnf(3,axiom,
axiom(implies__dfg(u,or__dfg(v,u))),
file('LCL211-3.p',unknown),
[] ).
cnf(4,axiom,
axiom(implies__dfg(or__dfg(u,v),or__dfg(v,u))),
file('LCL211-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies__dfg(or__dfg(u,or__dfg(v,w)),or__dfg(v,or__dfg(u,w)))),
file('LCL211-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies__dfg(implies__dfg(u,v),implies__dfg(or__dfg(w,u),or__dfg(w,v)))),
file('LCL211-3.p',unknown),
[] ).
cnf(7,axiom,
equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
file('LCL211-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL211-3.p',unknown),
[] ).
cnf(9,axiom,
( ~ theorem(u)
| ~ theorem(implies__dfg(u,v))
| theorem(v) ),
file('LCL211-3.p',unknown),
[] ).
cnf(15,plain,
axiom(implies__dfg(or__dfg(u,not__dfg(v)),implies__dfg(v,u))),
inference(spr,[status(thm),theory(equality)],[7,4]),
[iquote('0:SpR:7.0,4.0')] ).
cnf(16,plain,
axiom(implies__dfg(implies__dfg(u,v),or__dfg(v,not__dfg(u)))),
inference(spr,[status(thm),theory(equality)],[7,4]),
[iquote('0:SpR:7.0,4.0')] ).
cnf(20,plain,
( ~ axiom(implies__dfg(u,v))
| ~ theorem(u)
| theorem(v) ),
inference(res,[status(thm),theory(equality)],[8,9]),
[iquote('0:Res:8.1,9.1')] ).
cnf(21,plain,
( ~ theorem(implies__dfg(u,v))
| theorem(or__dfg(v,not__dfg(u))) ),
inference(sor,[status(thm)],[20,16]),
[iquote('0:SoR:20.0,16.0')] ).
cnf(24,plain,
( ~ theorem(or__dfg(u,not__dfg(v)))
| theorem(implies__dfg(v,u)) ),
inference(sor,[status(thm)],[20,15]),
[iquote('0:SoR:20.0,15.0')] ).
cnf(26,plain,
( ~ theorem(or__dfg(u,v))
| theorem(or__dfg(v,u)) ),
inference(sor,[status(thm)],[20,4]),
[iquote('0:SoR:20.0,4.0')] ).
cnf(28,plain,
( ~ theorem(or__dfg(u,u))
| theorem(u) ),
inference(sor,[status(thm)],[20,2]),
[iquote('0:SoR:20.0,2.0')] ).
cnf(30,plain,
axiom(implies__dfg(or__dfg(not__dfg(u),or__dfg(v,w)),or__dfg(v,implies__dfg(u,w)))),
inference(spr,[status(thm),theory(equality)],[7,5]),
[iquote('0:SpR:7.0,5.0')] ).
cnf(34,plain,
axiom(implies__dfg(implies__dfg(u,or__dfg(v,w)),or__dfg(v,implies__dfg(u,w)))),
inference(rew,[status(thm),theory(equality)],[7,30]),
[iquote('0:Rew:7.0,30.0')] ).
cnf(43,plain,
( ~ theorem(implies__dfg(u,v))
| theorem(implies__dfg(or__dfg(w,u),or__dfg(w,v))) ),
inference(sor,[status(thm)],[20,6]),
[iquote('0:SoR:20.0,6.0')] ).
cnf(51,plain,
( ~ theorem(implies__dfg(u,or__dfg(v,w)))
| theorem(or__dfg(v,implies__dfg(u,w))) ),
inference(sor,[status(thm)],[20,34]),
[iquote('0:SoR:20.0,34.0')] ).
cnf(70,plain,
( ~ axiom(implies__dfg(u,v))
| theorem(or__dfg(v,not__dfg(u))) ),
inference(sor,[status(thm)],[21,8]),
[iquote('0:SoR:21.0,8.1')] ).
cnf(85,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(or__dfg(v,u)))),
inference(sor,[status(thm)],[70,4]),
[iquote('0:SoR:70.0,4.0')] ).
cnf(86,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(v))),
inference(sor,[status(thm)],[70,3]),
[iquote('0:SoR:70.0,3.0')] ).
cnf(97,plain,
theorem(implies__dfg(u,or__dfg(v,u))),
inference(sor,[status(thm)],[24,86]),
[iquote('0:SoR:24.0,86.0')] ).
cnf(124,plain,
theorem(implies__dfg(or__dfg(u,v),or__dfg(v,u))),
inference(sor,[status(thm)],[24,85]),
[iquote('0:SoR:24.0,85.0')] ).
cnf(154,plain,
theorem(or__dfg(u,implies__dfg(or__dfg(v,u),v))),
inference(sor,[status(thm)],[51,124]),
[iquote('0:SoR:51.0,124.0')] ).
cnf(157,plain,
theorem(or__dfg(u,implies__dfg(v,v))),
inference(sor,[status(thm)],[51,97]),
[iquote('0:SoR:51.0,97.0')] ).
cnf(159,plain,
theorem(implies__dfg(u,u)),
inference(sor,[status(thm)],[28,157]),
[iquote('0:SoR:28.0,157.0')] ).
cnf(163,plain,
theorem(or__dfg(u,not__dfg(u))),
inference(sor,[status(thm)],[21,159]),
[iquote('0:SoR:21.0,159.0')] ).
cnf(168,plain,
theorem(implies__dfg(u,not__dfg(not__dfg(u)))),
inference(spr,[status(thm),theory(equality)],[7,163]),
[iquote('0:SpR:7.0,163.0')] ).
cnf(170,plain,
theorem(implies__dfg(or__dfg(u,v),or__dfg(u,not__dfg(not__dfg(v))))),
inference(sor,[status(thm)],[43,168]),
[iquote('0:SoR:43.0,168.0')] ).
cnf(208,plain,
theorem(or__dfg(implies__dfg(or__dfg(u,v),u),v)),
inference(sor,[status(thm)],[26,154]),
[iquote('0:SoR:26.0,154.0')] ).
cnf(1349,plain,
( ~ theorem(or__dfg(u,v))
| theorem(or__dfg(u,not__dfg(not__dfg(v)))) ),
inference(res,[status(thm),theory(equality)],[170,9]),
[iquote('0:Res:170.0,9.1')] ).
cnf(3781,plain,
theorem(or__dfg(implies__dfg(or__dfg(u,v),u),not__dfg(not__dfg(v)))),
inference(sor,[status(thm)],[1349,208]),
[iquote('0:SoR:1349.0,208.0')] ).
cnf(5417,plain,
theorem(implies__dfg(not__dfg(u),implies__dfg(or__dfg(v,u),v))),
inference(sor,[status(thm)],[24,3781]),
[iquote('0:SoR:24.0,3781.0')] ).
cnf(5419,plain,
$false,
inference(unc,[status(thm)],[5417,1]),
[iquote('0:UnC:5417.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : LCL211-3 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.11 % Command : run_spass %d %s
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sat Jul 2 14:52:33 EDT 2022
% 0.11/0.31 % CPUTime :
% 1.62/1.84
% 1.62/1.84 SPASS V 3.9
% 1.62/1.84 SPASS beiseite: Proof found.
% 1.62/1.84 % SZS status Theorem
% 1.62/1.84 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.62/1.84 SPASS derived 5106 clauses, backtracked 0 clauses, performed 0 splits and kept 2416 clauses.
% 1.62/1.84 SPASS allocated 82436 KBytes.
% 1.62/1.84 SPASS spent 0:00:01.49 on the problem.
% 1.62/1.84 0:00:00.03 for the input.
% 1.62/1.84 0:00:00.00 for the FLOTTER CNF translation.
% 1.62/1.84 0:00:00.19 for inferences.
% 1.62/1.84 0:00:00.00 for the backtracking.
% 1.62/1.84 0:00:01.21 for the reduction.
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Here is a proof with depth 13, length 36 :
% 1.62/1.84 % SZS output start Refutation
% See solution above
% 1.62/1.84 Formulae used in the proof : prove_this axiom_1_2 axiom_1_3 axiom_1_4 axiom_1_5 axiom_1_6 implies_definition rule_1 rule_2
% 1.62/1.84
%------------------------------------------------------------------------------