%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT270-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n010.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:58:30 PM UTC 2026
% Result : Unsatisfiable 1.16s 1.77s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X2,X0,X1] :
( c_lessequals(X2,v_A,tc_set(t_a))
| ~ c_lessequals(X2,c_Tarski_Ointerval(v_r,X1,X0,t_a),tc_set(t_a))
| ~ c_in(X1,v_A,t_a)
| ~ c_in(X0,v_A,t_a) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT006-2.ax',cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0) ).
fof(f3337,negated_conjecture,
c_in(v_a,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f3338,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3339,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f3345,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
tcf(c_2814,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,v_A,tc_set(t_a))
| ~ c_in(X2,v_A,t_a)
| ~ c_in(X1,v_A,t_a)
| ~ c_lessequals(X0,c_Tarski_Ointerval(v_r,X1,X2,t_a),tc_set(t_a)) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_4962,negated_conjecture,
c_in(v_a,v_A,t_a),
inference(cnf_transformation,[],[f3337]) ).
tcf(c_4963,negated_conjecture,
c_in(v_b,v_A,t_a),
inference(cnf_transformation,[],[f3338]) ).
tcf(c_4964,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
inference(cnf_transformation,[],[f3339]) ).
tcf(c_4968,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
inference(cnf_transformation,[],[f3345]) ).
tcf(c_5268,plain,
( c_lessequals(v_S,v_A,tc_set(t_a))
| ~ c_in(v_b,v_A,t_a)
| ~ c_in(v_a,v_A,t_a) ),
inference(superposition,[status(thm)],[c_4964,c_2814]) ).
tcf(c_5272,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5268,c_4968,c_4962,c_4963]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT270-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 20:45:43 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 1.16/1.77 % SZS status Started for theBenchmark.p
% 1.16/1.77 % SZS status Unsatisfiable for theBenchmark.p
% 1.16/1.77
% 1.16/1.77 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.16/1.77
% 1.16/1.77 % ------ iProver source info
% 1.16/1.77
% 1.16/1.77 % git: date: 2026-07-19 20:42:38 +0200
% 1.16/1.77 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.16/1.77 % git: non_committed_changes: false
% 1.16/1.77
% 1.16/1.77 % ------ Parsing...% successful
% 1.16/1.77
% 1.16/1.77
% 1.16/1.77 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.16/1.77 % ------ Proving...
% 1.16/1.77 % ------ Problem Properties
% 1.16/1.77
% 1.16/1.77 %
% 1.16/1.77 % clauses 2162
% 1.16/1.77 % conjectures 7
% 1.16/1.77 % EPR 670
% 1.16/1.77 % Horn 1970
% 1.16/1.77 % unary 625
% 1.16/1.77 % binary 1083
% 1.16/1.77 % lits 4392
% 1.16/1.77 % lits eq 1178
% 1.16/1.77 % fd_pure 0
% 1.16/1.77 % fd_pseudo 0
% 1.16/1.77 % fd_cond 122
% 1.16/1.77 % fd_pseudo_cond 69
% 1.16/1.77 % AC symbols 0
% 1.16/1.77
% 1.16/1.77 % ------ Input Options Time Limit: Unbounded
% 1.16/1.77
% 1.16/1.77
% 1.16/1.77 % ------
% 1.16/1.77 % Current options:
% 1.16/1.77 % ------
% 1.16/1.77
% 1.16/1.77
% 1.16/1.77 %
% 1.16/1.77
% 1.16/1.77 % ------ Proving...
% 1.16/1.77 %
% 1.16/1.77
% 1.16/1.77 % SZS status Unsatisfiable for theBenchmark.p
% 1.16/1.77
% 1.16/1.77 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/1.77
% 1.16/1.77
%------------------------------------------------------------------------------