%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LAT271-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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 : Sun Sep 27 07:49:58 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 13 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(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,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( c_in(c_Pair(VAR_4,VAR_0,VAR_2,VAR_2),VAR_3,tc_prod(VAR_2,VAR_2))
| ~ c_lessequals(VAR_1,c_Tarski_Ointerval(VAR_3,VAR_4,VAR_5,VAR_2),tc_set(VAR_2))
| ~ c_in(VAR_0,VAR_1,VAR_2) ),
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(c_1,plain,
( c_in(c_Pair(E,A,C,C),D,tc_prod(C,C))
| ~ c_lessequals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C))
| ~ c_in(A,B,C) ),
inference(clausify,[status(thm)],[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]) ).
fof(cls_conjecture_2,axiom,
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(c_2,plain,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
cnf(c_3,plain,
( c_in(c_Pair(v_a,A,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(A,v_S,t_a) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(cls_conjecture_7,axiom,
~ 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(c_4,plain,
~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(clausify,[status(thm)],[cls_conjecture_7]) ).
fof(cls_conjecture_6,axiom,
c_in(v_x,v_S,t_a),
file('theBenchmark.p',cls_conjecture_6) ).
cnf(c_5,plain,
c_in(v_x,v_S,t_a),
inference(clausify,[status(thm)],[cls_conjecture_6]) ).
cnf(c_6,plain,
~ c_in(v_x,v_S,t_a),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_7,plain,
$false,
inference(resolve,[status(thm)],[c_6,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT271-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 20:22:44 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 2460179 was started by sandbox on n009,
% 0.09/0.36 % Fri Sep 25 20:22:44 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 7.
% 0.09/0.37 % Level of proof is 3.
% 0.09/0.37 % Maximum clause weight is 14.000.
% 0.09/0.37 % Given clauses 2.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------