TSTP Solution File: LCL361-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL361-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:36:28 EDT 2022
% Result : Unsatisfiable 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 21 ( 0 equ; 7 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 : 8 ( 8 usr; 6 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('LCL361-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('LCL361-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(u),v))),
file('LCL361-1.p',unknown),
[] ).
cnf(5,axiom,
~ is_a_theorem(implies__dfg(x__dfg,implies__dfg(implies__dfg(implies__dfg(not__dfg(x__dfg),x__dfg),x__dfg),implies__dfg(implies__dfg(y__dfg,x__dfg),x__dfg)))),
file('LCL361-1.p',unknown),
[] ).
cnf(13,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)],[13,2]),
[iquote('0:SoR:13.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)],[13,4]),
[iquote('0:SoR:13.0,4.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(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(116,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(124,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(not__dfg(u),w)))),
inference(sor,[status(thm)],[21,116]),
[iquote('0:SoR:21.0,116.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)],[13,124]),
[iquote('0:SoR:13.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(236,plain,
is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(implies__dfg(not__dfg(u),v),w),implies__dfg(x,w)))),
inference(sor,[status(thm)],[168,2]),
[iquote('0:SoR:168.0,2.0')] ).
cnf(241,plain,
$false,
inference(unc,[status(thm)],[236,5]),
[iquote('0:UnC:236.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL361-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 19:24:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 227 clauses, backtracked 0 clauses, performed 0 splits and kept 151 clauses.
% 0.20/0.45 SPASS allocated 76094 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.03 for the input.
% 0.20/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.01 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.03 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 8, length 15 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : condensed_detachment cn_1 cn_3 prove_cn_10
% 0.20/0.45
%------------------------------------------------------------------------------