TSTP Solution File: LCL107-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL107-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:38 EDT 2022
% Result : Unsatisfiable 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 19 unt; 0 nHn; 28 RR)
% Number of literals : 38 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 14 ( 14 usr; 13 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('LCL107-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,v),w),equivalent(equivalent(x,y),equivalent(equivalent(equivalent(z,y),equivalent(z,x)),x1))),equivalent(w,equivalent(equivalent(v,u),x1)))),
file('LCL107-1.p',unknown),
[] ).
cnf(3,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('LCL107-1.p',unknown),
[] ).
cnf(7,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(u,v),w),equivalent(equivalent(x,y),equivalent(equivalent(equivalent(z,y),equivalent(z,x)),x1))))
| is_a_theorem(equivalent(w,equivalent(equivalent(v,u),x1))) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.0,1.1')] ).
cnf(8,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,v),equivalent(equivalent(equivalent(w,v),equivalent(w,u)),x)),equivalent(equivalent(equivalent(y,z),equivalent(equivalent(x1,y),equivalent(x1,z))),x))),
inference(sor,[status(thm)],[7,2]),
[iquote('0:SoR:7.0,2.0')] ).
cnf(9,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),equivalent(equivalent(equivalent(x,equivalent(equivalent(y,z),equivalent(y,x1))),equivalent(x,equivalent(z,x1))),x2)),equivalent(equivalent(v,w),x2))),
inference(sor,[status(thm)],[7,8]),
[iquote('0:SoR:7.0,8.0')] ).
cnf(11,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,equivalent(equivalent(v,w),equivalent(v,x))),equivalent(u,equivalent(w,x))),equivalent(equivalent(equivalent(y,z),equivalent(y,x1)),x2)),equivalent(equivalent(equivalent(x3,z),equivalent(x3,x1)),x2))),
inference(sor,[status(thm)],[7,9]),
[iquote('0:SoR:7.0,9.0')] ).
cnf(12,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),equivalent(equivalent(equivalent(x,equivalent(equivalent(y,z),equivalent(y,x1))),equivalent(x,equivalent(z,x1))),x2)))
| is_a_theorem(equivalent(equivalent(v,w),x2)) ),
inference(res,[status(thm),theory(equality)],[9,1]),
[iquote('0:Res:9.0,1.1')] ).
cnf(14,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,equivalent(equivalent(v,w),equivalent(v,x))),equivalent(u,equivalent(w,x))),equivalent(equivalent(equivalent(y,z),equivalent(y,x1)),x2)),equivalent(equivalent(z,x1),x2))),
inference(sor,[status(thm)],[12,2]),
[iquote('0:SoR:12.0,2.0')] ).
cnf(20,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(equivalent(v,w),equivalent(v,x))),equivalent(u,equivalent(w,x))),equivalent(equivalent(equivalent(y,z),equivalent(y,x1)),x2)))
| is_a_theorem(equivalent(equivalent(equivalent(x3,z),equivalent(x3,x1)),x2)) ),
inference(res,[status(thm),theory(equality)],[11,1]),
[iquote('0:Res:11.0,1.1')] ).
cnf(30,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,equivalent(equivalent(w,x),equivalent(w,y)))),equivalent(v,equivalent(x,y))),z),z)),
inference(sor,[status(thm)],[12,14]),
[iquote('0:SoR:12.0,14.0')] ).
cnf(35,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(u,equivalent(v,w)),equivalent(u,equivalent(v,x))),equivalent(w,x)),y),y)),
inference(sor,[status(thm)],[12,30]),
[iquote('0:SoR:12.0,30.0')] ).
cnf(38,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,equivalent(v,w)),equivalent(u,equivalent(v,x))),equivalent(w,x)),y))
| is_a_theorem(y) ),
inference(res,[status(thm),theory(equality)],[35,1]),
[iquote('0:Res:35.0,1.1')] ).
cnf(43,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(v,w)),equivalent(u,x)),equivalent(equivalent(equivalent(y,v),equivalent(y,w)),x))),
inference(sor,[status(thm)],[20,9]),
[iquote('0:SoR:20.0,9.0')] ).
cnf(44,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(equivalent(v,w),equivalent(v,x))),equivalent(u,y)),equivalent(equivalent(w,x),y))),
inference(sor,[status(thm)],[20,2]),
[iquote('0:SoR:20.0,2.0')] ).
cnf(47,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),equivalent(equivalent(x,v),equivalent(x,w)))),
inference(sor,[status(thm)],[20,44]),
[iquote('0:SoR:20.0,44.0')] ).
cnf(51,plain,
( ~ is_a_theorem(equivalent(equivalent(u,v),equivalent(u,w)))
| is_a_theorem(equivalent(equivalent(x,v),equivalent(x,w))) ),
inference(res,[status(thm),theory(equality)],[47,1]),
[iquote('0:Res:47.0,1.1')] ).
cnf(60,plain,
is_a_theorem(equivalent(equivalent(u,equivalent(v,w)),equivalent(u,equivalent(v,w)))),
inference(sor,[status(thm)],[51,47]),
[iquote('0:SoR:51.0,47.0')] ).
cnf(63,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),x),equivalent(equivalent(v,w),x))),
inference(sor,[status(thm)],[7,60]),
[iquote('0:SoR:7.0,60.0')] ).
cnf(75,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,v),equivalent(u,w)),equivalent(v,w))),
inference(sor,[status(thm)],[38,63]),
[iquote('0:SoR:38.0,63.0')] ).
cnf(81,plain,
( ~ is_a_theorem(equivalent(equivalent(u,v),equivalent(u,w)))
| is_a_theorem(equivalent(v,w)) ),
inference(res,[status(thm),theory(equality)],[75,1]),
[iquote('0:Res:75.0,1.1')] ).
cnf(106,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,u),v),v)),
inference(sor,[status(thm)],[81,43]),
[iquote('0:SoR:81.0,43.0')] ).
cnf(123,plain,
( ~ is_a_theorem(equivalent(equivalent(u,u),v))
| is_a_theorem(v) ),
inference(res,[status(thm),theory(equality)],[106,1]),
[iquote('0:Res:106.0,1.1')] ).
cnf(124,plain,
is_a_theorem(equivalent(equivalent(u,v),equivalent(equivalent(w,u),equivalent(w,v)))),
inference(sor,[status(thm)],[123,63]),
[iquote('0:SoR:123.0,63.0')] ).
cnf(172,plain,
( ~ is_a_theorem(equivalent(u,v))
| is_a_theorem(equivalent(equivalent(w,u),equivalent(w,v))) ),
inference(res,[status(thm),theory(equality)],[124,1]),
[iquote('0:Res:124.0,1.1')] ).
cnf(222,plain,
is_a_theorem(equivalent(equivalent(u,equivalent(v,w)),equivalent(u,equivalent(equivalent(x,v),equivalent(x,w))))),
inference(sor,[status(thm)],[172,124]),
[iquote('0:SoR:172.0,124.0')] ).
cnf(442,plain,
is_a_theorem(equivalent(equivalent(equivalent(u,v),w),equivalent(equivalent(x,v),equivalent(equivalent(u,x),w)))),
inference(sor,[status(thm)],[7,222]),
[iquote('0:SoR:7.0,222.0')] ).
cnf(456,plain,
$false,
inference(unc,[status(thm)],[442,3]),
[iquote('0:UnC:442.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL107-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 21:58:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.54
% 0.19/0.54 SPASS V 3.9
% 0.19/0.54 SPASS beiseite: Proof found.
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 SPASS derived 449 clauses, backtracked 0 clauses, performed 0 splits and kept 237 clauses.
% 0.19/0.54 SPASS allocated 76906 KBytes.
% 0.19/0.54 SPASS spent 0:00:00.18 on the problem.
% 0.19/0.54 0:00:00.04 for the input.
% 0.19/0.54 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.54 0:00:00.03 for inferences.
% 0.19/0.54 0:00:00.00 for the backtracking.
% 0.19/0.54 0:00:00.09 for the reduction.
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Here is a proof with depth 18, length 28 :
% 0.19/0.54 % SZS output start Refutation
% See solution above
% 0.19/0.54 Formulae used in the proof : condensed_detachment lg_27_1690 prove_p_1
% 0.19/0.54
%------------------------------------------------------------------------------