%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN263-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n012.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:12 PM UTC 2026
% Result : Unsatisfiable 3.36s 0.84s
% Output : Proof 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 28 unt; 0 def)
% Number of atoms : 48 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 54 ( 21 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f122,axiom,
( ~ p0(C,B)
| p1(B,B,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).
fof(f122_nnf,plain,
! [B,C] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(nnf_transformation,[status(thm)],[f122]) ).
fof(f122_sk,plain,
! [B,C] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(skolemisation,[status(esa)],[f122_nnf]) ).
cnf(c122,plain,
( ~ p0(X1,X0)
| p1(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f122_sk]) ).
cnf(hi120,axiom,
ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true,
inference(equality_encoding,[status(esa)],[c122]) ).
cnf(f13,axiom,
p0(b,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
fof(f13_nnf,plain,
! [X] : p0(b,X),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [X] : p0(b,X),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
p0(b,X0),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(hi13,axiom,
p0(b,X0) = true,
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(h30,plain,
p1(V0,V0,V0) = true,
inference(hyper_resolution,[status(thm)],[hi120,hi13]) ).
cnf(f119,axiom,
( ~ p1(J,H,A)
| ~ m0(J,H,A)
| p1(H,I,J) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_082) ).
fof(f119_nnf,plain,
! [H,I,J,A] :
( ~ p1(J,H,A)
| ~ m0(J,H,A)
| p1(H,I,J) ),
inference(nnf_transformation,[status(thm)],[f119]) ).
fof(f119_sk,plain,
! [H,I,J,A] :
( ~ p1(J,H,A)
| ~ m0(J,H,A)
| p1(H,I,J) ),
inference(skolemisation,[status(esa)],[f119_nnf]) ).
cnf(c119,plain,
( ~ p1(X2,X0,X3)
| ~ m0(X2,X0,X3)
| p1(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f119_sk]) ).
cnf(hi117,axiom,
ifeq(m0(X0,X1,X2),true,ifeq(p1(X0,X1,X2),true,p1(X1,X3,X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c119]) ).
cnf(f11,axiom,
m0(a,X,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(f11_nnf,plain,
! [X] : m0(a,X,a),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
! [X] : m0(a,X,a),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
m0(a,X0,a),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(hi11,axiom,
m0(a,X0,a) = true,
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(h176,plain,
p1(a,V0,a) = true,
inference(hyper_resolution,[status(thm)],[hi117,hi11,h30]) ).
cnf(f18,axiom,
m0(X,d,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_19) ).
fof(f18_nnf,plain,
! [X,Y] : m0(X,d,Y),
inference(nnf_transformation,[status(thm)],[f18]) ).
fof(f18_sk,plain,
! [X,Y] : m0(X,d,Y),
inference(skolemisation,[status(esa)],[f18_nnf]) ).
cnf(c18,plain,
m0(X0,d,X1),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(hi18,axiom,
m0(X0,d,X1) = true,
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(t70,plain,
p1(d,X1,a) = true,
inference(hyper_resolution,[status(thm)],[hi117,hi18,h176]) ).
cnf(t166,plain,
p1(d,X1,a) = true,
inference(orient,[status(thm)],[t70]) ).
cnf(f368,negated_conjecture,
~ p1(d,d,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ p1(d,d,a),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ p1(d,d,a),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ p1(d,d,a),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
p1(d,d,a) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t166]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN263-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Fri Sep 25 00:39:35 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.36/0.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/0.84 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------