%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN311-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n018.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:34:18 PM UTC 2026
% Result : Unsatisfiable 6.16s 1.25s
% Output : Proof 6.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 30 unt; 0 def)
% Number of atoms : 62 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 80 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f4,negated_conjecture,
p(a,b,c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
fof(f4_nnf,plain,
p(a,b,c,d),
inference(nnf_transformation,[status(thm)],[f4]) ).
cnf(c4,plain,
p(a,b,c,d),
inference(cnf_transformation,[status(esa)],[f4_nnf]) ).
cnf(hi4,negated_conjecture,
p(a,b,c,d) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h0,plain,
p(a,b,c,d) = true,
inference(hyper_resolution,[status(thm)],[hi4]) ).
cnf(f2,negated_conjecture,
( ~ p(X,X1,X2,X3)
| p(X,X1,X2,g(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
fof(f2_nnf,plain,
! [X,X1,X2,X3] :
( ~ p(X,X1,X2,X3)
| p(X,X1,X2,g(X3)) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,X1,X2,X3] :
( ~ p(X,X1,X2,X3)
| p(X,X1,X2,g(X3)) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ p(X0,X1,X2,X3)
| p(X0,X1,X2,g(X3)) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(p(X0,X1,X2,X3),true,p(X0,X1,X2,g(X3)),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h1,plain,
p(a,b,c,g(d)) = true,
inference(hyper_resolution,[status(thm)],[hi2,h0]) ).
cnf(f1,negated_conjecture,
( ~ p(X,X1,X2,X3)
| p(X3,X2,X1,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [X3,X2,X1,X] :
( ~ p(X,X1,X2,X3)
| p(X3,X2,X1,X) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X3,X2,X1,X] :
( ~ p(X,X1,X2,X3)
| p(X3,X2,X1,X) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( ~ p(X3,X2,X1,X0)
| p(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,negated_conjecture,
ifeq(p(X0,X1,X2,X3),true,p(X3,X2,X1,X0),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h2,plain,
p(g(d),c,b,a) = true,
inference(hyper_resolution,[status(thm)],[hi1,h1]) ).
cnf(f3,negated_conjecture,
( ~ p(X,X1,X2,X3)
| p(f(X),X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
fof(f3_nnf,plain,
! [X,X1,X2,X3] :
( ~ p(X,X1,X2,X3)
| p(f(X),X1,X2,X3) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,X1,X2,X3] :
( ~ p(X,X1,X2,X3)
| p(f(X),X1,X2,X3) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( ~ p(X0,X1,X2,X3)
| p(f(X0),X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(p(X0,X1,X2,X3),true,p(f(X0),X1,X2,X3),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(h3,plain,
p(f(g(d)),c,b,a) = true,
inference(hyper_resolution,[status(thm)],[hi3,h2]) ).
cnf(h4,plain,
p(f(g(d)),c,b,g(a)) = true,
inference(hyper_resolution,[status(thm)],[hi2,h3]) ).
cnf(f0,negated_conjecture,
( ~ p(X,X1,X2,X3)
| p(X3,X,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
fof(f0_nnf,plain,
! [X3,X,X1,X2] :
( ~ p(X,X1,X2,X3)
| p(X3,X,X1,X2) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X3,X,X1,X2] :
( ~ p(X,X1,X2,X3)
| p(X3,X,X1,X2) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ p(X1,X2,X3,X0)
| p(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
ifeq(p(X0,X1,X2,X3),true,p(X3,X0,X1,X2),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h5,plain,
p(g(a),f(g(d)),c,b) = true,
inference(hyper_resolution,[status(thm)],[hi0,h4]) ).
cnf(h6,plain,
p(f(g(a)),f(g(d)),c,b) = true,
inference(hyper_resolution,[status(thm)],[hi3,h5]) ).
cnf(h7,plain,
p(f(g(a)),f(g(d)),c,g(b)) = true,
inference(hyper_resolution,[status(thm)],[hi2,h6]) ).
cnf(h8,plain,
p(g(b),f(g(a)),f(g(d)),c) = true,
inference(hyper_resolution,[status(thm)],[hi0,h7]) ).
cnf(h9,plain,
p(f(g(b)),f(g(a)),f(g(d)),c) = true,
inference(hyper_resolution,[status(thm)],[hi3,h8]) ).
cnf(h10,plain,
p(f(g(b)),f(g(a)),f(g(d)),g(c)) = true,
inference(hyper_resolution,[status(thm)],[hi2,h9]) ).
cnf(h11,plain,
p(g(c),f(g(b)),f(g(a)),f(g(d))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h10]) ).
cnf(h12,plain,
p(f(g(c)),f(g(b)),f(g(a)),f(g(d))) = true,
inference(hyper_resolution,[status(thm)],[hi3,h11]) ).
cnf(t4,plain,
p(f(g(d)),f(g(c)),f(g(b)),f(g(a))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h12]) ).
cnf(t8,plain,
p(f(g(d)),f(g(c)),f(g(b)),f(g(a))) = true,
inference(orient,[status(thm)],[t4]) ).
cnf(f5,negated_conjecture,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
fof(f5_nnf,plain,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(goal_0,negated_conjecture,
p(f(g(d)),f(g(c)),f(g(b)),f(g(a))) != true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t8]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN311-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n018.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 00:50:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.16/1.25 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.16/1.25 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------