%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LAT272-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/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:56:34 PM UTC 2026
% Result : Unsatisfiable 6.62s 1.31s
% Output : Proof 6.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 30 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-4 aty)
% Number of variables : 15 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f3,axiom,
( c_in(c_Pair(V_y,V_L,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_y,V_S,t_a)
| ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_5_h2f666f6d9f9463de) ).
fof(f3_nnf,plain,
! [V_S,V_L,V_y] :
( c_in(c_Pair(V_y,V_L,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_y,V_S,t_a)
| ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [V_S,V_L,V_y] :
( c_in(c_Pair(V_y,V_L,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_y,V_S,t_a)
| ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X2,X0,t_a)
| ~ c_Tarski_OisLub(X0,v_cl,X1,t_a) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi2,axiom,
ifeq(c_Tarski_OisLub(X0,v_cl,X1,t_a),true,ifeq(c_in(X2,X0,t_a),true,c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)),true),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f0,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
fof(f0_nnf,plain,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f1,negated_conjecture,
c_in(v_x,v_S,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
fof(f1_nnf,plain,
c_in(v_x,v_S,t_a),
inference(nnf_transformation,[status(thm)],[f1]) ).
cnf(c1,plain,
c_in(v_x,v_S,t_a),
inference(cnf_transformation,[status(esa)],[f1_nnf]) ).
cnf(hi1,negated_conjecture,
c_in(v_x,v_S,t_a) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t3,plain,
c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)) = true,
inference(hyper_resolution,[status(thm)],[hi2,hi0,hi1]) ).
cnf(t7,plain,
c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(f2,negated_conjecture,
~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).
fof(f2_nnf,plain,
~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(goal_0,negated_conjecture,
c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)) != true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t7]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT272-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n014.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 20:46:05 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.62/1.31 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.62/1.31 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------