↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT269-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 : n003.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:37 PM UTC 2026

% Result   : Unsatisfiable 0.73s 1.00s
% Output   : CNFRefutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (  11 unt;   3 nHn;  17 RR)
%            Number of literals    :   29 (   9 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;  10 con; 0-5 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Tarski_Ox1_A_58_AA_A_61_61_62_Ainterval_Ar_Ax1_A_ITop_Acl_J_A_61_A_123_125_A_61_61_AFalse_0,axiom,
    ( c_Tarski_Ointerval(v_r,X1,c_Tarski_OTop(v_cl,t_a),t_a) != c_emptyset
    | ~ c_in(X1,v_A,t_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Ox1_A_58_AA_A_61_61_62_Ainterval_Ar_Ax1_A_ITop_Acl_J_A_61_A_123_125_A_61_61_AFalse_0) ).

cnf(cls_Tarski_O_91_124_Aa2_A_58_AA_59_Ab2_A_58_AA_59_Ainterval_Ar_Aa2_Ab2_A_126_61_A_123_125_A_124_93_A_61_61_62_A_I_124_Apset_A_61_Ainterval_Ar_Aa2_Ab2_M_Aorder_A_61_Ainduced_A_Iinterval_Ar_Aa2_Ab2_J_Ar_A_124_J_A_58_ACompleteLattice_A_61_61_ATrue_0,axiom,
    ( ~ c_in(X2,v_A,t_a)
    | ~ c_in(X1,v_A,t_a)
    | c_Tarski_Ointerval(v_r,X2,X1,t_a) = c_emptyset
    | c_in(c_Tarski_Opotype_Opotype__ext(c_Tarski_Ointerval(v_r,X2,X1,t_a),c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,X2,X1,t_a),v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_91_124_Aa2_A_58_AA_59_Ab2_A_58_AA_59_Ainterval_Ar_Aa2_Ab2_A_126_61_A_123_125_A_124_93_A_61_61_62_A_I_124_Apset_A_61_Ainterval_Ar_Aa2_Ab2_M_Aorder_A_61_Ainduced_A_Iinterval_Ar_Aa2_Ab2_J_Ar_A_124_J_A_58_ACompleteLattice_A_61_61_ATrue_0) ).

cnf(cls_Tarski_OintY1_A_61_61_Ainterval_Ar_A_Ilub_AY_Acl_J_A_ITop_Acl_J_0,axiom,
    v_intY1 = c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OintY1_A_61_61_Ainterval_Ar_A_Ilub_AY_Acl_J_A_ITop_Acl_J_0) ).

cnf(cls_Tarski_Olub_AY_Acl_A_58_AA_A_61_61_ATrue_0,axiom,
    c_in(c_Tarski_Olub(v_Y,v_cl,t_a),v_A,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Olub_AY_Acl_A_58_AA_A_61_61_ATrue_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_in(c_Tarski_Opotype_Opotype__ext(v_intY1,c_Tarski_Oinduced(v_intY1,v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Tarski_OTop_Acl_A_58_AA_A_61_61_ATrue_0,axiom,
    c_in(c_Tarski_OTop(v_cl,t_a),v_A,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OTop_Acl_A_58_AA_A_61_61_ATrue_0) ).

cnf(c_0_6,plain,
    ( c_Tarski_Ointerval(v_r,X1,c_Tarski_OTop(v_cl,t_a),t_a) != c_emptyset
    | ~ c_in(X1,v_A,t_a) ),
    inference(fof_simplification,[status(thm)],[cls_Tarski_Ox1_A_58_AA_A_61_61_62_Ainterval_Ar_Ax1_A_ITop_Acl_J_A_61_A_123_125_A_61_61_AFalse_0]) ).

cnf(c_0_7,plain,
    ( ~ c_in(X2,v_A,t_a)
    | ~ c_in(X1,v_A,t_a)
    | c_Tarski_Ointerval(v_r,X2,X1,t_a) = c_emptyset
    | c_in(c_Tarski_Opotype_Opotype__ext(c_Tarski_Ointerval(v_r,X2,X1,t_a),c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,X2,X1,t_a),v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ),
    inference(fof_simplification,[status(thm)],[cls_Tarski_O_91_124_Aa2_A_58_AA_59_Ab2_A_58_AA_59_Ainterval_Ar_Aa2_Ab2_A_126_61_A_123_125_A_124_93_A_61_61_62_A_I_124_Apset_A_61_Ainterval_Ar_Aa2_Ab2_M_Aorder_A_61_Ainduced_A_Iinterval_Ar_Aa2_Ab2_J_Ar_A_124_J_A_58_ACompleteLattice_A_61_61_ATrue_0]) ).

cnf(c_0_8,plain,
    ( c_Tarski_Ointerval(v_r,X1,c_Tarski_OTop(v_cl,t_a),t_a) != c_emptyset
    | ~ c_in(X1,v_A,t_a) ),
    c_0_6 ).

cnf(c_0_9,axiom,
    v_intY1 = c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),
    cls_Tarski_OintY1_A_61_61_Ainterval_Ar_A_Ilub_AY_Acl_J_A_ITop_Acl_J_0 ).

cnf(c_0_10,axiom,
    c_in(c_Tarski_Olub(v_Y,v_cl,t_a),v_A,t_a),
    cls_Tarski_Olub_AY_Acl_A_58_AA_A_61_61_ATrue_0 ).

cnf(c_0_11,negated_conjecture,
    ~ c_in(c_Tarski_Opotype_Opotype__ext(v_intY1,c_Tarski_Oinduced(v_intY1,v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_12,plain,
    ( ~ c_in(X2,v_A,t_a)
    | ~ c_in(X1,v_A,t_a)
    | c_Tarski_Ointerval(v_r,X2,X1,t_a) = c_emptyset
    | c_in(c_Tarski_Opotype_Opotype__ext(c_Tarski_Ointerval(v_r,X2,X1,t_a),c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,X2,X1,t_a),v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ),
    c_0_7 ).

cnf(c_0_13,axiom,
    c_in(c_Tarski_OTop(v_cl,t_a),v_A,t_a),
    cls_Tarski_OTop_Acl_A_58_AA_A_61_61_ATrue_0 ).

cnf(c_0_14,plain,
    v_intY1 != c_emptyset,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_15,negated_conjecture,
    ~ c_in(c_Tarski_Opotype_Opotype__ext(v_intY1,c_Tarski_Oinduced(v_intY1,v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    c_0_11 ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_10]),c_0_13])]),c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT269-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.35  % Computer : n003.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sun Sep 20 23:26:00 UTC 2026
% 0.07/0.36  % CPUTime  : 
% 0.07/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  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.73/1.00  % Version: 3.5.1
% 0.73/1.00  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.73/1.00  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.73/1.00  % Starting new_bool_3 with 300s (1) cores
% 0.73/1.00  % Starting new_bool_1 with 300s (1) cores
% 0.73/1.00  % Starting sh5l with 300s (1) cores
% 0.73/1.00  % new_bool_1 with pid 2838224 completed with status 0
% 0.73/1.00  % Result found by new_bool_1
% 0.73/1.00  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.73/1.00  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.73/1.00  % Starting new_bool_3 with 300s (1) cores
% 0.73/1.00  % Starting new_bool_1 with 300s (1) cores
% 0.73/1.00  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.73/1.00  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.73/1.00  % Search class: FGHSM-FFLM32-MFFFFFNN
% 0.73/1.00  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.73/1.00  % Starting SubtermCWHack with 31s (1) cores
% 0.73/1.00  % SubtermCWHack with pid 2838233 completed with status 0
% 0.73/1.00  % Result found by SubtermCWHack
% 0.73/1.00  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.73/1.00  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/1.00  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.73/1.00  % Starting new_bool_3 with 300s (1) cores
% 0.73/1.00  % Starting new_bool_1 with 300s (1) cores
% 0.73/1.00  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.73/1.00  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.73/1.00  % Search class: FGHSM-FFLM32-MFFFFFNN
% 0.73/1.00  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.73/1.00  % Starting SubtermCWHack with 31s (1) cores
% 0.73/1.00  % Preprocessing time       : 0.002 s
% 0.73/1.00  
% 0.73/1.00  % Proof found!
% 0.73/1.00  % SZS status Unsatisfiable
% 0.73/1.00  % SZS output start CNFRefutation
% See solution above
% 0.73/1.00  % Parsed axioms                        : 2746
% 0.73/1.00  % Removed by relevancy pruning/SinE    : 2584
% 0.73/1.00  % Initial clauses                      : 162
% 0.73/1.00  % Removed in clause preprocessing      : 0
% 0.73/1.00  % Initial clauses in saturation        : 162
% 0.73/1.00  % Processed clauses                    : 935
% 0.73/1.00  % ...of these trivial                  : 8
% 0.73/1.00  % ...subsumed                          : 602
% 0.73/1.00  % ...remaining for further processing  : 325
% 0.73/1.00  % Other redundant clauses eliminated   : 35
% 0.73/1.00  % Clauses deleted for lack of memory   : 0
% 0.73/1.00  % Backward-subsumed                    : 3
% 0.73/1.00  % Backward-rewritten                   : 5
% 0.73/1.00  % Generated clauses                    : 2397
% 0.73/1.00  % ...of the previous two non-redundant : 1859
% 0.73/1.00  % ...aggressively subsumed             : 0
% 0.73/1.00  % Contextual simplify-reflections      : 0
% 0.73/1.00  % Paramodulations                      : 2344
% 0.73/1.00  % Factorizations                       : 0
% 0.73/1.00  % NegExts                              : 0
% 0.73/1.00  % Equation resolutions                 : 53
% 0.73/1.00  % Disequality decompositions           : 0
% 0.73/1.00  % Total rewrite steps                  : 999
% 0.73/1.00  % ...of those cached                   : 747
% 0.73/1.00  % Propositional unsat checks           : 0
% 0.73/1.00  %    Propositional check models        : 0
% 0.73/1.00  %    Propositional check unsatisfiable : 0
% 0.73/1.00  %    Propositional clauses             : 0
% 0.73/1.00  %    Propositional clauses after purity: 0
% 0.73/1.00  %    Propositional unsat core size     : 0
% 0.73/1.00  %    Propositional preprocessing time  : 0.000
% 0.73/1.00  %    Propositional encoding time       : 0.000
% 0.73/1.00  %    Propositional solver time         : 0.000
% 0.73/1.00  %    Success case prop preproc time    : 0.000
% 0.73/1.00  %    Success case prop encoding time   : 0.000
% 0.73/1.00  %    Success case prop solver time     : 0.000
% 0.73/1.00  % Current number of processed clauses  : 317
% 0.73/1.00  %    Positive orientable unit clauses  : 92
% 0.73/1.00  %    Positive unorientable unit clauses: 0
% 0.73/1.00  %    Negative unit clauses             : 104
% 0.73/1.00  %    Non-unit-clauses                  : 121
% 0.73/1.00  % Current number of unprocessed clauses: 1085
% 0.73/1.00  % ...number of literals in the above   : 2036
% 0.73/1.00  % Current number of archived formulas  : 0
% 0.73/1.00  % Current number of archived clauses   : 8
% 0.73/1.00  % Clause-clause subsumption calls (NU) : 2210
% 0.73/1.00  % Rec. Clause-clause subsumption calls : 1850
% 0.73/1.00  % Non-unit clause-clause subsumptions  : 71
% 0.73/1.00  % Unit Clause-clause subsumption calls : 3231
% 0.73/1.00  % Rewrite failures with RHS unbound    : 0
% 0.73/1.00  % BW rewrite match attempts            : 52
% 0.73/1.00  % BW rewrite match successes           : 5
% 0.73/1.00  % Condensation attempts                : 0
% 0.73/1.00  % Condensation successes               : 0
% 0.73/1.00  % Termbank termtop insertions          : 48175
% 0.73/1.00  % Search garbage collected termcells   : 7785
% 0.73/1.00  
% 0.73/1.00  % -------------------------------------------------
% 0.73/1.00  % User time                : 0.029 s
% 0.73/1.00  % System time              : 0.009 s
% 0.73/1.00  % Total time               : 0.038 s
% 0.73/1.00  % Maximum resident set size: 6172 pages
% 0.73/1.00  
% 0.73/1.00  % -------------------------------------------------
% 0.73/1.00  % User time                : 0.081 s
% 0.73/1.00  % System time              : 0.015 s
% 0.73/1.00  % Total time               : 0.096 s
% 0.73/1.00  % Maximum resident set size: 6400 pages
% 0.73/1.00  % E exiting
%------------------------------------------------------------------------------