%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : CAT019-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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 01:00:45 PM UTC 2026
% Result : Unsatisfiable 5.59s 1.16s
% Output : Proof 5.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-4 aty)
% Number of variables : 12 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f8,hypothesis,
( c1 != Z
| c2 = Z ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_to_c1_and_c2_2) ).
fof(f8_nnf,plain,
! [Z] :
( c1 != Z
| c2 = Z ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [Z] :
( c1 != Z
| c2 = Z ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
( c1 != X0
| c2 = X0 ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(hi8,axiom,
ifeq(c1,X0,c2,X0) = X0,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(f2,axiom,
compose(domain(X),X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_composition) ).
fof(f2_nnf,plain,
! [X] : compose(domain(X),X) = X,
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] : compose(domain(X),X) = X,
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
compose(domain(X0),X0) = X0,
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
compose(domain(X0),X0) = X0,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t8,plain,
compose(domain(c1),c1) = c2,
inference(hyper_resolution,[status(thm)],[hi8,hi2]) ).
cnf(t6,plain,
compose(domain(X1),X1) = X1,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t26,plain,
compose(domain(X1),X1) = X1,
inference(orient,[status(thm)],[t6]) ).
cnf(t62,plain,
c1 = c2,
inference(step,[status(thm)],[t8,t26]) ).
cnf(t53,plain,
c1 = c2,
inference(orient,[status(thm)],[t62]) ).
cnf(f9,negated_conjecture,
c2 != c1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c1_equals_c2) ).
fof(f9_nnf,plain,
c2 != c1,
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
c2 != c1,
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
c2 != c1,
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(goal_0,negated_conjecture,
c2 != c1,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(g0_0,plain,
c2 != c2,
inference(rw,[status(thm)],[goal_0,t53]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT019-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.34 % Computer : n016.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Fri Sep 25 07:02:58 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.59/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.59/1.16 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------