↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT269-2 : 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 : n020.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.11s 0.43s
% Output   : CNFRefutation 0.11s
% 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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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,
    c_emptyset != v_intY1,
    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.03  % Problem  : LAT269-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n020.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:25:17 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 0.11/0.43  % Version: 3.5.1
% 0.11/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43  % Starting sh5l with 300s (1) cores
% 0.11/0.43  % new_bool_3 with pid 1443676 completed with status 0
% 0.11/0.43  % Result found by new_bool_3
% 0.11/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43  % Search class: FGHSF-FFSS33-MFFFFFNN
% 0.11/0.43  % partial match(2): FGHSF-FFMS32-MFFFFFNN
% 0.11/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43  % SubtermCWHack with pid 1443682 completed with status 0
% 0.11/0.43  % Result found by SubtermCWHack
% 0.11/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43  % Search class: FGHSF-FFSS33-MFFFFFNN
% 0.11/0.43  % partial match(2): FGHSF-FFMS32-MFFFFFNN
% 0.11/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43  % Preprocessing time       : 0.001 s
% 0.11/0.43  
% 0.11/0.43  % Proof found!
% 0.11/0.43  % SZS status Unsatisfiable
% 0.11/0.43  % SZS output start CNFRefutation
% See solution above
% 0.11/0.43  % Parsed axioms                        : 6
% 0.11/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.43  % Initial clauses                      : 6
% 0.11/0.43  % Removed in clause preprocessing      : 0
% 0.11/0.43  % Initial clauses in saturation        : 6
% 0.11/0.43  % Processed clauses                    : 7
% 0.11/0.43  % ...of these trivial                  : 0
% 0.11/0.43  % ...subsumed                          : 0
% 0.11/0.43  % ...remaining for further processing  : 7
% 0.11/0.43  % Other redundant clauses eliminated   : 0
% 0.11/0.43  % Clauses deleted for lack of memory   : 0
% 0.11/0.43  % Backward-subsumed                    : 0
% 0.11/0.43  % Backward-rewritten                   : 0
% 0.11/0.43  % Generated clauses                    : 3
% 0.11/0.43  % ...of the previous two non-redundant : 1
% 0.11/0.43  % ...aggressively subsumed             : 0
% 0.11/0.43  % Contextual simplify-reflections      : 0
% 0.11/0.43  % Paramodulations                      : 3
% 0.11/0.43  % Factorizations                       : 0
% 0.11/0.43  % NegExts                              : 0
% 0.11/0.43  % Equation resolutions                 : 0
% 0.11/0.43  % Disequality decompositions           : 0
% 0.11/0.43  % Total rewrite steps                  : 3
% 0.11/0.43  % ...of those cached                   : 1
% 0.11/0.43  % Propositional unsat checks           : 0
% 0.11/0.43  %    Propositional check models        : 0
% 0.11/0.43  %    Propositional check unsatisfiable : 0
% 0.11/0.43  %    Propositional clauses             : 0
% 0.11/0.43  %    Propositional clauses after purity: 0
% 0.11/0.43  %    Propositional unsat core size     : 0
% 0.11/0.43  %    Propositional preprocessing time  : 0.000
% 0.11/0.43  %    Propositional encoding time       : 0.000
% 0.11/0.43  %    Propositional solver time         : 0.000
% 0.11/0.43  %    Success case prop preproc time    : 0.000
% 0.11/0.43  %    Success case prop encoding time   : 0.000
% 0.11/0.43  %    Success case prop solver time     : 0.000
% 0.11/0.43  % Current number of processed clauses  : 7
% 0.11/0.43  %    Positive orientable unit clauses  : 3
% 0.11/0.43  %    Positive unorientable unit clauses: 0
% 0.11/0.43  %    Negative unit clauses             : 2
% 0.11/0.43  %    Non-unit-clauses                  : 2
% 0.11/0.43  % Current number of unprocessed clauses: 0
% 0.11/0.43  % ...number of literals in the above   : 0
% 0.11/0.43  % Current number of archived formulas  : 0
% 0.11/0.43  % Current number of archived clauses   : 0
% 0.11/0.43  % Clause-clause subsumption calls (NU) : 2
% 0.11/0.43  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.43  % Unit Clause-clause subsumption calls : 0
% 0.11/0.43  % Rewrite failures with RHS unbound    : 0
% 0.11/0.43  % BW rewrite match attempts            : 0
% 0.11/0.43  % BW rewrite match successes           : 0
% 0.11/0.43  % Condensation attempts                : 0
% 0.11/0.43  % Condensation successes               : 0
% 0.11/0.43  % Termbank termtop insertions          : 338
% 0.11/0.43  % Search garbage collected termcells   : 11
% 0.11/0.43  
% 0.11/0.43  % -------------------------------------------------
% 0.11/0.43  % User time                : 0.002 s
% 0.11/0.43  % System time              : 0.002 s
% 0.11/0.43  % Total time               : 0.004 s
% 0.11/0.43  % Maximum resident set size: 3636 pages
% 0.11/0.43  
% 0.11/0.43  % -------------------------------------------------
% 0.11/0.43  % User time                : 0.003 s
% 0.11/0.43  % System time              : 0.007 s
% 0.11/0.43  % Total time               : 0.010 s
% 0.11/0.43  % Maximum resident set size: 4608 pages
% 0.11/0.43  % E exiting
%------------------------------------------------------------------------------