%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : COL122-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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:02:08 PM UTC 2026
% Result : Unsatisfiable 5.66s 1.20s
% Output : Proof 5.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 15 unt; 0 def)
% Number of atoms : 23 ( 7 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 : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 20 ( 3 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
( ~ c_in(c_Pair(v_xaa,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,V_U,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1_nnf,plain,
! [V_U] :
( ~ c_in(c_Pair(v_xaa,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,V_U,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [V_U] :
( ~ c_in(c_Pair(v_xaa,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,V_U,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( ~ c_in(c_Pair(v_xaa,X0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(c_in(c_Pair(v_x,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)),true,ifeq(c_in(c_Pair(v_xaa,X0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f0,negated_conjecture,
c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f0_nnf,plain,
c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,negated_conjecture,
c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f2,axiom,
c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0) ).
fof(f2_nnf,plain,
! [V_a,T_a,V_r] : c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [V_a,T_a,V_r] : c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
c_in(c_Pair(X0,X0,X1,X1),c_Transitive__Closure_Ortrancl(X2,X1),tc_prod(X1,X1)),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi1,axiom,
c_in(c_Pair(X0,X0,X1,X1),c_Transitive__Closure_Ortrancl(X2,X1),tc_prod(X1,X1)) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi2,hi0,hi1]) ).
cnf(t11,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t11]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL122-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.03/0.36 % Computer : n014.cluster.edu
% 0.03/0.36 % Model : x86_64 x86_64
% 0.03/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.36 % Memory : 8046.5625MB
% 0.03/0.36 % OS : Linux 6.8.0-71-generic
% 0.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Fri Sep 25 07:40:47 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.66/1.20 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.66/1.20 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------