TSTP Solution File: COM017+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COM017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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 : Fri Jul 15 01:44:19 EDT 2022
% Result : Theorem 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 24 RR)
% Number of literals : 66 ( 0 equ; 47 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aRewritingSystem0(xR),
file('COM017+1.p',unknown),
[] ).
cnf(2,axiom,
isLocallyConfluent0(xR),
file('COM017+1.p',unknown),
[] ).
cnf(3,axiom,
isTerminating0(xR),
file('COM017+1.p',unknown),
[] ).
cnf(4,axiom,
aElement0(xa),
file('COM017+1.p',unknown),
[] ).
cnf(7,axiom,
aElement0(xu),
file('COM017+1.p',unknown),
[] ).
cnf(8,axiom,
aElement0(xv),
file('COM017+1.p',unknown),
[] ).
cnf(20,axiom,
aReductOfIn0(xu,xa,xR),
file('COM017+1.p',unknown),
[] ).
cnf(22,axiom,
aReductOfIn0(xv,xa,xR),
file('COM017+1.p',unknown),
[] ).
cnf(26,axiom,
aElement0(skf21(u,v,w)),
file('COM017+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ aElement0(u)
| ~ sdtmndtasgtdt0(xv,xR,u)
| ~ sdtmndtasgtdt0(xu,xR,u) ),
file('COM017+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ aRewritingSystem0(u)
| ~ aElement0(v)
| ~ aReductOfIn0(w,v,u)
| aElement0(w) ),
file('COM017+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ isLocallyConfluent0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| ~ aElement0(x)
| ~ aRewritingSystem0(u)
| ~ aReductOfIn0(x,v,u)
| ~ aReductOfIn0(w,v,u)
| sdtmndtasgtdt0(x,u,skf21(x,u,w)) ),
file('COM017+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ isLocallyConfluent0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| ~ aElement0(x)
| ~ aRewritingSystem0(u)
| ~ aReductOfIn0(x,v,u)
| ~ aReductOfIn0(w,v,u)
| sdtmndtasgtdt0(w,u,skf21(x,u,w)) ),
file('COM017+1.p',unknown),
[] ).
cnf(60,plain,
( ~ aRewritingSystem0(u)
| ~ aElement0(v)
| ~ isLocallyConfluent0(u)
| ~ aReductOfIn0(w,v,u)
| ~ aReductOfIn0(x,v,u)
| sdtmndtasgtdt0(x,u,skf21(x,u,w)) ),
inference(mrr,[status(thm)],[54,34]),
[iquote('0:MRR:54.2,54.3,34.3,34.3')] ).
cnf(61,plain,
( ~ aRewritingSystem0(u)
| ~ aElement0(v)
| ~ isLocallyConfluent0(u)
| ~ aReductOfIn0(w,v,u)
| ~ aReductOfIn0(x,v,u)
| sdtmndtasgtdt0(w,u,skf21(x,u,w)) ),
inference(mrr,[status(thm)],[55,34]),
[iquote('0:MRR:55.2,55.3,34.3,34.3')] ).
cnf(775,plain,
( ~ aRewritingSystem0(xR)
| ~ aElement0(xa)
| ~ isLocallyConfluent0(xR)
| ~ aReductOfIn0(u,xa,xR)
| sdtmndtasgtdt0(u,xR,skf21(u,xR,xu)) ),
inference(res,[status(thm),theory(equality)],[20,60]),
[iquote('0:Res:20.0,60.3')] ).
cnf(776,plain,
( ~ aRewritingSystem0(xR)
| ~ aElement0(xa)
| ~ isLocallyConfluent0(xR)
| ~ aReductOfIn0(u,xa,xR)
| sdtmndtasgtdt0(xu,xR,skf21(u,xR,xu)) ),
inference(res,[status(thm),theory(equality)],[20,61]),
[iquote('0:Res:20.0,61.3')] ).
cnf(779,plain,
( ~ aReductOfIn0(u,xa,xR)
| sdtmndtasgtdt0(xu,xR,skf21(u,xR,xu)) ),
inference(ssi,[status(thm)],[776,3,2,1,4]),
[iquote('0:SSi:776.2,776.1,776.0,3.0,2.0,1.0,4.0,3.0,2.0,1.0')] ).
cnf(780,plain,
( ~ aReductOfIn0(u,xa,xR)
| sdtmndtasgtdt0(u,xR,skf21(u,xR,xu)) ),
inference(ssi,[status(thm)],[775,3,2,1,4]),
[iquote('0:SSi:775.2,775.1,775.0,3.0,2.0,1.0,4.0,3.0,2.0,1.0')] ).
cnf(1381,plain,
( ~ aElement0(skf21(xv,xR,xu))
| ~ aReductOfIn0(xv,xa,xR)
| ~ sdtmndtasgtdt0(xu,xR,skf21(xv,xR,xu)) ),
inference(res,[status(thm),theory(equality)],[780,33]),
[iquote('0:Res:780.1,33.1')] ).
cnf(1389,plain,
( ~ aReductOfIn0(xv,xa,xR)
| ~ sdtmndtasgtdt0(xu,xR,skf21(xv,xR,xu)) ),
inference(ssi,[status(thm)],[1381,26,8,3,2,1,7]),
[iquote('0:SSi:1381.0,26.0,8.0,3.0,2.0,1.0,7.0')] ).
cnf(1390,plain,
~ sdtmndtasgtdt0(xu,xR,skf21(xv,xR,xu)),
inference(mrr,[status(thm)],[1389,22]),
[iquote('0:MRR:1389.0,22.0')] ).
cnf(1399,plain,
~ aReductOfIn0(xv,xa,xR),
inference(res,[status(thm),theory(equality)],[779,1390]),
[iquote('0:Res:779.1,1390.0')] ).
cnf(1402,plain,
$false,
inference(mrr,[status(thm)],[1399,22]),
[iquote('0:MRR:1399.0,22.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 18:05:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.47/0.64
% 0.47/0.64 SPASS V 3.9
% 0.47/0.64 SPASS beiseite: Proof found.
% 0.47/0.64 % SZS status Theorem
% 0.47/0.64 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.64 SPASS derived 849 clauses, backtracked 190 clauses, performed 10 splits and kept 762 clauses.
% 0.47/0.64 SPASS allocated 105156 KBytes.
% 0.47/0.64 SPASS spent 0:00:00.27 on the problem.
% 0.47/0.64 0:00:00.03 for the input.
% 0.47/0.64 0:00:00.07 for the FLOTTER CNF translation.
% 0.47/0.64 0:00:00.02 for inferences.
% 0.47/0.64 0:00:00.00 for the backtracking.
% 0.47/0.64 0:00:00.12 for the reduction.
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 Here is a proof with depth 3, length 24 :
% 0.47/0.64 % SZS output start Refutation
% See solution above
% 0.47/0.64 Formulae used in the proof : m__656 m__656_01 m__731 m__755 m__779 mWCRDef m__ mReduct
% 0.47/0.64
%------------------------------------------------------------------------------