TSTP Solution File: SCT074-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SCT074-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n003.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 19:16:32 EDT 2023

% Result   : Unsatisfiable 0.23s 0.58s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   7 unt;   0 nHn;   9 RR)
%            Number of literals    :   13 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-4 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Lin__irrefl_0,axiom,
    ( ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(X3,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
    file('/export/starexec/sandbox2/tmp/tmp.24mzsuqhGV/E---3.1_32149.p',cls_Lin__irrefl_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    file('/export/starexec/sandbox2/tmp/tmp.24mzsuqhGV/E---3.1_32149.p',cls_conjecture_0) ).

cnf(cls_CHAINED_0_01,axiom,
    c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    file('/export/starexec/sandbox2/tmp/tmp.24mzsuqhGV/E---3.1_32149.p',cls_CHAINED_0_01) ).

cnf(cls_CHAINED_0,axiom,
    c_in(v_Lab____,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
    file('/export/starexec/sandbox2/tmp/tmp.24mzsuqhGV/E---3.1_32149.p',cls_CHAINED_0) ).

cnf(c_0_4,axiom,
    ( ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ c_in(X3,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
    cls_Lin__irrefl_0 ).

cnf(c_0_5,negated_conjecture,
    c_in(c_Pair(v_b____,v_a____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    cls_conjecture_0 ).

cnf(c_0_6,axiom,
    c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_Lab____,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    cls_CHAINED_0_01 ).

cnf(c_0_7,axiom,
    c_in(v_Lab____,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
    cls_CHAINED_0 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16  % Problem    : SCT074-1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/0.17  % Command    : run_E %s %d THM
% 0.17/0.37  % Computer : n003.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37  % CPULimit   : 2400
% 0.17/0.37  % WCLimit    : 300
% 0.17/0.37  % DateTime   : Mon Oct  2 11:42:18 EDT 2023
% 0.17/0.37  % CPUTime    : 
% 0.23/0.54  Running first-order theorem proving
% 0.23/0.54  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.24mzsuqhGV/E---3.1_32149.p
% 0.23/0.58  # Version: 3.1pre001
% 0.23/0.58  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.23/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.23/0.58  # Starting new_bool_3 with 600s (2) cores
% 0.23/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.58  # Starting sh5l with 300s (1) cores
% 0.23/0.58  # new_bool_1 with pid 32230 completed with status 0
% 0.23/0.58  # Result found by new_bool_1
% 0.23/0.58  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.23/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.23/0.58  # Starting new_bool_3 with 600s (2) cores
% 0.23/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58  # Search class: FGHSF-FFSS32-SFFFFFNN
% 0.23/0.58  # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.23/0.58  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58  # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.23/0.58  # G-E--_301_C18_F1_URBAN_S0Y with pid 32233 completed with status 0
% 0.23/0.58  # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.23/0.58  # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.23/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.23/0.58  # Starting new_bool_3 with 600s (2) cores
% 0.23/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58  # Search class: FGHSF-FFSS32-SFFFFFNN
% 0.23/0.58  # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.23/0.58  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58  # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.23/0.58  # Preprocessing time       : 0.008 s
% 0.23/0.58  
% 0.23/0.58  # Proof found!
% 0.23/0.58  # SZS status Unsatisfiable
% 0.23/0.58  # SZS output start CNFRefutation
% See solution above
% 0.23/0.58  # Parsed axioms                        : 709
% 0.23/0.58  # Removed by relevancy pruning/SinE    : 701
% 0.23/0.58  # Initial clauses                      : 8
% 0.23/0.58  # Removed in clause preprocessing      : 0
% 0.23/0.58  # Initial clauses in saturation        : 8
% 0.23/0.58  # Processed clauses                    : 6
% 0.23/0.58  # ...of these trivial                  : 0
% 0.23/0.58  # ...subsumed                          : 0
% 0.23/0.58  # ...remaining for further processing  : 6
% 0.23/0.58  # Other redundant clauses eliminated   : 0
% 0.23/0.58  # Clauses deleted for lack of memory   : 0
% 0.23/0.58  # Backward-subsumed                    : 0
% 0.23/0.58  # Backward-rewritten                   : 0
% 0.23/0.58  # Generated clauses                    : 4
% 0.23/0.58  # ...of the previous two non-redundant : 0
% 0.23/0.58  # ...aggressively subsumed             : 0
% 0.23/0.58  # Contextual simplify-reflections      : 0
% 0.23/0.58  # Paramodulations                      : 2
% 0.23/0.58  # Factorizations                       : 0
% 0.23/0.58  # NegExts                              : 0
% 0.23/0.58  # Equation resolutions                 : 2
% 0.23/0.58  # Total rewrite steps                  : 2
% 0.23/0.58  # Propositional unsat checks           : 0
% 0.23/0.58  #    Propositional check models        : 0
% 0.23/0.58  #    Propositional check unsatisfiable : 0
% 0.23/0.58  #    Propositional clauses             : 0
% 0.23/0.58  #    Propositional clauses after purity: 0
% 0.23/0.58  #    Propositional unsat core size     : 0
% 0.23/0.58  #    Propositional preprocessing time  : 0.000
% 0.23/0.58  #    Propositional encoding time       : 0.000
% 0.23/0.58  #    Propositional solver time         : 0.000
% 0.23/0.58  #    Success case prop preproc time    : 0.000
% 0.23/0.58  #    Success case prop encoding time   : 0.000
% 0.23/0.58  #    Success case prop solver time     : 0.000
% 0.23/0.58  # Current number of processed clauses  : 6
% 0.23/0.58  #    Positive orientable unit clauses  : 3
% 0.23/0.58  #    Positive unorientable unit clauses: 0
% 0.23/0.58  #    Negative unit clauses             : 0
% 0.23/0.58  #    Non-unit-clauses                  : 3
% 0.23/0.58  # Current number of unprocessed clauses: 2
% 0.23/0.58  # ...number of literals in the above   : 8
% 0.23/0.58  # Current number of archived formulas  : 0
% 0.23/0.58  # Current number of archived clauses   : 0
% 0.23/0.58  # Clause-clause subsumption calls (NU) : 4
% 0.23/0.58  # Rec. Clause-clause subsumption calls : 4
% 0.23/0.58  # Non-unit clause-clause subsumptions  : 0
% 0.23/0.58  # Unit Clause-clause subsumption calls : 0
% 0.23/0.58  # Rewrite failures with RHS unbound    : 0
% 0.23/0.58  # BW rewrite match attempts            : 0
% 0.23/0.58  # BW rewrite match successes           : 0
% 0.23/0.58  # Condensation attempts                : 0
% 0.23/0.58  # Condensation successes               : 0
% 0.23/0.58  # Termbank termtop insertions          : 8552
% 0.23/0.58  
% 0.23/0.58  # -------------------------------------------------
% 0.23/0.58  # User time                : 0.007 s
% 0.23/0.58  # System time              : 0.006 s
% 0.23/0.58  # Total time               : 0.013 s
% 0.23/0.58  # Maximum resident set size: 2540 pages
% 0.23/0.58  
% 0.23/0.58  # -------------------------------------------------
% 0.23/0.58  # User time                : 0.026 s
% 0.23/0.58  # System time              : 0.008 s
% 0.23/0.58  # Total time               : 0.034 s
% 0.23/0.58  # Maximum resident set size: 2264 pages
% 0.23/0.58  % E---3.1 exiting
% 0.23/0.58  % E---3.1 exiting
%------------------------------------------------------------------------------