%------------------------------------------------------------------------------
% 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/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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 : Unsatisfiable 5.82s 1.18s
% Output : Proof 5.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 58 ( 14 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 46 ( 26 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 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 : 25 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f0,negated_conjecture,
( ~ p(A)
| l(A,g(h(sk1(A)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_1) ).
fof(f0_nnf,plain,
! [A] :
( ~ p(A)
| l(A,g(h(sk1(A)))) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A] :
( ~ p(A)
| l(A,g(h(sk1(A)))) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ p(X0)
| l(X0,g(h(sk1(X0)))) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
ifeq(p(X0),true,l(X0,g(h(sk1(X0)))),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f4,negated_conjecture,
p(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_5) ).
fof(f4_nnf,plain,
p(sk2),
inference(nnf_transformation,[status(thm)],[f4]) ).
cnf(c4,plain,
p(sk2),
inference(cnf_transformation,[status(esa)],[f4_nnf]) ).
cnf(hi4,negated_conjecture,
p(sk2) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h3,plain,
l(sk2,g(h(sk1(sk2)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi4]) ).
cnf(f1,negated_conjecture,
( ~ p(A)
| p(sk1(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_2) ).
fof(f1_nnf,plain,
! [A] :
( ~ p(A)
| p(sk1(A)) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A] :
( ~ p(A)
| p(sk1(A)) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( ~ p(X0)
| p(sk1(X0)) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,negated_conjecture,
ifeq(p(X0),true,p(sk1(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h2,plain,
p(sk1(sk2)) = true,
inference(hyper_resolution,[status(thm)],[hi1,hi4]) ).
cnf(f3,negated_conjecture,
( ~ p(A)
| p(h(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_4) ).
fof(f3_nnf,plain,
! [A] :
( ~ p(A)
| p(h(A)) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A] :
( ~ p(A)
| p(h(A)) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( ~ p(X0)
| p(h(X0)) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(p(X0),true,p(h(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(h12,plain,
p(h(sk1(sk2))) = true,
inference(hyper_resolution,[status(thm)],[hi3,h2]) ).
cnf(f2,negated_conjecture,
( ~ p(A)
| p(g(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_3) ).
fof(f2_nnf,plain,
! [A] :
( ~ p(A)
| p(g(A)) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A] :
( ~ p(A)
| p(g(A)) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ p(X0)
| p(g(X0)) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(p(X0),true,p(g(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h41,plain,
p(g(h(sk1(sk2)))) = true,
inference(hyper_resolution,[status(thm)],[hi2,h12]) ).
cnf(f5,negated_conjecture,
( ~ l(sk2,A)
| ~ p(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_6) ).
fof(f5_nnf,plain,
! [A] :
( ~ l(sk2,A)
| ~ p(A) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [A] :
( ~ l(sk2,A)
| ~ p(A) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
( ~ l(sk2,X0)
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi5,negated_conjecture,
ifeq(p(X0),true,ifeq(l(sk2,X0),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi5,h41,h3]) ).
cnf(t629,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,t629]) ).
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/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n011.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.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 02:12:58 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.82/1.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.82/1.18 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------