TSTP Solution File: LCL111-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL111-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:41 EDT 2022
% Result : Unsatisfiable 19.27s 19.46s
% Output : Refutation 19.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 28 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 8 ( 8 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('LCL111-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(u,implies__dfg(v,u))),
file('LCL111-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
file('LCL111-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),v),implies__dfg(implies__dfg(v,u),u))),
file('LCL111-1.p',unknown),
[] ).
cnf(6,axiom,
~ is_a_theorem(implies__dfg(implies__dfg(a,b),implies__dfg(implies__dfg(c,a),implies__dfg(c,b)))),
file('LCL111-1.p',unknown),
[] ).
cnf(13,plain,
( ~ is_a_theorem(u)
| is_a_theorem(implies__dfg(v,u)) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.0,1.1')] ).
cnf(16,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),v))
| is_a_theorem(implies__dfg(implies__dfg(v,u),u)) ),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.0,1.1')] ).
cnf(18,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)],[3,1]),
[iquote('0:Res:3.0,1.1')] ).
cnf(20,plain,
( ~ is_a_theorem(u)
| is_a_theorem(implies__dfg(implies__dfg(u,v),v)) ),
inference(sor,[status(thm)],[16,13]),
[iquote('0:SoR:16.0,13.1')] ).
cnf(24,plain,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(v) ),
inference(res,[status(thm),theory(equality)],[20,1]),
[iquote('0:Res:20.1,1.1')] ).
cnf(27,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)],[18,3]),
[iquote('0:SoR:18.0,3.0')] ).
cnf(28,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),v),w),implies__dfg(implies__dfg(implies__dfg(v,u),u),w))),
inference(sor,[status(thm)],[18,4]),
[iquote('0:SoR:18.0,4.0')] ).
cnf(30,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(v,w))),
inference(sor,[status(thm)],[18,2]),
[iquote('0:SoR:18.0,2.0')] ).
cnf(37,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
| is_a_theorem(implies__dfg(v,w)) ),
inference(sor,[status(thm)],[24,30]),
[iquote('0:SoR:24.1,30.0')] ).
cnf(101,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),v),w))
| is_a_theorem(implies__dfg(implies__dfg(implies__dfg(v,u),u),w)) ),
inference(sor,[status(thm)],[24,28]),
[iquote('0:SoR:24.1,28.0')] ).
cnf(666,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),implies__dfg(w,v)),implies__dfg(implies__dfg(u,w),implies__dfg(u,v)))),
inference(sor,[status(thm)],[101,27]),
[iquote('0:SoR:101.0,27.0')] ).
cnf(17787,plain,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(w,u),implies__dfg(w,v)))),
inference(sor,[status(thm)],[37,666]),
[iquote('0:SoR:37.0,666.0')] ).
cnf(17797,plain,
$false,
inference(unc,[status(thm)],[17787,6]),
[iquote('0:UnC:17787.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL111-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 14:34:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 19.27/19.46
% 19.27/19.46 SPASS V 3.9
% 19.27/19.46 SPASS beiseite: Proof found.
% 19.27/19.46 % SZS status Theorem
% 19.27/19.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.27/19.46 SPASS derived 17588 clauses, backtracked 0 clauses, performed 0 splits and kept 9258 clauses.
% 19.27/19.46 SPASS allocated 100161 KBytes.
% 19.27/19.46 SPASS spent 0:0:18.80 on the problem.
% 19.27/19.46 0:00:00.04 for the input.
% 19.27/19.46 0:00:00.00 for the FLOTTER CNF translation.
% 19.27/19.46 0:00:00.29 for inferences.
% 19.27/19.46 0:00:00.00 for the backtracking.
% 19.27/19.46 0:0:18.36 for the reduction.
% 19.27/19.46
% 19.27/19.46
% 19.27/19.46 Here is a proof with depth 6, length 18 :
% 19.27/19.46 % SZS output start Refutation
% See solution above
% 19.27/19.46 Formulae used in the proof : condensed_detachment mv_1 mv_2 mv_3 prove_mv_25
% 19.27/19.46
%------------------------------------------------------------------------------