TSTP Solution File: LCL213-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:31 EDT 2022
% Result : Unsatisfiable 12.73s 12.99s
% Output : Refutation 12.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 23 RR)
% Number of literals : 36 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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(p),q)),or__dfg(not__dfg(or__dfg(not__dfg(not__dfg(p)),q)),q))),
file('LCL213-1.p',unknown),
[] ).
cnf(2,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,u)),u)),
file('LCL213-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL213-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('LCL213-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('LCL213-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL213-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL213-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('LCL213-1.p',unknown),
[] ).
cnf(12,plain,
( ~ theorem(or__dfg(not__dfg(u),or__dfg(not__dfg(or__dfg(not__dfg(not__dfg(p)),q)),q)))
| ~ axiom(or__dfg(not__dfg(or__dfg(not__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(30,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(34,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(36,plain,
theorem(or__dfg(not__dfg(or__dfg(u,u)),u)),
inference(sor,[status(thm)],[23,34]),
[iquote('0:SoR:23.0,34.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(60,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)],[23,9]),
[iquote('0:SoR:23.0,9.2')] ).
cnf(94,plain,
theorem(or__dfg(not__dfg(or__dfg(u,or__dfg(v,v))),or__dfg(u,v))),
inference(sor,[status(thm)],[39,36]),
[iquote('0:SoR:39.0,36.0')] ).
cnf(282,plain,
( ~ theorem(or__dfg(not__dfg(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(u,w))),x))
| theorem(or__dfg(x,not__dfg(or__dfg(not__dfg(v),w)))) ),
inference(res,[status(thm),theory(equality)],[6,60]),
[iquote('0:Res:6.0,60.0')] ).
cnf(1621,plain,
theorem(or__dfg(or__dfg(not__dfg(or__dfg(u,v)),u),not__dfg(or__dfg(not__dfg(v),u)))),
inference(res,[status(thm),theory(equality)],[94,282]),
[iquote('0:Res:94.0,282.0')] ).
cnf(9908,plain,
theorem(or__dfg(not__dfg(or__dfg(not__dfg(u),v)),or__dfg(not__dfg(or__dfg(v,u)),v))),
inference(sor,[status(thm)],[23,1621]),
[iquote('0:SoR:23.0,1621.0')] ).
cnf(14047,plain,
theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(not__dfg(or__dfg(not__dfg(v),u)),u))),
inference(sor,[status(thm)],[30,9908]),
[iquote('0:SoR:30.0,9908.0')] ).
cnf(16280,plain,
~ axiom(or__dfg(not__dfg(or__dfg(not__dfg(p),q)),or__dfg(q,not__dfg(p)))),
inference(res,[status(thm),theory(equality)],[14047,12]),
[iquote('0:Res:14047.0,12.0')] ).
cnf(16298,plain,
$false,
inference(mrr,[status(thm)],[16280,4]),
[iquote('0:MRR:16280.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.11/0.31 % Computer : n023.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 : Mon Jul 4 09:37:42 EDT 2022
% 0.11/0.31 % CPUTime :
% 12.73/12.99
% 12.73/12.99 SPASS V 3.9
% 12.73/12.99 SPASS beiseite: Proof found.
% 12.73/12.99 % SZS status Theorem
% 12.73/12.99 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.73/12.99 SPASS derived 16274 clauses, backtracked 0 clauses, performed 0 splits and kept 9444 clauses.
% 12.73/12.99 SPASS allocated 101060 KBytes.
% 12.73/12.99 SPASS spent 0:0:12.31 on the problem.
% 12.73/12.99 0:00:00.04 for the input.
% 12.73/12.99 0:00:00.00 for the FLOTTER CNF translation.
% 12.73/12.99 0:00:00.39 for inferences.
% 12.73/12.99 0:00:00.00 for the backtracking.
% 12.73/12.99 0:0:11.70 for the reduction.
% 12.73/12.99
% 12.73/12.99
% 12.73/12.99 Here is a proof with depth 9, length 23 :
% 12.73/12.99 % SZS output start Refutation
% See solution above
% 12.73/12.99 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
% 12.73/12.99
%------------------------------------------------------------------------------