%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN407+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:22:04 AM UTC 2026
% Result : Theorem 8.79s 1.66s
% Output : CNFRefutation 8.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 22 ( 6 ~; 8 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish241,conjecture,
( ! [X0] :
( f(X0)
=> ( h(X0)
| g(X0) ) )
=> ( ? [X2] :
( h(X2)
& f(X2) )
| ! [X1] :
( f(X1)
=> g(X1) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ( ! [X0] :
( f(X0)
=> ( h(X0)
| g(X0) ) )
=> ( ? [X2] :
( h(X2)
& f(X2) )
| ! [X1] :
( f(X1)
=> g(X1) ) ) ),
inference(negate_conjecture,[status(cth)],[kalish241]) ).
cnf(c0,plain,
( h(X0)
| g(X0)
| ~ f(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c1,plain,
f(sK1),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c2,plain,
~ g(sK1),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c3,plain,
( ~ h(X0)
| ~ f(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( h(sK1)
| g(sK1) ),
inference(resolution,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
h(sK1),
inference(resolution,[status(thm)],[c2,d0]) ).
cnf(d2,plain,
~ f(sK1),
inference(resolution,[status(thm)],[d1,c3]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[c1,d2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN407+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.51 % Computer : n005.cluster.edu
% 0.09/0.51 % Model : x86_64 x86_64
% 0.09/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.51 % Memory : 8046.5625MB
% 0.09/0.51 % OS : Linux 6.8.0-71-generic
% 0.09/0.51 % CPULimit : 300
% 0.09/0.51 % WCLimit : 300
% 0.09/0.51 % DateTime : Sat Sep 26 17:40:47 UTC 2026
% 0.09/0.51 % CPUTime :
% 0.09/0.51 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.79/1.66 % SZS status Theorem for theBenchmark.p
% 8.79/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------