%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LAT271-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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 : Thu Sep 24 08:48:00 AM UTC 2026
% Result : Unsatisfiable 0.10s 10.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 6 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_6,negated_conjecture,
c_in(v_x,v_S,t_a),
file('theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_7,negated_conjecture,
~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('theBenchmark.p',cls_conjecture_7) ).
cnf(cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
( c_in(c_Pair(V_a,V_x,T_a,T_a),V_r,tc_prod(T_a,T_a))
| ~ c_lessequals(V_S,c_Tarski_Ointerval(V_r,V_a,V_b,T_a),tc_set(T_a))
| ~ c_in(V_x,V_S,T_a) ),
file('theBenchmark.p',cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0) ).
cnf(t1,plain,
~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(start,[status(thm),parent(0:0)],[cls_conjecture_7]) ).
cnf(t2,plain,
( ~ c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a))
| ~ c_in(v_x,v_S,t_a)
| c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(extension,[status(thm),parent(t1:1)],[cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
c_in(v_x,v_S,t_a),
inference(extension,[status(thm),parent(t2:2)],[cls_conjecture_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
inference(extension,[status(thm),parent(t2:3)],[cls_conjecture_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT271-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.36 % Computer : n005.cluster.edu
% 0.10/10.36 % Model : x86_64 x86_64
% 0.10/10.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.36 % Memory : 8046.5625MB
% 0.10/10.36 % OS : Linux 6.8.0-71-generic
% 0.10/10.36 % CPULimit : 300
% 0.10/10.36 % WCLimit : 300
% 0.10/10.36 % DateTime : Sat Sep 19 13:00:13 UTC 2026
% 0.10/10.36 % CPUTime :
% 0.10/10.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/10.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------