TSTP Solution File: LCL075-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL075-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:24 EDT 2022
% Result : Unsatisfiable 0.91s 1.13s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 11 unt; 0 nHn; 15 RR)
% Number of literals : 20 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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('LCL075-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(not__dfg(w),not__dfg(x))),w),y),implies__dfg(implies__dfg(y,u),implies__dfg(x,u)))),
file('LCL075-1.p',unknown),
[] ).
cnf(3,axiom,
~ is_a_theorem(implies__dfg(a,implies__dfg(not__dfg(a),b))),
file('LCL075-1.p',unknown),
[] ).
cnf(7,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(not__dfg(w),not__dfg(x))),w),y))
| is_a_theorem(implies__dfg(implies__dfg(y,u),implies__dfg(x,u))) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.0,1.1')] ).
cnf(8,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),implies__dfg(v,x)),implies__dfg(y,implies__dfg(v,x)))),
inference(sor,[status(thm)],[7,2]),
[iquote('0:SoR:7.0,2.0')] ).
cnf(9,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)],[7,8]),
[iquote('0:SoR:7.0,8.0')] ).
cnf(11,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,u),v),implies__dfg(w,v))),
inference(sor,[status(thm)],[7,9]),
[iquote('0:SoR:7.0,9.0')] ).
cnf(14,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,u),v))
| is_a_theorem(implies__dfg(w,v)) ),
inference(res,[status(thm),theory(equality)],[11,1]),
[iquote('0:Res:11.0,1.1')] ).
cnf(15,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(w,w)))),
inference(sor,[status(thm)],[14,11]),
[iquote('0:SoR:14.0,11.0')] ).
cnf(18,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,implies__dfg(v,v)),w),implies__dfg(x,w))),
inference(sor,[status(thm)],[7,15]),
[iquote('0:SoR:7.0,15.0')] ).
cnf(221,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(v,w))),
inference(sor,[status(thm)],[7,18]),
[iquote('0:SoR:7.0,18.0')] ).
cnf(233,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),not__dfg(v)),u),w),implies__dfg(v,w))),
inference(sor,[status(thm)],[7,221]),
[iquote('0:SoR:7.0,221.0')] ).
cnf(905,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),not__dfg(v)),u),w))
| is_a_theorem(implies__dfg(v,w)) ),
inference(res,[status(thm),theory(equality)],[233,1]),
[iquote('0:Res:233.0,1.1')] ).
cnf(5216,plain,
is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(u),v))),
inference(sor,[status(thm)],[905,221]),
[iquote('0:SoR:905.0,221.0')] ).
cnf(5305,plain,
$false,
inference(unc,[status(thm)],[5216,3]),
[iquote('0:UnC:5216.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL075-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.09 % Command : run_spass %d %s
% 0.08/0.29 % Computer : n011.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Sun Jul 3 16:00:20 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.91/1.13
% 0.91/1.13 SPASS V 3.9
% 0.91/1.13 SPASS beiseite: Proof found.
% 0.91/1.13 % SZS status Theorem
% 0.91/1.13 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/1.13 SPASS derived 5095 clauses, backtracked 0 clauses, performed 0 splits and kept 810 clauses.
% 0.91/1.13 SPASS allocated 80333 KBytes.
% 0.91/1.13 SPASS spent 0:00:00.79 on the problem.
% 0.91/1.13 0:00:00.03 for the input.
% 0.91/1.13 0:00:00.00 for the FLOTTER CNF translation.
% 0.91/1.13 0:00:00.16 for inferences.
% 0.91/1.13 0:00:00.00 for the backtracking.
% 0.91/1.13 0:00:00.57 for the reduction.
% 0.91/1.13
% 0.91/1.13
% 0.91/1.13 Here is a proof with depth 11, length 15 :
% 0.91/1.13 % SZS output start Refutation
% See solution above
% 0.91/1.13 Formulae used in the proof : condensed_detachment cn_CAMerideth prove_cn_3
% 0.91/1.13
%------------------------------------------------------------------------------