TSTP Solution File: LCL664+1.005 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL664+1.005 : TPTP v8.1.0. Released v4.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:38:41 EDT 2022
% Result : Theorem 1.39s 1.61s
% Output : Refutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 8 unt; 0 nHn; 21 RR)
% Number of literals : 60 ( 0 equ; 40 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
r1(skc5,skc72),
file('LCL664+1.005.p',unknown),
[] ).
cnf(7,axiom,
~ p12(skc72),
file('LCL664+1.005.p',unknown),
[] ).
cnf(12,axiom,
r1(u,skf125(u)),
file('LCL664+1.005.p',unknown),
[] ).
cnf(19,axiom,
r1(u,skf118(u)),
file('LCL664+1.005.p',unknown),
[] ).
cnf(40,axiom,
r1(u,skf97(u)),
file('LCL664+1.005.p',unknown),
[] ).
cnf(51,axiom,
r1(u,skf86(u)),
file('LCL664+1.005.p',unknown),
[] ).
cnf(84,axiom,
( ~ p21(skf125(u))
| ~ r1(skc5,u)
| p12(u) ),
file('LCL664+1.005.p',unknown),
[] ).
cnf(103,axiom,
( ~ p34(skf118(u))
| ~ r1(v,u)
| ~ r1(skc5,v)
| p21(u) ),
file('LCL664+1.005.p',unknown),
[] ).
cnf(114,axiom,
( ~ p41(skf97(u))
| ~ r1(v,u)
| ~ r1(w,v)
| ~ r1(skc5,w)
| p34(u) ),
file('LCL664+1.005.p',unknown),
[] ).
cnf(121,axiom,
( ~ p54(skf86(u))
| ~ r1(v,u)
| ~ r1(w,v)
| ~ r1(x,w)
| ~ r1(skc5,x)
| p41(u) ),
file('LCL664+1.005.p',unknown),
[] ).
cnf(139,axiom,
( ~ r1(u,v)
| ~ r1(w,u)
| ~ r1(x,w)
| ~ r1(y,x)
| ~ r1(skc5,y)
| p54(v) ),
file('LCL664+1.005.p',unknown),
[] ).
cnf(1027,plain,
( ~ r1(u,v)
| ~ r1(w,u)
| ~ r1(x,w)
| ~ r1(skc5,x)
| p54(skf86(v)) ),
inference(res,[status(thm),theory(equality)],[51,139]),
[iquote('0:Res:51.0,139.0')] ).
cnf(1069,plain,
( ~ r1(u,v)
| ~ r1(w,u)
| ~ r1(x,w)
| ~ r1(skc5,x)
| p41(v) ),
inference(mrr,[status(thm)],[121,1027]),
[iquote('0:MRR:121.0,1027.4')] ).
cnf(1108,plain,
( ~ r1(u,v)
| ~ r1(w,u)
| ~ r1(skc5,w)
| p41(skf97(v)) ),
inference(res,[status(thm),theory(equality)],[40,1069]),
[iquote('0:Res:40.0,1069.0')] ).
cnf(1139,plain,
( ~ r1(u,v)
| ~ r1(w,u)
| ~ r1(skc5,w)
| p34(v) ),
inference(mrr,[status(thm)],[114,1108]),
[iquote('0:MRR:114.0,1108.3')] ).
cnf(1199,plain,
( ~ r1(u,v)
| ~ r1(skc5,u)
| p34(skf118(v)) ),
inference(res,[status(thm),theory(equality)],[19,1139]),
[iquote('0:Res:19.0,1139.0')] ).
cnf(1209,plain,
( ~ r1(u,v)
| ~ r1(skc5,u)
| p21(v) ),
inference(mrr,[status(thm)],[103,1199]),
[iquote('0:MRR:103.0,1199.2')] ).
cnf(1276,plain,
( ~ r1(skc5,u)
| p21(skf125(u)) ),
inference(res,[status(thm),theory(equality)],[12,1209]),
[iquote('0:Res:12.0,1209.0')] ).
cnf(1283,plain,
( ~ r1(skc5,u)
| p12(u) ),
inference(mrr,[status(thm)],[84,1276]),
[iquote('0:MRR:84.0,1276.1')] ).
cnf(1286,plain,
p12(skc72),
inference(res,[status(thm),theory(equality)],[2,1283]),
[iquote('0:Res:2.0,1283.0')] ).
cnf(1353,plain,
$false,
inference(mrr,[status(thm)],[1286,7]),
[iquote('0:MRR:1286.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL664+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : Mon Jul 4 18:07:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.39/1.61
% 1.39/1.61 SPASS V 3.9
% 1.39/1.61 SPASS beiseite: Proof found.
% 1.39/1.61 % SZS status Theorem
% 1.39/1.61 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.61 SPASS derived 1193 clauses, backtracked 0 clauses, performed 0 splits and kept 1333 clauses.
% 1.39/1.61 SPASS allocated 86165 KBytes.
% 1.39/1.61 SPASS spent 0:00:01.26 on the problem.
% 1.39/1.61 0:00:00.04 for the input.
% 1.39/1.61 0:00:00.10 for the FLOTTER CNF translation.
% 1.39/1.61 0:00:00.01 for inferences.
% 1.39/1.61 0:00:00.00 for the backtracking.
% 1.39/1.61 0:00:01.07 for the reduction.
% 1.39/1.61
% 1.39/1.61
% 1.39/1.61 Here is a proof with depth 1, length 21 :
% 1.39/1.61 % SZS output start Refutation
% See solution above
% 1.39/1.61 Formulae used in the proof : main reflexivity
% 1.39/1.61
%------------------------------------------------------------------------------