TSTP Solution File: COM018+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:20 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aRewritingSystem0(xR),
file('COM018+4.p',unknown),
[] ).
cnf(3,axiom,
isTerminating0(xR),
file('COM018+4.p',unknown),
[] ).
cnf(15,axiom,
aElement0(xw),
file('COM018+4.p',unknown),
[] ).
cnf(38,axiom,
~ aNormalFormOfIn0(u,xw,xR),
file('COM018+4.p',unknown),
[] ).
cnf(77,axiom,
( ~ aElement0(u)
| ~ isTerminating0(v)
| ~ aRewritingSystem0(v)
| aNormalFormOfIn0(skf37(v,u),u,v) ),
file('COM018+4.p',unknown),
[] ).
cnf(120,plain,
( ~ aRewritingSystem0(xR)
| ~ isTerminating0(xR)
| ~ aElement0(xw) ),
inference(res,[status(thm),theory(equality)],[77,38]),
[iquote('0:Res:77.3,38.0')] ).
cnf(298,plain,
$false,
inference(mrr,[status(thm)],[120,1,3,15]),
[iquote('0:MRR:120.0,120.1,120.2,1.0,3.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n014.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 17:44:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50
% 0.20/0.50 SPASS V 3.9
% 0.20/0.50 SPASS beiseite: Proof found.
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 SPASS derived 93 clauses, backtracked 0 clauses, performed 0 splits and kept 116 clauses.
% 0.20/0.50 SPASS allocated 98471 KBytes.
% 0.20/0.50 SPASS spent 0:00:00.15 on the problem.
% 0.20/0.50 0:00:00.04 for the input.
% 0.20/0.50 0:00:00.08 for the FLOTTER CNF translation.
% 0.20/0.50 0:00:00.00 for inferences.
% 0.20/0.50 0:00:00.00 for the backtracking.
% 0.20/0.50 0:00:00.01 for the reduction.
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 Here is a proof with depth 1, length 7 :
% 0.20/0.50 % SZS output start Refutation
% See solution above
% 0.20/0.50 Formulae used in the proof : m__656 m__656_01 m__799 m__ mTermNF
% 0.20/0.50
%------------------------------------------------------------------------------