TSTP Solution File: LAT279-2 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n021.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:10:20 EDT 2023

% Result   : Timeout 0.29s 300.10s
% Output   : None 
% 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    :   11 (   2 equ;   4 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    :    7 (   7 usr;   5 con; 0-3 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Tarski_OPartialOrder__iff_1,axiom,
    ( c_Relation_Oantisym(c_Tarski_Opotype_Oorder(X1,X2,tc_Product__Type_Ounit),X2)
    | ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)) ),
    file('/export/starexec/sandbox/tmp/tmp.sJOPElCngn/E---3.1_21789.p',cls_Tarski_OPartialOrder__iff_1) ).

cnf(cls_Tarski_Ocl_A_58_APartialOrder_0,axiom,
    c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('/export/starexec/sandbox/tmp/tmp.sJOPElCngn/E---3.1_21789.p',cls_Tarski_Ocl_A_58_APartialOrder_0) ).

cnf(cls_Tarski_Or_A_61_61_Aorder_Acl_0,axiom,
    v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
    file('/export/starexec/sandbox/tmp/tmp.sJOPElCngn/E---3.1_21789.p',cls_Tarski_Or_A_61_61_Aorder_Acl_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_Relation_Oantisym(v_r,t_a),
    file('/export/starexec/sandbox/tmp/tmp.sJOPElCngn/E---3.1_21789.p',cls_conjecture_0) ).

cnf(c_0_4,axiom,
    ( c_Relation_Oantisym(c_Tarski_Opotype_Oorder(X1,X2,tc_Product__Type_Ounit),X2)
    | ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)) ),
    cls_Tarski_OPartialOrder__iff_1 ).

cnf(c_0_5,axiom,
    c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    cls_Tarski_Ocl_A_58_APartialOrder_0 ).

cnf(c_0_6,axiom,
    v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
    cls_Tarski_Or_A_61_61_Aorder_Acl_0 ).

cnf(c_0_7,negated_conjecture,
    ~ c_Relation_Oantisym(v_r,t_a),
    cls_conjecture_0 ).

