TSTP Solution File: LCL033-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL033-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:10 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% 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 : 9 ( 9 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('LCL033-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,falsehood)),x),y),implies__dfg(implies__dfg(y,u),implies__dfg(w,u)))),
file('LCL033-1.p',unknown),
[] ).
cnf(3,axiom,
~ is_a_theorem(implies__dfg(a,implies__dfg(b,a))),
file('LCL033-1.p',unknown),
[] ).
cnf(7,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,falsehood)),x),y))
| is_a_theorem(implies__dfg(implies__dfg(y,u),implies__dfg(w,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(falsehood,v)),w),implies__dfg(x,w))),
inference(sor,[status(thm)],[7,8]),
[iquote('0:SoR:7.0,8.0')] ).
cnf(10,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),implies__dfg(v,x)))
| is_a_theorem(implies__dfg(y,implies__dfg(v,x))) ),
inference(res,[status(thm),theory(equality)],[8,1]),
[iquote('0:Res:8.0,1.1')] ).
cnf(11,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(falsehood,w))),
inference(sor,[status(thm)],[7,9]),
[iquote('0:SoR:7.0,9.0')] ).
cnf(13,plain,
is_a_theorem(implies__dfg(implies__dfg(implies__dfg(falsehood,u),v),implies__dfg(w,v))),
inference(sor,[status(thm)],[7,11]),
[iquote('0:SoR:7.0,11.0')] ).
cnf(14,plain,
( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
| is_a_theorem(implies__dfg(falsehood,w)) ),
inference(res,[status(thm),theory(equality)],[11,1]),
[iquote('0:Res:11.0,1.1')] ).
cnf(16,plain,
is_a_theorem(implies__dfg(falsehood,implies__dfg(u,v))),
inference(sor,[status(thm)],[14,13]),
[iquote('0:SoR:14.0,13.0')] ).
cnf(21,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(w,v)))),
inference(sor,[status(thm)],[10,13]),
[iquote('0:SoR:10.0,13.0')] ).
cnf(29,plain,
( ~ is_a_theorem(u)
| is_a_theorem(implies__dfg(v,implies__dfg(w,v))) ),
inference(res,[status(thm),theory(equality)],[21,1]),
[iquote('0:Res:21.0,1.1')] ).
cnf(30,plain,
is_a_theorem(implies__dfg(u,implies__dfg(v,u))),
inference(ems,[status(thm)],[29,16]),
[iquote('0:EmS:29.0,16.0')] ).
cnf(37,plain,
$false,
inference(unc,[status(thm)],[30,3]),
[iquote('0:UnC:30.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL033-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % 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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 10:29:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 30 clauses, backtracked 0 clauses, performed 0 splits and kept 24 clauses.
% 0.20/0.42 SPASS allocated 75652 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.42 0:00:00.03 for the input.
% 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 8, length 15 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : condensed_detachment c0_CAMerideth prove_c0_2
% 0.20/0.42
%------------------------------------------------------------------------------