%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT270-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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.51s 1.27s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 16 unt; 2 def)
% Number of atoms : 48 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 29 ( 16 ~; 13 |; 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 : 6 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 11 ( 0 sgn 11 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_in(v_a,v_A,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f4,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).
fof(f5,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/sandbox/benchmark/theBenchmark.p',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) ).
tcf(c_54,negated_conjecture,
c_in(v_a,v_A,t_a),
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,negated_conjecture,
c_in(v_b,v_A,t_a),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,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,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = tc_set(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,definition,
iPr_def_11 = c_Tarski_Ointerval(v_r,v_a,v_b,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,negated_conjecture,
~ c_lessequals(v_S,v_A,iPr_def_10),
inference(demodulation,[status(thm)],[c_57,c_76]) ).
tcf(c_79,negated_conjecture,
c_lessequals(v_S,iPr_def_11,iPr_def_10),
inference(demodulation,[status(thm)],[c_56,c_77]) ).
tcf(c_80,negated_conjecture,
c_in(v_b,v_A,t_a),
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_81,negated_conjecture,
c_in(v_a,v_A,t_a),
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_219,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,v_A,iPr_def_10)
| ~ 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),iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_58,c_76]) ).
tcf(c_224,plain,
! [X0: $i] :
( c_lessequals(X0,v_A,iPr_def_10)
| ~ c_in(v_b,v_A,t_a)
| ~ c_in(v_a,v_A,t_a)
| ~ c_lessequals(X0,iPr_def_11,iPr_def_10) ),
inference(superposition,[status(thm)],[c_77,c_219]) ).
tcf(c_225,plain,
! [X0: $i] :
( c_lessequals(X0,v_A,iPr_def_10)
| ~ c_lessequals(X0,iPr_def_11,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_224,c_80,c_81]) ).
tcf(c_233,plain,
c_lessequals(v_S,v_A,iPr_def_10),
inference(superposition,[status(thm)],[c_79,c_225]) ).
tcf(c_234,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_233,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT270-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n026.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.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Wed Sep 23 20:48:40 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.41
% 0.03/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41
% 0.03/0.41 % Detected problem language: tptp
% 0.03/0.42 % Proving...
% 1.51/1.27 % SZS status Started for theBenchmark.p
% 1.51/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.51/1.27
% 1.51/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.51/1.27
% 1.51/1.27 % ------ iProver source info
% 1.51/1.27
% 1.51/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.51/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.51/1.27 % git: non_committed_changes: false
% 1.51/1.27
% 1.51/1.27 % ------ Parsing...% successful
% 1.51/1.27
% 1.51/1.27
% 1.51/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.51/1.27
% 1.51/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.51/1.27
% 1.51/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.51/1.27
% 1.51/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.51/1.27 % ------ Proving...
% 1.51/1.27 % ------ Problem Properties
% 1.51/1.27
% 1.51/1.27 %
% 1.51/1.27 % clauses 7
% 1.51/1.27 % conjectures 4
% 1.51/1.27 % EPR 4
% 1.51/1.27 % Horn 7
% 1.51/1.27 % unary 6
% 1.51/1.27 % binary 0
% 1.51/1.27 % lits 10
% 1.51/1.27 % lits eq 2
% 1.51/1.27 % fd_pure 0
% 1.51/1.27 % fd_pseudo 0
% 1.51/1.27 % fd_cond 0
% 1.51/1.27 % fd_pseudo_cond 0
% 1.51/1.27 % AC symbols 0
% 1.51/1.27
% 1.51/1.27 % ------ Schedule dynamic 5 is on
% 1.51/1.27
% 1.51/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.51/1.27
% 1.51/1.27
% 1.51/1.27 % ------
% 1.51/1.27 % Current options:
% 1.51/1.27 % ------
% 1.51/1.27
% 1.51/1.27
% 1.51/1.27 %
% 1.51/1.27
% 1.51/1.27 % ------ Proving...
% 1.51/1.27 %
% 1.51/1.27
% 1.51/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.51/1.27
% 1.51/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.51/1.27
% 1.51/1.27
%------------------------------------------------------------------------------