TSTP Solution File: LAT271-2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : LAT271-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:08:14 EDT 2023

% Result   : Unsatisfiable 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   7 unt;   0 nHn;  10 RR)
%            Number of literals    :   15 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :   13 (   2 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_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
    ( c_in(c_Pair(X5,X1,X3,X3),X4,tc_prod(X3,X3))
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.tFqOpXqtDz/E---3.1_4916.p',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_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0) ).

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/tmp/tmp.tFqOpXqtDz/E---3.1_4916.p',cls_conjecture_2) ).

cnf(cls_conjecture_7,negated_conjecture,
    ~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox2/tmp/tmp.tFqOpXqtDz/E---3.1_4916.p',cls_conjecture_7) ).

cnf(cls_conjecture_6,negated_conjecture,
    c_in(v_x,v_S,t_a),
    file('/export/starexec/sandbox2/tmp/tmp.tFqOpXqtDz/E---3.1_4916.p',cls_conjecture_6) ).

cnf(c_0_4,axiom,
    ( c_in(c_Pair(X5,X1,X3,X3),X4,tc_prod(X3,X3))
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3)) ),
    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_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0 ).

cnf(c_0_5,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_6,negated_conjecture,
    ~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    cls_conjecture_7 ).

cnf(c_0_7,negated_conjecture,
    ( c_in(c_Pair(v_a,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
    | ~ c_in(X1,v_S,t_a) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    c_in(v_x,v_S,t_a),
    cls_conjecture_6 ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : LAT271-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n005.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 10:27:31 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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/tmp/tmp.tFqOpXqtDz/E---3.1_4916.p
% 0.16/0.43  # Version: 3.1pre001
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43  # Starting sh5l with 300s (1) cores
% 0.16/0.43  # new_bool_3 with pid 4995 completed with status 0
% 0.16/0.43  # Result found by new_bool_3
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FHUNF-FFSF32-SFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43  # SAT001_MinMin_p005000_rr_RG with pid 4999 completed with status 0
% 0.16/0.43  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FHUNF-FFSF32-SFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43  # Preprocessing time       : 0.001 s
% 0.16/0.43  # Presaturation interreduction done
% 0.16/0.43  
% 0.16/0.43  # Proof found!
% 0.16/0.43  # SZS status Unsatisfiable
% 0.16/0.43  # SZS output start CNFRefutation
% See solution above
% 0.16/0.43  # Parsed axioms                        : 4
% 0.16/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.43  # Initial clauses                      : 4
% 0.16/0.43  # Removed in clause preprocessing      : 0
% 0.16/0.43  # Initial clauses in saturation        : 4
% 0.16/0.43  # Processed clauses                    : 9
% 0.16/0.43  # ...of these trivial                  : 0
% 0.16/0.43  # ...subsumed                          : 0
% 0.16/0.43  # ...remaining for further processing  : 9
% 0.16/0.43  # Other redundant clauses eliminated   : 0
% 0.16/0.43  # Clauses deleted for lack of memory   : 0
% 0.16/0.43  # Backward-subsumed                    : 0
% 0.16/0.43  # Backward-rewritten                   : 0
% 0.16/0.43  # Generated clauses                    : 2
% 0.16/0.43  # ...of the previous two non-redundant : 1
% 0.16/0.43  # ...aggressively subsumed             : 0
% 0.16/0.43  # Contextual simplify-reflections      : 0
% 0.16/0.43  # Paramodulations                      : 2
% 0.16/0.43  # Factorizations                       : 0
% 0.16/0.43  # NegExts                              : 0
% 0.16/0.43  # Equation resolutions                 : 0
% 0.16/0.43  # Total rewrite steps                  : 1
% 0.16/0.43  # Propositional unsat checks           : 0
% 0.16/0.43  #    Propositional check models        : 0
% 0.16/0.43  #    Propositional check unsatisfiable : 0
% 0.16/0.43  #    Propositional clauses             : 0
% 0.16/0.43  #    Propositional clauses after purity: 0
% 0.16/0.43  #    Propositional unsat core size     : 0
% 0.16/0.43  #    Propositional preprocessing time  : 0.000
% 0.16/0.43  #    Propositional encoding time       : 0.000
% 0.16/0.43  #    Propositional solver time         : 0.000
% 0.16/0.43  #    Success case prop preproc time    : 0.000
% 0.16/0.43  #    Success case prop encoding time   : 0.000
% 0.16/0.43  #    Success case prop solver time     : 0.000
% 0.16/0.43  # Current number of processed clauses  : 5
% 0.16/0.43  #    Positive orientable unit clauses  : 2
% 0.16/0.43  #    Positive unorientable unit clauses: 0
% 0.16/0.43  #    Negative unit clauses             : 1
% 0.16/0.43  #    Non-unit-clauses                  : 2
% 0.16/0.43  # Current number of unprocessed clauses: 0
% 0.16/0.43  # ...number of literals in the above   : 0
% 0.16/0.43  # Current number of archived formulas  : 0
% 0.16/0.43  # Current number of archived clauses   : 4
% 0.16/0.43  # Clause-clause subsumption calls (NU) : 0
% 0.16/0.43  # Rec. Clause-clause subsumption calls : 0
% 0.16/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.43  # Unit Clause-clause subsumption calls : 0
% 0.16/0.43  # Rewrite failures with RHS unbound    : 0
% 0.16/0.43  # BW rewrite match attempts            : 0
% 0.16/0.43  # BW rewrite match successes           : 0
% 0.16/0.43  # Condensation attempts                : 0
% 0.16/0.43  # Condensation successes               : 0
% 0.16/0.43  # Termbank termtop insertions          : 148
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.001 s
% 0.16/0.43  # System time              : 0.002 s
% 0.16/0.43  # Total time               : 0.003 s
% 0.16/0.43  # Maximum resident set size: 1652 pages
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.001 s
% 0.16/0.43  # System time              : 0.004 s
% 0.16/0.43  # Total time               : 0.005 s
% 0.16/0.43  # Maximum resident set size: 1676 pages
% 0.16/0.43  % E---3.1 exiting
% 0.16/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------