cnf(c_0_8,plain,
    $false,
    inference(sr,[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.11/0.13  % Problem    : LAT279-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.11/0.34  % Computer : n021.cluster.edu
% 0.11/0.34  % Model    : x86_64 x86_64
% 0.11/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34  % Memory   : 8042.1875MB
% 0.11/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34  % CPULimit   : 2400
% 0.11/0.34  % WCLimit    : 300
% 0.11/0.34  % DateTime   : Mon Oct  2 09:55:14 EDT 2023
% 0.11/0.34  % CPUTime    : 
% 0.18/0.46  Running first-order model finding
% 0.18/0.46  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.sJOPElCngn/E---3.1_21789.p
% 0.29/300.10  # Version: 3.1pre001
% 0.29/300.10  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.29/300.10  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.10  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.29/300.10  # Starting new_bool_3 with 300s (1) cores
% 0.29/300.10  # Starting new_bool_1 with 300s (1) cores
% 0.29/300.10  # Starting sh5l with 300s (1) cores
% 0.29/300.10  # new_bool_3 with pid 21898 completed with status 0
% 0.29/300.10  # Result found by new_bool_3
% 0.29/300.10  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.29/300.10  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.10  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.29/300.10  # Starting new_bool_3 with 300s (1) cores
% 0.29/300.10  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/300.10  # Search class: FHUSF-FFSF32-SFFFFFNN
% 0.29/300.10  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/300.10  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.29/300.10  # SAT001_MinMin_p005000_rr_RG with pid 21902 completed with status 0
% 0.29/300.10  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.29/300.10  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.29/300.10  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.10  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.29/300.10  # Starting new_bool_3 with 300s (1) cores
% 0.29/300.10  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/300.10  # Search class: FHUSF-FFSF32-SFFFFFNN
% 0.29/300.10  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/300.10  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.29/300.10  # Preprocessing time       : 0.001 s
% 0.29/300.10  # Presaturation interreduction done
% 0.29/300.10  
% 0.29/300.10  # Proof found!
% 0.29/300.10  # SZS status Unsatisfiable
% 0.29/300.10  # SZS output start CNFRefutation
% See solution above
% 0.29/300.10  # Parsed axioms                        : 4
% 0.29/300.10  # Removed by relevancy pruning/SinE    : 0
% 0.29/300.10  # Initial clauses                      : 4
% 0.29/300.10  # Removed in clause preprocessing      : 0
% 0.29/300.10  # Initial clauses in saturation        : 4
% 0.29/300.10  # Processed clauses                    : 8
% 0.29/300.10  # ...of these trivial                  : 0
% 0.29/300.10  # ...subsumed                          : 0
% 0.29/300.10  # ...remaining for further processing  : 8
% 0.29/300.10  # Other redundant clauses eliminated   : 0
% 0.29/300.10  # Clauses deleted for lack of memory   : 0
% 0.29/300.10  # Backward-subsumed                    : 0
% 0.29/300.10  # Backward-rewritten                   : 0
% 0.29/300.10  # Generated clauses                    : 1
% 0.29/300.10  # ...of the previous two non-redundant : 0
% 0.29/300.10  # ...aggressively subsumed             : 0
% 0.29/300.10  # Contextual simplify-reflections      : 0
% 0.29/300.10  # Paramodulations                      : 1
% 0.29/300.10  # Factorizations                       : 0
% 0.29/300.10  # NegExts                              : 0
% 0.29/300.10  # Equation resolutions                 : 0
% 0.29/300.10  # Total rewrite steps                  : 1
% 0.29/300.10  # Propositional unsat checks           : 0
% 0.29/300.10  #    Propositional check models        : 0
% 0.29/300.10  #    Propositional check unsatisfiable : 0
% 0.29/300.10  #    Propositional clauses             : 0
% 0.29/300.10  #    Propositional clauses after purity: 0
% 0.29/300.10  #    Propositional unsat core size     : 0
% 0.29/300.10  #    Propositional preprocessing time  : 0.000
% 0.29/300.10  #    Propositional encoding time       : 0.000
% 0.29/300.10  #    Propositional solver time         : 0.000
% 0.29/300.10  #    Success case prop preproc time    : 0.000
% 0.29/300.10  #    Success case prop encoding time   : 0.000
% 0.29/300.10  #    Success case prop solver time     : 0.000
% 0.29/300.10  # Current number of processed clauses  : 4
% 0.29/300.10  #    Positive orientable unit clauses  : 2
% 0.29/300.10  #    Positive unorientable unit clauses: 0
% 0.29/300.10  #    Negative unit clauses             : 1
% 0.29/300.10  #    Non-unit-clauses                  : 1
% 0.29/300.10  # Current number of unprocessed clauses: 0
% 0.29/300.10  # ...number of literals in the above   : 0
% 0.29/300.10  # Current number of archived formulas  : 0
% 0.29/300.10  # Current number of archived clauses   : 4
% 0.29/300.10  # Clause-clause subsumption calls (NU) : 0
% 0.29/300.10  # Rec. Clause-clause subsumption calls : 0
% 0.29/300.10  # Non-unit clause-clause subsumptions  : 0
% 0.29/300.10  # Unit Clause-clause subsumption calls : 0
% 0.29/300.10  # Rewrite failures with RHS unbound    : 0
% 0.29/300.10  # BW rewrite match attempts            : 0
% 0.29/300.10  # BW rewrite match successes           : 0
% 0.29/300.10  # Condensation attempts                : 0
% 0.29/300.10  # Condensation successes               : 0
% 0.29/300.10  # Termbank termtop insertions          : 93
% 0.29/300.10  
% 0.29/300.10  # -------------------------------------------------
% 0.29/300.10  # User time                : 0.002 s
% 0.29/300.10  # System time              : 0.000 s
% 0.29/300.10  # Total time               : 0.002 s
% 0.29/300.10  # Maximum resident set size: 1652 pages
% 0.29/300.10  
% 0.29/300.10  # -------------------------------------------------
% 0.29/300.10  # User time                : 0.004 s
% 0.29/300.10  # System time              : 0.001 s
% 0.29/300.10  # Total time               : 0.005 s
% 0.29/300.10  # Maximum resident set size: 1668 pages
% 0.29/300.10  % E---3.1 exiting
%------------------------------------------------------------------------------