%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT275-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 : n007.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 0.22s 0.57s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 15 ( 2 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
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/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0,axiom,
( ~ c_lessequals(X1,v_A,tc_set(t_a))
| c_in(c_Tarski_Olub(X1,v_cl,t_a),v_A,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_4,negated_conjecture,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_5,negated_conjecture,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
c_0_4 ).
cnf(c_0_6,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_7,plain,
( ~ c_lessequals(X1,v_A,tc_set(t_a))
| c_in(c_Tarski_Olub(X1,v_cl,t_a),v_A,t_a) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0]) ).
cnf(c_0_8,negated_conjecture,
~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),v_A,t_a),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( ~ c_lessequals(X1,v_A,tc_set(t_a))
| c_in(c_Tarski_Olub(X1,v_cl,t_a),v_A,t_a) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_0 ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT275-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.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 23:22:37 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 0.22/0.57 % Version: 3.5.1
% 0.22/0.57 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.57 % Starting sh5l with 300s (1) cores
% 0.22/0.57 % new_bool_3 with pid 3805108 completed with status 0
% 0.22/0.57 % Result found by new_bool_3
% 0.22/0.57 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.57 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.22/0.57 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.57 % SubtermCWHack with pid 3805111 completed with status 0
% 0.22/0.57 % Result found by SubtermCWHack
% 0.22/0.57 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.22/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.57 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.22/0.57 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.57 % Preprocessing time : 0.007 s
% 0.22/0.57
% 0.22/0.57 % Proof found!
% 0.22/0.57 % SZS status Unsatisfiable
% 0.22/0.57 % SZS output start CNFRefutation
% See solution above
% 0.22/0.57 % Parsed axioms : 2752
% 0.22/0.57 % Removed by relevancy pruning/SinE : 2285
% 0.22/0.57 % Initial clauses : 467
% 0.22/0.57 % Removed in clause preprocessing : 0
% 0.22/0.57 % Initial clauses in saturation : 467
% 0.22/0.57 % Processed clauses : 1155
% 0.22/0.57 % ...of these trivial : 11
% 0.22/0.57 % ...subsumed : 693
% 0.22/0.57 % ...remaining for further processing : 451
% 0.22/0.57 % Other redundant clauses eliminated : 65
% 0.22/0.57 % Clauses deleted for lack of memory : 0
% 0.22/0.57 % Backward-subsumed : 7
% 0.22/0.57 % Backward-rewritten : 6
% 0.22/0.57 % Generated clauses : 2657
% 0.22/0.57 % ...of the previous two non-redundant : 1922
% 0.22/0.57 % ...aggressively subsumed : 0
% 0.22/0.57 % Contextual simplify-reflections : 0
% 0.22/0.57 % Paramodulations : 2575
% 0.22/0.57 % Factorizations : 2
% 0.22/0.57 % NegExts : 0
% 0.22/0.57 % Equation resolutions : 80
% 0.22/0.57 % Disequality decompositions : 0
% 0.22/0.57 % Total rewrite steps : 1292
% 0.22/0.57 % ...of those cached : 1098
% 0.22/0.57 % Propositional unsat checks : 0
% 0.22/0.57 % Propositional check models : 0
% 0.22/0.57 % Propositional check unsatisfiable : 0
% 0.22/0.57 % Propositional clauses : 0
% 0.22/0.57 % Propositional clauses after purity: 0
% 0.22/0.57 % Propositional unsat core size : 0
% 0.22/0.57 % Propositional preprocessing time : 0.000
% 0.22/0.57 % Propositional encoding time : 0.000
% 0.22/0.57 % Propositional solver time : 0.000
% 0.22/0.57 % Success case prop preproc time : 0.000
% 0.22/0.57 % Success case prop encoding time : 0.000
% 0.22/0.57 % Success case prop solver time : 0.000
% 0.22/0.57 % Current number of processed clauses : 438
% 0.22/0.57 % Positive orientable unit clauses : 91
% 0.22/0.57 % Positive unorientable unit clauses: 6
% 0.22/0.57 % Negative unit clauses : 78
% 0.22/0.57 % Non-unit-clauses : 263
% 0.22/0.57 % Current number of unprocessed clauses: 1227
% 0.22/0.57 % ...number of literals in the above : 3200
% 0.22/0.57 % Current number of archived formulas : 0
% 0.22/0.57 % Current number of archived clauses : 13
% 0.22/0.57 % Clause-clause subsumption calls (NU) : 16304
% 0.22/0.57 % Rec. Clause-clause subsumption calls : 10811
% 0.22/0.57 % Non-unit clause-clause subsumptions : 165
% 0.22/0.57 % Unit Clause-clause subsumption calls : 4834
% 0.22/0.57 % Rewrite failures with RHS unbound : 0
% 0.22/0.57 % BW rewrite match attempts : 198
% 0.22/0.57 % BW rewrite match successes : 7
% 0.22/0.57 % Condensation attempts : 0
% 0.22/0.57 % Condensation successes : 0
% 0.22/0.57 % Termbank termtop insertions : 62942
% 0.22/0.57 % Search garbage collected termcells : 7259
% 0.22/0.57
% 0.22/0.57 % -------------------------------------------------
% 0.22/0.57 % User time : 0.077 s
% 0.22/0.57 % System time : 0.009 s
% 0.22/0.57 % Total time : 0.086 s
% 0.22/0.57 % Maximum resident set size: 6176 pages
% 0.22/0.57
% 0.22/0.57 % -------------------------------------------------
% 0.22/0.57 % User time : 0.129 s
% 0.22/0.57 % System time : 0.015 s
% 0.22/0.57 % Total time : 0.144 s
% 0.22/0.57 % Maximum resident set size: 6400 pages
% 0.22/0.57 % E exiting
%------------------------------------------------------------------------------