%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SET988+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:33:41 AM UTC 2026
% Result : Theorem 11.85s 1.89s
% Output : CNFRefutation 11.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 66 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 59 ( 20 ~; 22 |; 10 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_funct_1,axiom,
! [X0] :
( function(X0)
<=> ! [X1,X2,X3] :
( ( in('ordered$upair'(X1,X3),X0)
& in('ordered$upair'(X1,X2),X0) )
=> X2 = X3 ) ) ).
fof(d1_relat_1,axiom,
! [X0] :
( relation(X0)
<=> ! [X1] :
~ ( ! [X2,X3] : X1 != 'ordered$upair'(X2,X3)
& in(X1,X0) ) ) ).
fof(t2_funct_1,conjecture,
! [X0] :
( ( ! [X1,X2,X3] :
( ( in('ordered$upair'(X1,X3),X0)
& in('ordered$upair'(X1,X2),X0) )
=> X2 = X3 )
& ! [X1] :
~ ( ! [X2,X3] : 'ordered$upair'(X2,X3) != X1
& in(X1,X0) ) )
=> ( function(X0)
& relation(X0) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ( ! [X1,X2,X3] :
( ( in('ordered$upair'(X1,X3),X0)
& in('ordered$upair'(X1,X2),X0) )
=> X2 = X3 )
& ! [X1] :
~ ( ! [X2,X3] : 'ordered$upair'(X2,X3) != X1
& in(X1,X0) ) )
=> ( function(X0)
& relation(X0) ) ),
inference(negate_conjecture,[status(cth)],[t2_funct_1]) ).
cnf(c41,plain,
( in('ordered$upair'(sK49(X0),sK50(X0)),X0)
| function(X0) ),
inference(clausification,[status(esa)],[d1_funct_1]) ).
cnf(c42,plain,
( in('ordered$upair'(sK49(X0),sK51(X0)),X0)
| function(X0) ),
inference(clausification,[status(esa)],[d1_funct_1]) ).
cnf(c43,plain,
( sK50(X0) != sK51(X0)
| function(X0) ),
inference(clausification,[status(esa)],[d1_funct_1]) ).
cnf(c45,plain,
( in(sK56(X0),X0)
| relation(X0) ),
inference(clausification,[status(esa)],[d1_relat_1]) ).
cnf(c46,plain,
( sK56(X0) != 'ordered$upair'(X1,X2)
| relation(X0) ),
inference(clausification,[status(esa)],[d1_relat_1]) ).
cnf(c47,plain,
( 'ordered$upair'(sK61(X0),sK62(X0)) = X0
| ~ in(X0,sK59) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c48,plain,
( X1 = X2
| ~ in('ordered$upair'(X0,X2),sK59)
| ~ in('ordered$upair'(X0,X1),sK59) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c49,plain,
( ~ function(sK59)
| ~ relation(sK59) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( 'ordered$upair'(sK61(sK56(sK59)),sK62(sK56(sK59))) = sK56(sK59)
| relation(sK59) ),
inference(resolution,[status(thm)],[c45,c47]) ).
cnf(d1,plain,
( ~ in('ordered$upair'(sK49(sK59),X0),sK59)
| X0 = sK50(sK59)
| function(sK59) ),
inference(resolution,[status(thm)],[c41,c48]) ).
cnf(d2,plain,
( function(sK59)
| sK51(sK59) = sK50(sK59)
| function(sK59) ),
inference(resolution,[status(thm)],[c42,d1]) ).
cnf(d3,plain,
( ~ relation(sK59)
| sK51(sK59) = sK50(sK59) ),
inference(resolution,[status(thm)],[d2,c49]) ).
cnf(d4,plain,
( sK51(sK59) = sK50(sK59)
| 'ordered$upair'(sK61(sK56(sK59)),sK62(sK56(sK59))) = sK56(sK59) ),
inference(resolution,[status(thm)],[d0,d3]) ).
cnf(d5,plain,
( sK51(sK59) = sK50(sK59)
| relation(X0)
| sK56(X0) != sK56(sK59) ),
inference(superposition,[status(thm)],[d4,c46]) ).
cnf(d6,plain,
( relation(sK59)
| sK51(sK59) = sK50(sK59) ),
inference(equality_resolution,[status(thm)],[d5]) ).
cnf(d7,plain,
( sK51(sK59) = sK50(sK59)
| sK51(sK59) = sK50(sK59) ),
inference(resolution,[status(thm)],[d6,d3]) ).
cnf(d8,plain,
( function(sK59)
| sK50(sK59) != sK50(sK59) ),
inference(superposition,[status(thm)],[d7,c43]) ).
cnf(d9,plain,
function(sK59),
inference(equality_resolution,[status(thm)],[d8]) ).
cnf(d10,plain,
~ relation(sK59),
inference(resolution,[status(thm)],[d9,c49]) ).
cnf(d11,plain,
'ordered$upair'(sK61(sK56(sK59)),sK62(sK56(sK59))) = sK56(sK59),
inference(resolution,[status(thm)],[d10,d0]) ).
cnf(d12,plain,
( relation(X0)
| sK56(X0) != sK56(sK59) ),
inference(superposition,[status(thm)],[d11,c46]) ).
cnf(d13,plain,
relation(sK59),
inference(equality_resolution,[status(thm)],[d12]) ).
cnf(d14,plain,
$false,
inference(resolution,[status(thm)],[d10,d13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET988+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n020.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 26 08:30:04 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.85/1.89 % SZS status Theorem for theBenchmark.p
% 11.85/1.89 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------