%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN136-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 : n009.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:54 PM UTC 2026
% Result : Unsatisfiable 5.59s 6.34s
% Output : Proof 5.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 25 unt; 0 def)
% Number of atoms : 49 ( 17 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 : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 28 ( 10 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
~ m3(X,a,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
! [X] : ~ m3(X,a,a),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
! [X] : ~ m3(X,a,a),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ m3(X0,a,a),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(t179,plain,
eq(m3(X1,a,a),true) = efalse,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(t678,plain,
eq(m3(X1,a,a),true) = efalse,
inference(orient,[status(thm)],[t179]) ).
cnf(f125,axiom,
( ~ l0(a)
| p1(a,a,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_088) ).
fof(f125_nnf,plain,
( ~ l0(a)
| p1(a,a,a) ),
inference(nnf_transformation,[status(thm)],[f125]) ).
fof(f125_sk,plain,
( ~ l0(a)
| p1(a,a,a) ),
inference(skolemisation,[status(esa)],[f125_nnf]) ).
cnf(c125,plain,
( ~ l0(a)
| p1(a,a,a) ),
inference(cnf_transformation,[status(esa)],[f125_sk]) ).
cnf(hi123,axiom,
ifeq(l0(a),true,p1(a,a,a),true) = true,
inference(equality_encoding,[status(esa)],[c125]) ).
cnf(f19,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
fof(f19_nnf,plain,
l0(a),
inference(nnf_transformation,[status(thm)],[f19]) ).
cnf(c19,plain,
l0(a),
inference(cnf_transformation,[status(esa)],[f19_nnf]) ).
cnf(hi19,axiom,
l0(a) = true,
inference(equality_encoding,[status(esa)],[c19]) ).
cnf(h11,plain,
p1(a,a,a) = true,
inference(hyper_resolution,[status(thm)],[hi123,hi19]) ).
cnf(f174,axiom,
( ~ p1(B,C,A)
| n2(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).
fof(f174_nnf,plain,
! [A,B,C] :
( ~ p1(B,C,A)
| n2(A) ),
inference(nnf_transformation,[status(thm)],[f174]) ).
fof(f174_sk,plain,
! [A,B,C] :
( ~ p1(B,C,A)
| n2(A) ),
inference(skolemisation,[status(esa)],[f174_nnf]) ).
cnf(c174,plain,
( ~ p1(X1,X2,X0)
| n2(X0) ),
inference(cnf_transformation,[status(esa)],[f174_sk]) ).
cnf(hi171,axiom,
ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
inference(equality_encoding,[status(esa)],[c174]) ).
cnf(h211,plain,
n2(a) = true,
inference(hyper_resolution,[status(thm)],[hi171,h11]) ).
cnf(f273,axiom,
( ~ n2(A)
| m3(A,A,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_236) ).
fof(f273_nnf,plain,
! [A] :
( ~ n2(A)
| m3(A,A,A) ),
inference(nnf_transformation,[status(thm)],[f273]) ).
fof(f273_sk,plain,
! [A] :
( ~ n2(A)
| m3(A,A,A) ),
inference(skolemisation,[status(esa)],[f273_nnf]) ).
cnf(c273,plain,
( ~ n2(X0)
| m3(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f273_sk]) ).
cnf(hi268,axiom,
ifeq(n2(X0),true,m3(X0,X0,X0),true) = true,
inference(equality_encoding,[status(esa)],[c273]) ).
cnf(t60,plain,
m3(a,a,a) = true,
inference(hyper_resolution,[status(thm)],[hi268,h211]) ).
cnf(t676,plain,
m3(a,a,a) = true,
inference(orient,[status(thm)],[t60]) ).
cnf(t679,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t678,t676]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t677,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t720,plain,
efalse = etrue,
inference(step,[status(thm)],[t679,t677]) ).
cnf(t680,plain,
efalse = etrue,
inference(orient,[status(thm)],[t720]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t680]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN136-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/5.39 % Computer : n009.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Fri Sep 25 00:16:50 UTC 2026
% 0.11/5.40 % CPUTime :
% 0.11/5.40 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.59/6.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.59/6.34 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------