TSTP Solution File: LCL067-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL067-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:22 EDT 2022
% Result : Unsatisfiable 156.04s 156.22s
% Output : Refutation 156.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 18 unt; 0 nHn; 26 RR)
% Number of literals : 35 ( 0 equ; 10 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 : 10 ( 10 usr; 8 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('LCL067-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(v,w))),
file('LCL067-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(not__dfg(u),w))),
file('LCL067-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),v),implies__dfg(implies__dfg(w,v),implies__dfg(implies__dfg(u,w),v)))),
file('LCL067-1.p',unknown),
[] ).
cnf(5,axiom,
~ is_a_theorem(implies__dfg(implies__dfg(a,b),implies__dfg(implies__dfg(b,c),implies__dfg(a,c)))),
file('LCL067-1.p',unknown),
[] ).
cnf(11,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
| is_a_theorem(implies__dfg(v,w)) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.0,1.1')] ).
cnf(12,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
| is_a_theorem(implies__dfg(not__dfg(u),w)) ),
inference(res,[status(thm),theory(equality)],[3,1]),
[iquote('0:Res:3.0,1.1')] ).
cnf(14,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,u))),
inference(sor,[status(thm)],[11,2]),
[iquote('0:SoR:11.0,2.0')] ).
cnf(15,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(w,u)))),
inference(sor,[status(thm)],[11,14]),
[iquote('0:SoR:11.0,14.0')] ).
cnf(24,plain,
( ~ is_a_theorem(implies__dfg(not__dfg(u),v))
| is_a_theorem(implies__dfg(implies__dfg(w,v),implies__dfg(implies__dfg(u,w),v))) ),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.0,1.1')] ).
cnf(37,plain,
is_a_theorem(implies__dfg(not__dfg(implies__dfg(u,v)),implies__dfg(v,w))),
inference(sor,[status(thm)],[12,2]),
[iquote('0:SoR:12.0,2.0')] ).
cnf(40,plain,
is_a_theorem(implies__dfg(not__dfg(u),implies__dfg(v,implies__dfg(u,w)))),
inference(sor,[status(thm)],[12,14]),
[iquote('0:SoR:12.0,14.0')] ).
cnf(45,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(v,implies__dfg(w,x))),implies__dfg(implies__dfg(w,u),implies__dfg(v,implies__dfg(w,x))))),
inference(sor,[status(thm)],[24,40]),
[iquote('0:SoR:24.0,40.0')] ).
cnf(46,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(v,w)),implies__dfg(implies__dfg(implies__dfg(x,v),u),implies__dfg(v,w)))),
inference(sor,[status(thm)],[24,37]),
[iquote('0:SoR:24.0,37.0')] ).
cnf(89,plain,
is_a_theorem(implies__dfg(not__dfg(u),implies__dfg(implies__dfg(implies__dfg(v,w),u),implies__dfg(w,x)))),
inference(sor,[status(thm)],[12,46]),
[iquote('0:SoR:12.0,46.0')] ).
cnf(91,plain,
( ~ is_a_theorem(implies__dfg(u,implies__dfg(v,w)))
| is_a_theorem(implies__dfg(implies__dfg(implies__dfg(x,v),u),implies__dfg(v,w))) ),
inference(res,[status(thm),theory(equality)],[46,1]),
[iquote('0:Res:46.0,1.1')] ).
cnf(95,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(implies__dfg(implies__dfg(v,w),x),implies__dfg(w,y))),implies__dfg(implies__dfg(x,u),implies__dfg(implies__dfg(implies__dfg(v,w),x),implies__dfg(w,y))))),
inference(sor,[status(thm)],[24,89]),
[iquote('0:SoR:24.0,89.0')] ).
cnf(145,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(v,implies__dfg(x,w)))),
inference(sor,[status(thm)],[91,15]),
[iquote('0:SoR:91.0,15.0')] ).
cnf(184,plain,
( ~ is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(w,x))))
| is_a_theorem(implies__dfg(implies__dfg(w,u),implies__dfg(v,implies__dfg(w,x)))) ),
inference(res,[status(thm),theory(equality)],[45,1]),
[iquote('0:Res:45.0,1.1')] ).
cnf(1254,plain,
is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(implies__dfg(v,w),x)),implies__dfg(w,implies__dfg(u,x)))),
inference(sor,[status(thm)],[184,145]),
[iquote('0:SoR:184.0,145.0')] ).
cnf(2379,plain,
( ~ is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(implies__dfg(v,w),x),implies__dfg(w,y))))
| is_a_theorem(implies__dfg(implies__dfg(x,u),implies__dfg(implies__dfg(implies__dfg(v,w),x),implies__dfg(w,y)))) ),
inference(res,[status(thm),theory(equality)],[95,1]),
[iquote('0:Res:95.0,1.1')] ).
cnf(3734,plain,
( ~ is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(v,w),x)))
| is_a_theorem(implies__dfg(w,implies__dfg(u,x))) ),
inference(res,[status(thm),theory(equality)],[1254,1]),
[iquote('0:Res:1254.0,1.1')] ).
cnf(38039,plain,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(implies__dfg(w,x),u),implies__dfg(x,v)))),
inference(sor,[status(thm)],[2379,15]),
[iquote('0:SoR:2379.0,15.0')] ).
cnf(66400,plain,
is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(u,v),implies__dfg(w,v)))),
inference(sor,[status(thm)],[3734,38039]),
[iquote('0:SoR:3734.0,38039.0')] ).
cnf(69154,plain,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
inference(sor,[status(thm)],[184,66400]),
[iquote('0:SoR:184.0,66400.0')] ).
cnf(69178,plain,
$false,
inference(unc,[status(thm)],[69154,5]),
[iquote('0:UnC:69154.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL067-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 21:27:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 156.04/156.22
% 156.04/156.22 SPASS V 3.9
% 156.04/156.22 SPASS beiseite: Proof found.
% 156.04/156.22 % SZS status Theorem
% 156.04/156.22 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 156.04/156.22 SPASS derived 69000 clauses, backtracked 0 clauses, performed 0 splits and kept 32189 clauses.
% 156.04/156.22 SPASS allocated 168457 KBytes.
% 156.04/156.22 SPASS spent 0:2:34.01 on the problem.
% 156.04/156.22 0:00:00.04 for the input.
% 156.04/156.22 0:00:00.00 for the FLOTTER CNF translation.
% 156.04/156.22 0:00:01.45 for inferences.
% 156.04/156.22 0:00:00.00 for the backtracking.
% 156.04/156.22 0:2:31.72 for the reduction.
% 156.04/156.22
% 156.04/156.22
% 156.04/156.22 Here is a proof with depth 9, length 26 :
% 156.04/156.22 % SZS output start Refutation
% See solution above
% 156.04/156.22 Formulae used in the proof : condensed_detachment cn_19 cn_37 cn_59 prove_cn_1
% 156.04/156.22
%------------------------------------------------------------------------------