%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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 01:00:45 PM UTC 2026
% Result : Timeout 291.50s 57.47s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 74 ( 49 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 23 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f15,axiom,
( X = Y
| Y = f1(X,Y)
| X = f1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',indiscernibles2) ).
fof(f15_nnf,plain,
! [X,Y] :
( X = Y
| Y = f1(X,Y)
| X = f1(X,Y) ),
inference(nnf_transformation,[status(thm)],[f15]) ).
fof(f15_sk,plain,
! [X,Y] :
( X = Y
| Y = f1(X,Y)
| X = f1(X,Y) ),
inference(skolemisation,[status(esa)],[f15_nnf]) ).
cnf(c15,plain,
( X0 = X1
| X1 = f1(X0,X1)
| X0 = f1(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f15_sk]) ).
cnf(f14,axiom,
( X = Y
| there_exists(f1(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',indiscernibles1) ).
fof(f14_nnf,plain,
! [X,Y] :
( X = Y
| there_exists(f1(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [X,Y] :
( X = Y
| there_exists(f1(X,Y)) ),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c14,plain,
( X0 = X1
| there_exists(f1(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
cnf(p112,plain,
( X1 = X0
| there_exists(X1)
| X1 = X0
| X0 = f1(X1,X0) ),
inference(superposition,[status(thm)],[c15,c14]) ).
cnf(p4628,plain,
( there_exists(X1)
| X1 = X0
| X0 = f1(X1,X0) ),
inference(factoring,[status(thm)],[p112]) ).
cnf(p4629,plain,
( X0 = X1
| there_exists(X1)
| there_exists(X0)
| X0 = X1 ),
inference(superposition,[status(thm)],[p4628,c14]) ).
cnf(p6532,plain,
( there_exists(X1)
| there_exists(X0)
| X0 = X1 ),
inference(factoring,[status(thm)],[p4629]) ).
cnf(f19,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_b) ).
fof(f19_nnf,plain,
a != b,
inference(nnf_transformation,[status(thm)],[f19]) ).
fof(f19_sk,plain,
a != b,
inference(skolemisation,[status(esa)],[f19_nnf]) ).
cnf(c19,plain,
a != b,
inference(cnf_transformation,[status(esa)],[f19_sk]) ).
cnf(p6534,plain,
( there_exists(b)
| there_exists(a) ),
inference(resolution,[status(thm)],[p6532,c19]) ).
cnf(f18,hypothesis,
( b != Z
| a = Z
| ~ there_exists(Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b2) ).
fof(f18_nnf,plain,
! [Z] :
( b != Z
| a = Z
| ~ there_exists(Z) ),
inference(nnf_transformation,[status(thm)],[f18]) ).
fof(f18_sk,plain,
! [Z] :
( b != Z
| a = Z
| ~ there_exists(Z) ),
inference(skolemisation,[status(esa)],[f18_nnf]) ).
cnf(c18,plain,
( b != X0
| a = X0
| ~ there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(p63,plain,
( a = b
| ~ there_exists(b) ),
inference(equality_resolution,[status(thm)],[c18]) ).
cnf(p6544,plain,
( a = b
| there_exists(a) ),
inference(resolution,[status(thm)],[p6534,p63]) ).
cnf(p6760,plain,
there_exists(a),
inference(resolution,[status(thm)],[p6544,c19]) ).
cnf(f17,hypothesis,
( b = Z
| a != Z
| ~ there_exists(Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b1) ).
fof(f17_nnf,plain,
! [Z] :
( b = Z
| a != Z
| ~ there_exists(Z) ),
inference(nnf_transformation,[status(thm)],[f17]) ).
fof(f17_sk,plain,
! [Z] :
( b = Z
| a != Z
| ~ there_exists(Z) ),
inference(skolemisation,[status(esa)],[f17_nnf]) ).
cnf(c17,plain,
( b = X0
| a != X0
| ~ there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
cnf(p50,plain,
( b = a
| ~ there_exists(a) ),
inference(equality_resolution,[status(thm)],[c17]) ).
cnf(p6770,plain,
b = a,
inference(resolution,[status(thm)],[p6760,p50]) ).
cnf(p6771,plain,
a != a,
inference(demodulation,[status(thm)],[p6770,c19]) ).
cnf(p7050,plain,
$false,
inference(equality_resolution,[status(thm)],[p6771]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/20.41 % CPULimit : 300
% 0.07/20.41 % WCLimit : 300
% 0.07/20.41 % DateTime : Fri Sep 25 06:59:11 UTC 2026
% 0.07/20.42 % CPUTime :
% 0.07/20.42 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 291.50/57.47 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 291.50/57.47 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------