%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN729+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n002.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 : Fri Sep 25 03:35:35 PM UTC 2026
% Result : Theorem 3.92s 1.03s
% Output : Proof 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 16 unt; 0 def)
% Number of atoms : 62 ( 14 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 54 ( 17 ~; 11 |; 18 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 28 ( 0 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ( ! [W] :
( p(W)
=> ( p(h(W))
& p(g(W)) ) )
& ! [X] :
? [Y] :
( p(X)
=> ( p(Y)
& l(X,g(h(Y))) ) ) )
=> ! [X] :
( p(X)
=> ? [Y] :
( p(Y)
& l(X,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm72) ).
fof(f0_neg,negated_conjecture,
~ ( ( ! [W] :
( p(W)
=> ( p(h(W))
& p(g(W)) ) )
& ! [X] :
? [Y] :
( p(X)
=> ( p(Y)
& l(X,g(h(Y))) ) ) )
=> ! [X] :
( p(X)
=> ? [Y] :
( p(Y)
& l(X,Y) ) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ? [X] :
( ! [Y] :
( ~ p(Y)
| ~ l(X,Y) )
& p(X) )
& ! [W] :
( ( p(h(W))
& p(g(W)) )
| ~ p(W) )
& ! [X] :
? [Y] :
( ( p(Y)
& l(X,g(h(Y))) )
| ~ p(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,W,Y] :
( ( ~ p(Y)
| ~ l(sk1,Y) )
& p(sk1)
& ( ( p(h(W))
& p(g(W)) )
| ~ p(W) )
& ( ( p(sk0(X))
& l(X,g(h(sk0(X)))) )
| ~ p(X) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c1,plain,
( p(sk0(X0))
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
ifeq(p(X0),true,p(sk0(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(c4,plain,
p(sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi4,negated_conjecture,
p(sk1) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h2,plain,
p(sk0(sk1)) = true,
inference(hyper_resolution,[status(thm)],[hi1,hi4]) ).
cnf(c3,plain,
( p(h(X2))
| ~ p(X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(p(X0),true,p(h(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(h9,plain,
p(h(sk0(sk1))) = true,
inference(hyper_resolution,[status(thm)],[hi3,h2]) ).
cnf(c2,plain,
( p(g(X2))
| ~ p(X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(p(X0),true,p(g(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h35,plain,
p(g(h(sk0(sk1)))) = true,
inference(hyper_resolution,[status(thm)],[hi2,h9]) ).
cnf(c0,plain,
( l(X0,g(h(sk0(X0))))
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
ifeq(p(X0),true,l(X0,g(h(sk0(X0)))),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h12,plain,
l(sk1,g(h(sk0(sk1)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi4]) ).
cnf(c5,plain,
( ~ p(X1)
| ~ l(sk1,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi5,negated_conjecture,
ifeq(l(sk1,X0),true,ifeq(p(X0),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi5,h12,h35]) ).
cnf(t749,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t749]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN729+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n002.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 : Fri Sep 25 02:15:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.92/1.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/1.03 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------