%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : RNG104+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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 08:25:53 AM UTC 2026
% Result : Theorem 52.66s 7.28s
% Output : CNFRefutation 52.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 58 ( 17 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 57 ( 27 ~; 20 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSortsB_02,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> aElement0(sdtasdt0(X0,X1)) ) ).
fof(mMulComm,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ) ).
fof(mMulAsso,axiom,
! [X0,X1,X2] :
( ( aElement0(X2)
& aElement0(X1)
& aElement0(X0) )
=> sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ) ).
fof(m__1905,hypothesis,
aElement0(xc) ).
fof(m__1933,hypothesis,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& aElementOf0(xx,slsdtgt0(xc)) ) ).
fof(m__1956,hypothesis,
( sdtasdt0(xc,xu) = xx
& aElement0(xu) ) ).
fof(m__,conjecture,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)) ).
fof(negated_conjecture,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(negate_conjecture,[status(cth)],[m__]) ).
cnf(c4,plain,
( aElement0(sdtasdt0(X0,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(clausification,[status(esa)],[mSortsB_02]) ).
cnf(c11,plain,
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(clausification,[status(esa)],[mMulComm]) ).
cnf(c12,plain,
( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(clausification,[status(esa)],[mMulAsso]) ).
cnf(c107,plain,
aElement0(xc),
inference(clausification,[status(esa)],[m__1905]) ).
cnf(c110,plain,
aElement0(xz),
inference(clausification,[status(esa)],[m__1933]) ).
cnf(c111,plain,
aElement0(xu),
inference(clausification,[status(esa)],[m__1956]) ).
cnf(c112,plain,
sdtasdt0(xc,xu) = xx,
inference(clausification,[status(esa)],[m__1956]) ).
cnf(c116,plain,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ aElement0(X0)
| ~ aElement0(xc)
| ~ aElement0(xu)
| sdtasdt0(xx,X0) = sdtasdt0(xc,sdtasdt0(xu,X0)) ),
inference(superposition,[status(thm)],[c112,c12]) ).
cnf(d1,plain,
( ~ aElement0(xu)
| ~ aElement0(X0)
| sdtasdt0(xx,X0) = sdtasdt0(xc,sdtasdt0(xu,X0)) ),
inference(resolution,[status(thm)],[c107,d0]) ).
cnf(d2,plain,
( ~ aElement0(X0)
| sdtasdt0(xx,X0) = sdtasdt0(xc,sdtasdt0(xu,X0)) ),
inference(resolution,[status(thm)],[c111,d1]) ).
cnf(d3,plain,
( ~ aElement0(xz)
| sdtasdt0(xz,xx) != sdtasdt0(xx,xz) ),
inference(superposition,[status(thm)],[d2,c116]) ).
cnf(d4,plain,
sdtasdt0(xz,xx) != sdtasdt0(xx,xz),
inference(resolution,[status(thm)],[c110,d3]) ).
cnf(d5,plain,
( ~ aElement0(xz)
| ~ aElement0(xx)
| sdtasdt0(xx,xz) != sdtasdt0(xx,xz) ),
inference(superposition,[status(thm)],[c11,d4]) ).
cnf(d6,plain,
( ~ aElement0(xx)
| sdtasdt0(xx,xz) != sdtasdt0(xx,xz) ),
inference(resolution,[status(thm)],[c110,d5]) ).
cnf(d7,plain,
( ~ aElement0(xc)
| ~ aElement0(xu)
| aElement0(xx) ),
inference(superposition,[status(thm)],[c112,c4]) ).
cnf(d8,plain,
( ~ aElement0(xu)
| aElement0(xx) ),
inference(resolution,[status(thm)],[c107,d7]) ).
cnf(d9,plain,
aElement0(xx),
inference(resolution,[status(thm)],[c111,d8]) ).
cnf(d10,plain,
sdtasdt0(xx,xz) != sdtasdt0(xx,xz),
inference(resolution,[status(thm)],[d9,d6]) ).
cnf(d11,plain,
$false,
inference(equality_resolution,[status(thm)],[d10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG104+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n011.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sat Sep 26 06:06:28 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 52.66/7.28 % SZS status Theorem for theBenchmark.p
% 52.66/7.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------