TSTP Solution File: LCL096-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL096-1 : TPTP v8.1.0. Released v1.0.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:34:34 EDT 2022
% Result : Unsatisfiable 3.47s 3.68s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 18 ( 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 : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(u)
| ~ is_a_theorem(equivalent(u,v))
| is_a_theorem(v) ),
file('LCL096-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),equivalent(v,w)),x),x)),
file('LCL096-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),x),equivalent(equivalent(v,w),x)),y),y)),
file('LCL096-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,v),w),x),equivalent(equivalent(equivalent(u,y),w),equivalent(equivalent(v,y),x)))),
file('LCL096-1.p',unknown),
[] ).
cnf(5,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
file('LCL096-1.p',unknown),
[] ).
cnf(14,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(u,v),w),x))
| is_a_theorem(equivalent(equivalent(equivalent(u,y),w),equivalent(equivalent(v,y),x))) ),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.0,1.1')] ).
cnf(48,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),x),y),z),equivalent(equivalent(equivalent(equivalent(v,w),x),y),z))),
inference(sor,[status(thm)],[14,3]),
[iquote('0:SoR:14.0,3.0')] ).
cnf(49,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),x),y),equivalent(equivalent(equivalent(v,w),x),y))),
inference(sor,[status(thm)],[14,2]),
[iquote('0:SoR:14.0,2.0')] ).
cnf(118,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),x),y))
| is_a_theorem(equivalent(equivalent(equivalent(v,w),x),y)) ),
inference(res,[status(thm),theory(equality)],[49,1]),
[iquote('0:Res:49.0,1.1')] ).
cnf(168,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),x),y),z))
| is_a_theorem(equivalent(equivalent(equivalent(equivalent(v,w),x),y),z)) ),
inference(res,[status(thm),theory(equality)],[48,1]),
[iquote('0:Res:48.0,1.1')] ).
cnf(1804,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),w),equivalent(equivalent(x,v),equivalent(equivalent(u,x),w))),y),y)),
inference(sor,[status(thm)],[168,3]),
[iquote('0:SoR:168.0,3.0')] ).
cnf(5266,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(equivalent(v,v),u)),w),w)),
inference(sor,[status(thm)],[118,1804]),
[iquote('0:SoR:118.0,1804.0')] ).
cnf(5286,plain,
$false,
inference(unc,[status(thm)],[5266,5]),
[iquote('0:UnC:5266.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL096-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 04:35:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 3.47/3.68
% 3.47/3.68 SPASS V 3.9
% 3.47/3.68 SPASS beiseite: Proof found.
% 3.47/3.68 % SZS status Theorem
% 3.47/3.68 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.47/3.68 SPASS derived 5274 clauses, backtracked 0 clauses, performed 0 splits and kept 2357 clauses.
% 3.47/3.68 SPASS allocated 83813 KBytes.
% 3.47/3.68 SPASS spent 0:00:03.26 on the problem.
% 3.47/3.68 0:00:00.03 for the input.
% 3.47/3.68 0:00:00.00 for the FLOTTER CNF translation.
% 3.47/3.68 0:00:00.14 for inferences.
% 3.47/3.68 0:00:00.00 for the backtracking.
% 3.47/3.68 0:00:03.03 for the reduction.
% 3.47/3.68
% 3.47/3.68
% 3.47/3.68 Here is a proof with depth 5, length 13 :
% 3.47/3.68 % SZS output start Refutation
% See solution above
% 3.47/3.68 Formulae used in the proof : condensed_detachment lg_2 lg_3 lg_4 prove_lg_1
% 3.47/3.68
%------------------------------------------------------------------------------