%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT273-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 01:04:38 PM UTC 2026
% Result : Unsatisfiable 12.49s 2.47s
% Output : CNFRefutation 12.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 11 unt; 4 nHn; 24 RR)
% Number of literals : 54 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 41 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
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_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
( ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(c_Pair(X1,X6,X3,X3),X4,tc_prod(X3,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT006-2.ax',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_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) ).
cnf(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
( ~ c_in(X3,v_A,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| c_in(v_sko__4mi(X1,v_r,X3),X1,t_a)
| c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT006-2.ax',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) ).
cnf(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1,axiom,
( ~ c_in(c_Pair(v_sko__4mi(X1,v_r,X3),X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X3,v_A,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT006-2.ax',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) ).
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('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_4,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_6,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_7,plain,
( ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(c_Pair(X1,X6,X3,X3),X4,tc_prod(X3,X3)) ),
inference(fof_simplification,[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_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0]) ).
cnf(c_0_8,plain,
( ~ c_in(X3,v_A,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| c_in(v_sko__4mi(X1,v_r,X3),X1,t_a)
| c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0]) ).
cnf(c_0_9,plain,
( ~ c_in(c_Pair(v_sko__4mi(X1,v_r,X3),X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X3,v_A,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1]) ).
cnf(c_0_10,plain,
( ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(c_Pair(X1,X6,X3,X3),X4,tc_prod(X3,X3)) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
cls_conjecture_2 ).
cnf(c_0_12,plain,
( ~ c_in(X3,v_A,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| c_in(v_sko__4mi(X1,v_r,X3),X1,t_a)
| c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
cls_conjecture_4 ).
cnf(c_0_14,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_15,plain,
( ~ c_in(c_Pair(v_sko__4mi(X1,v_r,X3),X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X3,v_A,t_a)
| ~ c_Tarski_OisLub(X1,v_cl,X2,t_a)
| c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_9 ).
cnf(c_0_16,negated_conjecture,
( ~ c_in(X1,v_S,t_a)
| c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
c_in(v_b,v_A,t_a),
cls_conjecture_1 ).
cnf(c_0_18,negated_conjecture,
( ~ c_in(X1,v_A,t_a)
| c_in(v_sko__4mi(v_S,v_r,X1),v_S,t_a)
| c_in(c_Pair(v_L,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( ~ c_in(v_sko__4mi(X2,v_r,v_b),v_S,t_a)
| ~ c_Tarski_OisLub(X2,v_cl,X1,t_a)
| c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( ~ c_Tarski_OisLub(v_S,v_cl,X1,t_a)
| c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT273-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.70 % Computer : n006.cluster.edu
% 0.11/0.70 % Model : x86_64 x86_64
% 0.11/0.70 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.70 % Memory : 8046.5625MB
% 0.11/0.70 % OS : Linux 6.8.0-71-generic
% 0.11/0.71 % CPULimit : 300
% 0.11/0.71 % WCLimit : 300
% 0.11/0.71 % DateTime : Sun Sep 20 23:24:30 UTC 2026
% 0.11/0.71 % CPUTime :
% 0.11/0.71 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.75 Running first-order theorem proving
% 0.11/0.75 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.49/2.47 % Version: 3.5.1
% 12.49/2.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.49/2.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.49/2.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.49/2.47 % Starting new_bool_3 with 300s (1) cores
% 12.49/2.47 % Starting new_bool_1 with 300s (1) cores
% 12.49/2.47 % Starting sh5l with 300s (1) cores
% 12.49/2.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1473086 completed with status 0
% 12.49/2.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.49/2.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.49/2.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.49/2.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.49/2.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.49/2.47 % No SInE strategy applied
% 12.49/2.47 % Search class: FGHSM-SMLM33-DFFFFFNN
% 12.49/2.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 12.49/2.47 % Starting SubtermCWHack with 136s (1) cores
% 12.49/2.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.49/2.47 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.49/2.47 % Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 12.49/2.47 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 12.49/2.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1473094 completed with status 0
% 12.49/2.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.49/2.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.49/2.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.49/2.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.49/2.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.49/2.47 % No SInE strategy applied
% 12.49/2.47 % Search class: FGHSM-SMLM33-DFFFFFNN
% 12.49/2.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 12.49/2.47 % Starting SubtermCWHack with 136s (1) cores
% 12.49/2.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.49/2.47 % Preprocessing time : 0.033 s
% 12.49/2.47 % Presaturation interreduction done
% 12.49/2.47
% 12.49/2.47 % Proof found!
% 12.49/2.47 % SZS status Unsatisfiable
% 12.49/2.47 % SZS output start CNFRefutation
% See solution above
% 12.49/2.47 % Parsed axioms : 2758
% 12.49/2.47 % Removed by relevancy pruning/SinE : 0
% 12.49/2.47 % Initial clauses : 2758
% 12.49/2.47 % Removed in clause preprocessing : 9
% 12.49/2.47 % Initial clauses in saturation : 2749
% 12.49/2.47 % Processed clauses : 9231
% 12.49/2.47 % ...of these trivial : 53
% 12.49/2.47 % ...subsumed : 3468
% 12.49/2.47 % ...remaining for further processing : 5710
% 12.49/2.47 % Other redundant clauses eliminated : 161
% 12.49/2.47 % Clauses deleted for lack of memory : 0
% 12.49/2.47 % Backward-subsumed : 58
% 12.49/2.47 % Backward-rewritten : 70
% 12.49/2.47 % Generated clauses : 24367
% 12.49/2.47 % ...of the previous two non-redundant : 20854
% 12.49/2.47 % ...aggressively subsumed : 0
% 12.49/2.47 % Contextual simplify-reflections : 10
% 12.49/2.47 % Paramodulations : 24158
% 12.49/2.47 % Factorizations : 1
% 12.49/2.47 % NegExts : 0
% 12.49/2.47 % Equation resolutions : 208
% 12.49/2.47 % Disequality decompositions : 0
% 12.49/2.47 % Total rewrite steps : 11228
% 12.49/2.47 % ...of those cached : 9712
% 12.49/2.47 % Propositional unsat checks : 1
% 12.49/2.47 % Propositional check models : 1
% 12.49/2.47 % Propositional check unsatisfiable : 0
% 12.49/2.47 % Propositional clauses : 0
% 12.49/2.47 % Propositional clauses after purity: 0
% 12.49/2.47 % Propositional unsat core size : 0
% 12.49/2.47 % Propositional preprocessing time : 0.000
% 12.49/2.47 % Propositional encoding time : 0.020
% 12.49/2.47 % Propositional solver time : 0.022
% 12.49/2.47 % Success case prop preproc time : 0.000
% 12.49/2.47 % Success case prop encoding time : 0.000
% 12.49/2.47 % Success case prop solver time : 0.000
% 12.49/2.47 % Current number of processed clauses : 2959
% 12.49/2.47 % Positive orientable unit clauses : 628
% 12.49/2.47 % Positive unorientable unit clauses: 8
% 12.49/2.47 % Negative unit clauses : 98
% 12.49/2.47 % Non-unit-clauses : 2225
% 12.49/2.47 % Current number of unprocessed clauses: 16941
% 12.49/2.47 % ...number of literals in the above : 61324
% 12.49/2.47 % Current number of archived formulas : 0
% 12.49/2.47 % Current number of archived clauses : 2759
% 12.49/2.47 % Clause-clause subsumption calls (NU) : 4644402
% 12.49/2.47 % Rec. Clause-clause subsumption calls : 3011922
% 12.49/2.47 % Non-unit clause-clause subsumptions : 3035
% 12.49/2.47 % Unit Clause-clause subsumption calls : 153912
% 12.49/2.47 % Rewrite failures with RHS unbound : 0
% 12.49/2.47 % BW rewrite match attempts : 917
% 12.49/2.47 % BW rewrite match successes : 49
% 12.49/2.47 % Condensation attempts : 0
% 12.49/2.47 % Condensation successes : 0
% 12.49/2.47 % Termbank termtop insertions : 568504
% 12.49/2.47 % Search garbage collected termcells : 4032
% 12.49/2.47
% 12.49/2.47 % -------------------------------------------------
% 12.49/2.47 % User time : 1.565 s
% 12.49/2.47 % System time : 0.055 s
% 12.49/2.47 % Total time : 1.620 s
% 12.49/2.47 % Maximum resident set size: 8496 pages
% 12.49/2.47
% 12.49/2.47 % -------------------------------------------------
% 12.49/2.47 % User time : 7.679 s
% 12.49/2.47 % System time : 0.257 s
% 12.49/2.47 % Total time : 7.936 s
% 12.49/2.47 % Maximum resident set size: 6656 pages
% 12.49/2.47 % E exiting
%------------------------------------------------------------------------------