%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN034-1 : TPTP v9.3.1. Released v1.0.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:33:21 PM UTC 2026
% Result : Unsatisfiable 3.74s 1.13s
% Output : Proof 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 3 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 38 ( 18 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,axiom,
( p(f(A),A)
| p(A,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [A] :
( p(f(A),A)
| p(A,a) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A] :
( p(f(A),A)
| p(A,a) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( p(f(X0),X0)
| p(X0,a) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(f0,axiom,
( p(A,f(A))
| p(A,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
fof(f0_nnf,plain,
! [A] :
( p(A,f(A))
| p(A,a) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A] :
( p(A,f(A))
| p(A,a) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( p(X0,f(X0))
| p(X0,a) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(f2,negated_conjecture,
( ~ p(B,a)
| ~ p(B,A)
| ~ p(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem) ).
fof(f2_nnf,plain,
! [A,B] :
( ~ p(B,a)
| ~ p(B,A)
| ~ p(A,B) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B] :
( ~ p(B,a)
| ~ p(B,A)
| ~ p(A,B) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ p(X1,a)
| ~ p(X1,X0)
| ~ p(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p4,plain,
( ~ p(X0,a)
| ~ p(a,X0) ),
inference(factoring,[status(thm)],[c2]) ).
cnf(p7,plain,
( ~ p(f(a),a)
| p(a,a) ),
inference(resolution,[status(thm)],[c0,p4]) ).
cnf(p8,plain,
( p(a,a)
| p(a,a) ),
inference(resolution,[status(thm)],[c1,p7]) ).
cnf(p10,plain,
p(a,a),
inference(factoring,[status(thm)],[p8]) ).
cnf(p3,plain,
( ~ p(X0,a)
| ~ p(X0,X0) ),
inference(factoring,[status(thm)],[c2]) ).
cnf(p5,plain,
~ p(a,a),
inference(factoring,[status(thm)],[p3]) ).
cnf(p12,plain,
$false,
inference(resolution,[status(thm)],[p10,p5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN034-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 23:51:43 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.74/1.13 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.74/1.13 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------