TSTP Solution File: LCL048-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL048-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:34:15 EDT 2022
% Result : Unsatisfiable 1.07s 1.27s
% Output : Refutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 20 unt; 0 nHn; 30 RR)
% Number of literals : 42 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(v) ),
file('LCL048-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
file('LCL048-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),u),u)),
file('LCL048-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(u),v))),
file('LCL048-1.p',unknown),
[] ).
cnf(5,axiom,
~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(a,b),c),implies__dfg(b,c))),
file('LCL048-1.p',unknown),
[] ).
cnf(15,plain,
( ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(implies__dfg(implies__dfg(v,w),implies__dfg(u,w))) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.0,1.1')] ).
cnf(17,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),x),implies__dfg(implies__dfg(w,u),x))),
inference(sor,[status(thm)],[15,2]),
[iquote('0:SoR:15.0,2.0')] ).
cnf(18,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),v),w),implies__dfg(u,w))),
inference(sor,[status(thm)],[15,4]),
[iquote('0:SoR:15.0,4.0')] ).
cnf(19,plain,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(not__dfg(u),u),v))),
inference(sor,[status(thm)],[15,3]),
[iquote('0:SoR:15.0,3.0')] ).
cnf(21,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),v),w))
| is_a_theorem(implies__dfg(u,w)) ),
inference(res,[status(thm),theory(equality)],[18,1]),
[iquote('0:Res:18.0,1.1')] ).
cnf(22,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),u),v),w),implies__dfg(implies__dfg(u,v),w))),
inference(sor,[status(thm)],[15,19]),
[iquote('0:SoR:15.0,19.0')] ).
cnf(23,plain,
( ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),u),v)) ),
inference(res,[status(thm),theory(equality)],[19,1]),
[iquote('0:Res:19.0,1.1')] ).
cnf(35,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),x))
| is_a_theorem(implies__dfg(implies__dfg(w,u),x)) ),
inference(res,[status(thm),theory(equality)],[17,1]),
[iquote('0:Res:17.0,1.1')] ).
cnf(61,plain,
is_a_theorem(implies__dfg(implies__dfg(not__dfg(implies__dfg(not__dfg(u),u)),implies__dfg(not__dfg(u),u)),u)),
inference(sor,[status(thm)],[23,3]),
[iquote('0:SoR:23.0,3.0')] ).
cnf(110,plain,
is_a_theorem(implies__dfg(implies__dfg(u,not__dfg(v)),implies__dfg(v,implies__dfg(u,w)))),
inference(sor,[status(thm)],[35,18]),
[iquote('0:SoR:35.0,18.0')] ).
cnf(111,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),v)),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
inference(sor,[status(thm)],[35,22]),
[iquote('0:SoR:35.0,22.0')] ).
cnf(124,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(not__dfg(u),w)))),
inference(sor,[status(thm)],[21,110]),
[iquote('0:SoR:21.0,110.0')] ).
cnf(127,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),w)),x),implies__dfg(v,x))),
inference(sor,[status(thm)],[15,124]),
[iquote('0:SoR:15.0,124.0')] ).
cnf(168,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),w)),x))
| is_a_theorem(implies__dfg(v,x)) ),
inference(res,[status(thm),theory(equality)],[127,1]),
[iquote('0:Res:127.0,1.1')] ).
cnf(173,plain,
( ~ is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(v),v)))
| is_a_theorem(implies__dfg(implies__dfg(v,w),implies__dfg(u,w))) ),
inference(res,[status(thm),theory(equality)],[111,1]),
[iquote('0:Res:111.0,1.1')] ).
cnf(228,plain,
is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(u,v),implies__dfg(w,v)))),
inference(sor,[status(thm)],[168,111]),
[iquote('0:SoR:168.0,111.0')] ).
cnf(246,plain,
( ~ is_a_theorem(u)
| is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(w,v))) ),
inference(res,[status(thm),theory(equality)],[228,1]),
[iquote('0:Res:228.0,1.1')] ).
cnf(268,plain,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(implies__dfg(w,v)) ),
inference(res,[status(thm),theory(equality)],[246,1]),
[iquote('0:Res:246.1,1.1')] ).
cnf(309,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),v),w))
| is_a_theorem(implies__dfg(x,implies__dfg(u,w))) ),
inference(sor,[status(thm)],[268,18]),
[iquote('0:SoR:268.1,18.0')] ).
cnf(1256,plain,
is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(not__dfg(v),v),v))),
inference(sor,[status(thm)],[309,61]),
[iquote('0:SoR:309.0,61.0')] ).
cnf(1377,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),u),u),v),implies__dfg(w,v))),
inference(sor,[status(thm)],[15,1256]),
[iquote('0:SoR:15.0,1256.0')] ).
cnf(2220,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),v)),implies__dfg(w,implies__dfg(u,v)))),
inference(sor,[status(thm)],[35,1377]),
[iquote('0:SoR:35.0,1377.0')] ).
cnf(3665,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(w,u)))),
inference(sor,[status(thm)],[168,2220]),
[iquote('0:SoR:168.0,2220.0')] ).
cnf(3674,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(v,w))),
inference(sor,[status(thm)],[173,3665]),
[iquote('0:SoR:173.0,3665.0')] ).
cnf(3694,plain,
$false,
inference(unc,[status(thm)],[3674,5]),
[iquote('0:UnC:3674.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL048-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Mon Jul 4 09:56:59 EDT 2022
% 0.13/0.36 % CPUTime :
% 1.07/1.27
% 1.07/1.27 SPASS V 3.9
% 1.07/1.27 SPASS beiseite: Proof found.
% 1.07/1.27 % SZS status Theorem
% 1.07/1.27 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.27 SPASS derived 3654 clauses, backtracked 0 clauses, performed 0 splits and kept 1421 clauses.
% 1.07/1.27 SPASS allocated 80983 KBytes.
% 1.07/1.27 SPASS spent 0:00:00.87 on the problem.
% 1.07/1.27 0:00:00.03 for the input.
% 1.07/1.27 0:00:00.00 for the FLOTTER CNF translation.
% 1.07/1.27 0:00:00.10 for inferences.
% 1.07/1.27 0:00:00.00 for the backtracking.
% 1.07/1.27 0:00:00.71 for the reduction.
% 1.07/1.27
% 1.07/1.27
% 1.07/1.27 Here is a proof with depth 16, length 30 :
% 1.07/1.27 % SZS output start Refutation
% See solution above
% 1.07/1.27 Formulae used in the proof : condensed_detachment cn_1 cn_2 cn_3 prove_cn_19
% 1.07/1.27
%------------------------------------------------------------------------------