%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT268-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:36 PM UTC 2026
% Result : Unsatisfiable 259.84s 38.14s
% Output : CNFRefutation 259.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 28 ( 21 unt; 0 nHn; 24 RR)
% Number of literals : 46 ( 8 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-4 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_OCL_Olub__upper_0,axiom,
( ~ c_lessequals(X2,c_Tarski_Opotype_Opset(X4,X3,tc_Product__Type_Ounit),tc_set(X3))
| ~ c_in(X4,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X1,X2,X3)
| c_in(c_Pair(X1,c_Tarski_Olub(X2,X4,X3),X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_OCL_Olub__upper_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,v_S,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0,axiom,
( ~ c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0) ).
cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) ).
cnf(cls_Tarski_Oglb__dual__lub_0,axiom,
c_Tarski_Oglb(X1,X2,X3) = c_Tarski_Olub(X1,c_Tarski_Odual(X2,X3),X3),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Oglb__dual__lub_0) ).
cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).
cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Tarski_Or_A_61_61_Aorder_Acl_0,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/Axioms/LAT006-1.ax',cls_Tarski_Or_A_61_61_Aorder_Acl_0) ).
cnf(c_0_11,plain,
( ~ c_lessequals(X2,c_Tarski_Opotype_Opset(X4,X3,tc_Product__Type_Ounit),tc_set(X3))
| ~ c_in(X4,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X1,X2,X3)
| c_in(c_Pair(X1,c_Tarski_Olub(X2,X4,X3),X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_OCL_Olub__upper_0]) ).
cnf(c_0_12,plain,
( ~ c_lessequals(X2,c_Tarski_Opotype_Opset(X4,X3,tc_Product__Type_Ounit),tc_set(X3))
| ~ c_in(X4,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X4,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit))
| ~ c_in(X1,X2,X3)
| c_in(c_Pair(X1,c_Tarski_Olub(X2,X4,X3),X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
c_0_11 ).
cnf(c_0_13,negated_conjecture,
c_in(v_x,v_S,t_a),
cls_conjecture_1 ).
cnf(c_0_14,plain,
( ~ c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))
| ~ c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))
| ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(X1,t_a,tc_Product__Type_Ounit),tc_set(t_a))
| c_in(c_Pair(v_x,c_Tarski_Olub(v_S,X1,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(X1,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0 ).
cnf(c_0_17,axiom,
c_Tarski_Oglb(X1,X2,X3) = c_Tarski_Olub(X1,c_Tarski_Odual(X2,X3),X3),
cls_Tarski_Oglb__dual__lub_0 ).
cnf(c_0_18,axiom,
c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0 ).
cnf(c_0_19,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_OA_A_61_61_Apset_Acl_0 ).
cnf(c_0_20,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0 ).
cnf(c_0_21,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_Tarski_Odual_Acl_A_58_APartialOrder_0 ).
cnf(c_0_22,negated_conjecture,
~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_23,plain,
( ~ c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3))
| c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)) ),
c_0_14 ).
cnf(c_0_24,negated_conjecture,
c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_Or_A_61_61_Aorder_Acl_0 ).
cnf(c_0_26,negated_conjecture,
~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT268-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 23:24:11 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.43 Running first-order theorem proving
% 0.03/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 259.84/38.14 % Version: 3.5.1
% 259.84/38.14 % Preprocessing class: FMLMSMSMSSSNFFN.
% 259.84/38.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 259.84/38.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 259.84/38.14 % Starting new_bool_3 with 300s (1) cores
% 259.84/38.14 % Starting new_bool_1 with 300s (1) cores
% 259.84/38.14 % Starting sh5l with 300s (1) cores
% 259.84/38.14 % new_bool_1 with pid 411182 completed with status 0
% 259.84/38.14 % Result found by new_bool_1
% 259.84/38.14 % Preprocessing class: FMLMSMSMSSSNFFN.
% 259.84/38.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 259.84/38.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 259.84/38.14 % Starting new_bool_3 with 300s (1) cores
% 259.84/38.14 % Starting new_bool_1 with 300s (1) cores
% 259.84/38.14 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 259.84/38.14 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 259.84/38.14 % Search class: FGHSM-FSLM32-MFFFFFNN
% 259.84/38.14 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 259.84/38.14 % Starting SubtermCWHack with 28s (1) cores
% 259.84/38.14 % SubtermCWHack with pid 411185 completed with status 8
% 259.84/38.14 % Starting new_bool_1 with 31s (1) cores
% 259.84/38.14 % new_bool_1 with pid 411804 completed with status 0
% 259.84/38.14 % Result found by new_bool_1
% 259.84/38.14 % Preprocessing class: FMLMSMSMSSSNFFN.
% 259.84/38.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 259.84/38.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 259.84/38.14 % Starting new_bool_3 with 300s (1) cores
% 259.84/38.14 % Starting new_bool_1 with 300s (1) cores
% 259.84/38.14 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 259.84/38.14 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 259.84/38.14 % Search class: FGHSM-FSLM32-MFFFFFNN
% 259.84/38.14 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 259.84/38.14 % Starting SubtermCWHack with 28s (1) cores
% 259.84/38.14 % SubtermCWHack with pid 411185 completed with status 8
% 259.84/38.14 % Starting new_bool_1 with 31s (1) cores
% 259.84/38.14 % Preprocessing time : 0.009 s
% 259.84/38.14 % Presaturation interreduction done
% 259.84/38.14
% 259.84/38.14 % Proof found!
% 259.84/38.14 % SZS status Unsatisfiable
% 259.84/38.14 % SZS output start CNFRefutation
% See solution above
% 259.84/38.14 % Parsed axioms : 2752
% 259.84/38.14 % Removed by relevancy pruning/SinE : 2290
% 259.84/38.14 % Initial clauses : 462
% 259.84/38.14 % Removed in clause preprocessing : 0
% 259.84/38.14 % Initial clauses in saturation : 462
% 259.84/38.14 % Processed clauses : 44058
% 259.84/38.14 % ...of these trivial : 171
% 259.84/38.14 % ...subsumed : 37563
% 259.84/38.14 % ...remaining for further processing : 6324
% 259.84/38.14 % Other redundant clauses eliminated : 16889
% 259.84/38.14 % Clauses deleted for lack of memory : 0
% 259.84/38.14 % Backward-subsumed : 470
% 259.84/38.14 % Backward-rewritten : 59
% 259.84/38.14 % Generated clauses : 427716
% 259.84/38.14 % ...of the previous two non-redundant : 301771
% 259.84/38.14 % ...aggressively subsumed : 0
% 259.84/38.14 % Contextual simplify-reflections : 46
% 259.84/38.14 % Paramodulations : 410710
% 259.84/38.14 % Factorizations : 22
% 259.84/38.14 % NegExts : 0
% 259.84/38.14 % Equation resolutions : 16984
% 259.84/38.14 % Disequality decompositions : 0
% 259.84/38.14 % Total rewrite steps : 257784
% 259.84/38.14 % ...of those cached : 248868
% 259.84/38.14 % Propositional unsat checks : 1
% 259.84/38.14 % Propositional check models : 0
% 259.84/38.14 % Propositional check unsatisfiable : 0
% 259.84/38.14 % Propositional clauses : 0
% 259.84/38.14 % Propositional clauses after purity: 0
% 259.84/38.14 % Propositional unsat core size : 0
% 259.84/38.14 % Propositional preprocessing time : 0.000
% 259.84/38.14 % Propositional encoding time : 0.293
% 259.84/38.14 % Propositional solver time : 0.241
% 259.84/38.14 % Success case prop preproc time : 0.000
% 259.84/38.14 % Success case prop encoding time : 0.000
% 259.84/38.14 % Success case prop solver time : 0.000
% 259.84/38.14 % Current number of processed clauses : 5368
% 259.84/38.14 % Positive orientable unit clauses : 349
% 259.84/38.14 % Positive unorientable unit clauses: 18
% 259.84/38.14 % Negative unit clauses : 1107
% 259.84/38.14 % Non-unit-clauses : 3894
% 259.84/38.14 % Current number of unprocessed clauses: 257672
% 259.84/38.14 % ...number of literals in the above : 686599
% 259.84/38.14 % Current number of archived formulas : 0
% 259.84/38.14 % Current number of archived clauses : 956
% 259.84/38.14 % Clause-clause subsumption calls (NU) : 2500684
% 259.84/38.14 % Rec. Clause-clause subsumption calls : 1110560
% 259.84/38.14 % Non-unit clause-clause subsumptions : 15239
% 259.84/38.14 % Unit Clause-clause subsumption calls : 197943
% 259.84/38.14 % Rewrite failures with RHS unbound : 0
% 259.84/38.14 % BW rewrite match attempts : 1482
% 259.84/38.14 % BW rewrite match successes : 450
% 259.84/38.14 % Condensation attempts : 0
% 259.84/38.14 % Condensation successes : 0
% 259.84/38.14 % Termbank termtop insertions : 6655062
% 259.84/38.14 % Search garbage collected termcells : 7261
% 259.84/38.14
% 259.84/38.14 % -------------------------------------------------
% 259.84/38.14 % User time : 36.122 s
% 259.84/38.14 % System time : 1.043 s
% 259.84/38.14 % Total time : 37.164 s
% 259.84/38.14 % Maximum resident set size: 6180 pages
% 259.84/38.14
% 259.84/38.14 % -------------------------------------------------
% 259.84/38.14 % User time : 36.177 s
% 259.84/38.14 % System time : 1.049 s
% 259.84/38.14 % Total time : 37.226 s
% 259.84/38.14 % Maximum resident set size: 6400 pages
% 259.84/38.14 % E exiting
%------------------------------------------------------------------------------