%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : COM018+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 06:58:43 AM UTC 2026
% Result : Theorem 10.63s 2.09s
% Output : CNFRefutation 10.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 11 ~; 6 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn 2 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mTermNF,axiom,
! [X0] :
( ( isTerminating0(X0)
& aRewritingSystem0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR) ).
fof(m__656_01,hypothesis,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ) ).
fof(m__799,hypothesis,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ) ).
fof(m__,conjecture,
? [X0] : aNormalFormOfIn0(X0,xw,xR) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] : aNormalFormOfIn0(X0,xw,xR),
inference(negate_conjecture,[status(cth)],[m__]) ).
cnf(c46,plain,
( aNormalFormOfIn0(sK60(X0,X1),X1,X0)
| ~ aElement0(X1)
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(clausification,[status(esa)],[mTermNF]) ).
cnf(c47,plain,
aRewritingSystem0(xR),
inference(clausification,[status(esa)],[m__656]) ).
cnf(c49,plain,
isTerminating0(xR),
inference(clausification,[status(esa)],[m__656_01]) ).
cnf(c64,plain,
aElement0(xw),
inference(clausification,[status(esa)],[m__799]) ).
cnf(c67,plain,
~ aNormalFormOfIn0(X0,xw,xR),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ isTerminating0(xR)
| ~ aElement0(xw)
| ~ aRewritingSystem0(xR) ),
inference(resolution,[status(thm)],[c46,c67]) ).
cnf(d1,plain,
( ~ isTerminating0(xR)
| ~ aElement0(xw) ),
inference(resolution,[status(thm)],[c47,d0]) ).
cnf(d2,plain,
~ aElement0(xw),
inference(resolution,[status(thm)],[c49,d1]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[c64,d2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM018+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 23:25:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.63/2.09 % SZS status Theorem for theBenchmark.p
% 10.63/2.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------