%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEU047+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 : n001.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:40:48 AM UTC 2026
% Result : Theorem 13.33s 2.64s
% Output : CNFRefutation 13.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 34 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 29 ( 10 ~; 7 |; 4 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t129_relat_1,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( subset(X0,X1)
=> 'relation$urng$urestriction'(X1,'relation$urng$urestriction'(X0,X2)) = 'relation$urng$urestriction'(X0,X2) ) ) ).
fof(t130_relat_1,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( subset(X0,X1)
=> 'relation$urng$urestriction'(X0,'relation$urng$urestriction'(X1,X2)) = 'relation$urng$urestriction'(X0,X2) ) ) ).
fof(t97_funct_1,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( subset(X0,X1)
=> ( 'relation$urng$urestriction'(X0,'relation$urng$urestriction'(X1,X2)) = 'relation$urng$urestriction'(X0,X2)
& 'relation$urng$urestriction'(X1,'relation$urng$urestriction'(X0,X2)) = 'relation$urng$urestriction'(X0,X2) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( subset(X0,X1)
=> ( 'relation$urng$urestriction'(X0,'relation$urng$urestriction'(X1,X2)) = 'relation$urng$urestriction'(X0,X2)
& 'relation$urng$urestriction'(X1,'relation$urng$urestriction'(X0,X2)) = 'relation$urng$urestriction'(X0,X2) ) ) ),
inference(negate_conjecture,[status(cth)],[t97_funct_1]) ).
cnf(c47,plain,
( 'relation$urng$urestriction'(X2,'relation$urng$urestriction'(X1,X0)) = 'relation$urng$urestriction'(X1,X0)
| ~ subset(X1,X2)
| ~ relation(X0) ),
inference(clausification,[status(esa)],[t129_relat_1]) ).
cnf(c48,plain,
( 'relation$urng$urestriction'(X1,'relation$urng$urestriction'(X2,X0)) = 'relation$urng$urestriction'(X1,X0)
| ~ subset(X1,X2)
| ~ relation(X0) ),
inference(clausification,[status(esa)],[t130_relat_1]) ).
cnf(c49,plain,
relation(sK51),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c51,plain,
subset(sK49,sK50),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c52,plain,
( 'relation$urng$urestriction'(sK49,'relation$urng$urestriction'(sK50,sK51)) != 'relation$urng$urestriction'(sK49,sK51)
| 'relation$urng$urestriction'(sK50,'relation$urng$urestriction'(sK49,sK51)) != 'relation$urng$urestriction'(sK49,sK51) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ relation(X0)
| 'relation$urng$urestriction'(sK49,'relation$urng$urestriction'(sK50,X0)) = 'relation$urng$urestriction'(sK49,X0) ),
inference(resolution,[status(thm)],[c48,c51]) ).
cnf(d1,plain,
'relation$urng$urestriction'(sK49,'relation$urng$urestriction'(sK50,sK51)) = 'relation$urng$urestriction'(sK49,sK51),
inference(resolution,[status(thm)],[d0,c49]) ).
cnf(d2,plain,
( ~ relation(X0)
| 'relation$urng$urestriction'(sK50,'relation$urng$urestriction'(sK49,X0)) = 'relation$urng$urestriction'(sK49,X0) ),
inference(resolution,[status(thm)],[c47,c51]) ).
cnf(d3,plain,
'relation$urng$urestriction'(sK50,'relation$urng$urestriction'(sK49,sK51)) = 'relation$urng$urestriction'(sK49,sK51),
inference(resolution,[status(thm)],[d2,c49]) ).
cnf(d4,plain,
'relation$urng$urestriction'(sK49,'relation$urng$urestriction'(sK50,sK51)) != 'relation$urng$urestriction'(sK49,sK51),
inference(resolution,[status(thm)],[d3,c52]) ).
cnf(d5,plain,
$false,
inference(resolution,[status(thm)],[d4,d1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU047+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.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 08:38:27 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.33/2.64 % SZS status Theorem for theBenchmark.p
% 13.33/2.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------