%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN153-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n016.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:56 PM UTC 2026
% Result : Unsatisfiable 6.77s 1.44s
% Output : Proof 6.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 42 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 35 ( 12 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f158,axiom,
( ~ m0(J,A,I)
| q1(I,I,I) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_121) ).
fof(f158_nnf,plain,
! [I,J,A] :
( ~ m0(J,A,I)
| q1(I,I,I) ),
inference(nnf_transformation,[status(thm)],[f158]) ).
fof(f158_sk,plain,
! [I,J,A] :
( ~ m0(J,A,I)
| q1(I,I,I) ),
inference(skolemisation,[status(esa)],[f158_nnf]) ).
cnf(c158,plain,
( ~ m0(X1,X2,X0)
| q1(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f158_sk]) ).
cnf(hi156,axiom,
ifeq(m0(X0,X1,X2),true,q1(X2,X2,X2),true) = true,
inference(equality_encoding,[status(esa)],[c158]) ).
cnf(f3,axiom,
m0(e,d,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f3_nnf,plain,
m0(e,d,a),
inference(nnf_transformation,[status(thm)],[f3]) ).
cnf(c3,plain,
m0(e,d,a),
inference(cnf_transformation,[status(esa)],[f3_nnf]) ).
cnf(hi3,axiom,
m0(e,d,a) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(h7,plain,
q1(a,a,a) = true,
inference(hyper_resolution,[status(thm)],[hi156,hi3]) ).
cnf(f191,axiom,
( ~ q1(A,A,A)
| p2(A,A,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_154) ).
fof(f191_nnf,plain,
! [A] :
( ~ q1(A,A,A)
| p2(A,A,A) ),
inference(nnf_transformation,[status(thm)],[f191]) ).
fof(f191_sk,plain,
! [A] :
( ~ q1(A,A,A)
| p2(A,A,A) ),
inference(skolemisation,[status(esa)],[f191_nnf]) ).
cnf(c191,plain,
( ~ q1(X0,X0,X0)
| p2(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f191_sk]) ).
cnf(hi188,axiom,
ifeq(q1(X0,X0,X0),true,p2(X0,X0,X0),true) = true,
inference(equality_encoding,[status(esa)],[c191]) ).
cnf(h142,plain,
p2(a,a,a) = true,
inference(hyper_resolution,[status(thm)],[hi188,h7]) ).
cnf(f277,axiom,
( ~ p2(E,F,D)
| n3(D) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_240) ).
fof(f277_nnf,plain,
! [D,E,F] :
( ~ p2(E,F,D)
| n3(D) ),
inference(nnf_transformation,[status(thm)],[f277]) ).
fof(f277_sk,plain,
! [D,E,F] :
( ~ p2(E,F,D)
| n3(D) ),
inference(skolemisation,[status(esa)],[f277_nnf]) ).
cnf(c277,plain,
( ~ p2(X1,X2,X0)
| n3(X0) ),
inference(cnf_transformation,[status(esa)],[f277_sk]) ).
cnf(hi272,axiom,
ifeq(p2(X0,X1,X2),true,n3(X2),true) = true,
inference(equality_encoding,[status(esa)],[c277]) ).
cnf(t0,plain,
n3(a) = true,
inference(hyper_resolution,[status(thm)],[hi272,h142]) ).
cnf(t166,plain,
n3(a) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(f368,negated_conjecture,
~ n3(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ n3(a),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ n3(a),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ n3(a),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
n3(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.03 % Problem : SYN153-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n016.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:24:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.77/1.44 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.77/1.44 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------