%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN075+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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 09:21:14 AM UTC 2026
% Result : Theorem 11.25s 1.82s
% Output : CNFRefutation 11.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 64 ( 44 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 66 ( 30 ~; 30 |; 1 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn 6 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel52_1,axiom,
? [X0,X1] :
! [X2,X3] :
( 'big$uf'(X2,X3)
<=> ( X3 = X1
& X2 = X0 ) ) ).
fof(pel52,conjecture,
? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( 'big$uf'(X3,X1)
<=> X3 = X2 )
<=> X1 = X0 ) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( 'big$uf'(X3,X1)
<=> X3 = X2 )
<=> X1 = X0 ),
inference(negate_conjecture,[status(cth)],[pel52]) ).
cnf(c0,plain,
( X0 = sK0
| ~ 'big$uf'(X0,X1) ),
inference(clausification,[status(esa)],[pel52_1]) ).
cnf(c1,plain,
( X1 = sK1
| ~ 'big$uf'(X0,X1) ),
inference(clausification,[status(esa)],[pel52_1]) ).
cnf(c2,plain,
( X1 != sK1
| X0 != sK0
| 'big$uf'(X0,X1) ),
inference(clausification,[status(esa)],[pel52_1]) ).
cnf(c12,plain,
( sK5(X1) = X1
| X0 != sK6(X1)
| 'big$uf'(X0,sK5(X1)) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c14,plain,
( sK9(X0,X1) = X1
| 'big$uf'(sK9(X0,X1),sK5(X0))
| sK5(X0) != X0 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c15,plain,
( ~ 'big$uf'(sK9(X0,X1),sK5(X0))
| sK9(X0,X1) != X1
| sK5(X0) != X0 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( 'big$uf'(sK6(X0),sK5(X0))
| sK5(X0) = X0 ),
inference(equality_resolution,[status(thm)],[c12]) ).
cnf(d1,plain,
( sK5(X0) = X0
| sK5(X0) = sK1 ),
inference(resolution,[status(thm)],[c1,d0]) ).
cnf(d2,plain,
( sK5(X0) = sK1
| X0 != sK1 ),
inference(equality_factoring,[status(thm)],[d1]) ).
cnf(d3,plain,
sK5(sK1) = sK1,
inference(equality_resolution,[status(thm)],[d2]) ).
cnf(d4,plain,
( 'big$uf'(sK9(sK1,X0),sK5(sK1))
| sK9(sK1,X0) = X0
| sK1 != sK1 ),
inference(superposition,[status(thm)],[d3,c14]) ).
cnf(d5,plain,
( 'big$uf'(sK9(sK1,X0),sK1)
| sK9(sK1,X0) = X0
| sK1 != sK1 ),
inference(demodulation,[status(thm)],[d4,d3]) ).
cnf(d6,plain,
( 'big$uf'(sK9(sK1,X0),sK1)
| sK9(sK1,X0) = X0 ),
inference(equality_resolution,[status(thm)],[d5]) ).
cnf(d7,plain,
( sK9(sK1,X0) = sK0
| sK9(sK1,X0) = X0 ),
inference(resolution,[status(thm)],[d6,c0]) ).
cnf(d8,plain,
( sK9(sK1,X0) = sK0
| X0 != sK0 ),
inference(equality_factoring,[status(thm)],[d7]) ).
cnf(d9,plain,
sK9(sK1,sK0) = sK0,
inference(equality_resolution,[status(thm)],[d8]) ).
cnf(d10,plain,
( ~ 'big$uf'(sK9(sK1,sK0),sK5(sK1))
| sK5(sK1) != sK1
| sK0 != sK0 ),
inference(superposition,[status(thm)],[d9,c15]) ).
cnf(d11,plain,
( ~ 'big$uf'(sK9(sK1,sK0),sK5(sK1))
| sK1 != sK1
| sK0 != sK0 ),
inference(demodulation,[status(thm)],[d10,d3]) ).
cnf(d12,plain,
( ~ 'big$uf'(sK0,sK5(sK1))
| sK1 != sK1
| sK0 != sK0 ),
inference(demodulation,[status(thm)],[d11,d9]) ).
cnf(d13,plain,
( ~ 'big$uf'(sK0,sK1)
| sK1 != sK1
| sK0 != sK0 ),
inference(demodulation,[status(thm)],[d12,d3]) ).
cnf(d14,plain,
( 'big$uf'(X0,sK1)
| X0 != sK0 ),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(d15,plain,
'big$uf'(sK0,sK1),
inference(equality_resolution,[status(thm)],[d14]) ).
cnf(d16,plain,
( sK1 != sK1
| sK0 != sK0 ),
inference(resolution,[status(thm)],[d15,d13]) ).
cnf(d17,plain,
sK0 != sK0,
inference(equality_resolution,[status(thm)],[d16]) ).
cnf(d18,plain,
$false,
inference(equality_resolution,[status(thm)],[d17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN075+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 17:10:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.25/1.82 % SZS status Theorem for theBenchmark.p
% 11.25/1.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------