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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : MGT045-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.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:35:48 EDT 2023

% Result   : Unsatisfiable 0.20s 0.48s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   12 (   8 unt;   0 nHn;  12 RR)
%            Number of literals    :   20 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(assumption_8_32,axiom,
    ( greater(external_ties(X1,X2),external_ties(X1,X3))
    | ~ organization(X1)
    | ~ greater(age(X1,X2),age(X1,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.TSJVdYN7vX/E---3.1_31835.p',assumption_8_32) ).

cnf(lemma_4_34,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    file('/export/starexec/sandbox/tmp/tmp.TSJVdYN7vX/E---3.1_31835.p',lemma_4_34) ).

cnf(lemma_4_33,negated_conjecture,
    organization(sk1),
    file('/export/starexec/sandbox/tmp/tmp.TSJVdYN7vX/E---3.1_31835.p',lemma_4_33) ).

cnf(assumption_6_30,axiom,
    ( greater(position(X1,X2),position(X1,X3))
    | ~ organization(X1)
    | ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.TSJVdYN7vX/E---3.1_31835.p',assumption_6_30) ).

cnf(lemma_4_35,negated_conjecture,
    ~ greater(position(sk1,sk3),position(sk1,sk2)),
    file('/export/starexec/sandbox/tmp/tmp.TSJVdYN7vX/E---3.1_31835.p',lemma_4_35) ).

cnf(c_0_5,axiom,
    ( greater(external_ties(X1,X2),external_ties(X1,X3))
    | ~ organization(X1)
    | ~ greater(age(X1,X2),age(X1,X3)) ),
    assumption_8_32 ).

cnf(c_0_6,negated_conjecture,
    greater(age(sk1,sk3),age(sk1,sk2)),
    lemma_4_34 ).

cnf(c_0_7,negated_conjecture,
    organization(sk1),
    lemma_4_33 ).

cnf(c_0_8,axiom,
    ( greater(position(X1,X2),position(X1,X3))
    | ~ organization(X1)
    | ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
    assumption_6_30 ).

cnf(c_0_9,negated_conjecture,
    greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).

cnf(c_0_10,negated_conjecture,
    ~ greater(position(sk1,sk3),position(sk1,sk2)),
    lemma_4_35 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : MGT045-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 2400
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Oct  3 00:21:44 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  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/tmp/tmp.TSJVdYN7vX/E---3.1_31835.p
% 0.20/0.48  # Version: 3.1pre001
% 0.20/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # new_bool_3 with pid 31915 completed with status 0
% 0.20/0.48  # Result found by new_bool_3
% 0.20/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48  # Search class: FHHSF-FFSF22-SFFFFFNN
% 0.20/0.48  # partial match(1): FGHSF-FFSF22-SFFFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48  # SAT001_MinMin_p005000_rr_RG with pid 31920 completed with status 0
% 0.20/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48  # Search class: FHHSF-FFSF22-SFFFFFNN
% 0.20/0.48  # partial match(1): FGHSF-FFSF22-SFFFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48  # Preprocessing time       : 0.001 s
% 0.20/0.48  # Presaturation interreduction done
% 0.20/0.48  
% 0.20/0.48  # Proof found!
% 0.20/0.48  # SZS status Unsatisfiable
% 0.20/0.48  # SZS output start CNFRefutation
% See solution above
% 0.20/0.48  # Parsed axioms                        : 17
% 0.20/0.48  # Removed by relevancy pruning/SinE    : 9
% 0.20/0.48  # Initial clauses                      : 8
% 0.20/0.48  # Removed in clause preprocessing      : 0
% 0.20/0.48  # Initial clauses in saturation        : 8
% 0.20/0.48  # Processed clauses                    : 23
% 0.20/0.48  # ...of these trivial                  : 0
% 0.20/0.48  # ...subsumed                          : 1
% 0.20/0.48  # ...remaining for further processing  : 22
% 0.20/0.48  # Other redundant clauses eliminated   : 0
% 0.20/0.48  # Clauses deleted for lack of memory   : 0
% 0.20/0.48  # Backward-subsumed                    : 0
% 0.20/0.48  # Backward-rewritten                   : 0
% 0.20/0.48  # Generated clauses                    : 12
% 0.20/0.48  # ...of the previous two non-redundant : 10
% 0.20/0.48  # ...aggressively subsumed             : 0
% 0.20/0.48  # Contextual simplify-reflections      : 0
% 0.20/0.48  # Paramodulations                      : 11
% 0.20/0.48  # Factorizations                       : 0
% 0.20/0.48  # NegExts                              : 0
% 0.20/0.48  # Equation resolutions                 : 1
% 0.20/0.48  # Total rewrite steps                  : 3
% 0.20/0.48  # Propositional unsat checks           : 0
% 0.20/0.48  #    Propositional check models        : 0
% 0.20/0.48  #    Propositional check unsatisfiable : 0
% 0.20/0.48  #    Propositional clauses             : 0
% 0.20/0.48  #    Propositional clauses after purity: 0
% 0.20/0.48  #    Propositional unsat core size     : 0
% 0.20/0.48  #    Propositional preprocessing time  : 0.000
% 0.20/0.48  #    Propositional encoding time       : 0.000
% 0.20/0.48  #    Propositional solver time         : 0.000
% 0.20/0.48  #    Success case prop preproc time    : 0.000
% 0.20/0.48  #    Success case prop encoding time   : 0.000
% 0.20/0.48  #    Success case prop solver time     : 0.000
% 0.20/0.48  # Current number of processed clauses  : 14
% 0.20/0.48  #    Positive orientable unit clauses  : 3
% 0.20/0.48  #    Positive unorientable unit clauses: 0
% 0.20/0.48  #    Negative unit clauses             : 2
% 0.20/0.48  #    Non-unit-clauses                  : 9
% 0.20/0.48  # Current number of unprocessed clauses: 1
% 0.20/0.48  # ...number of literals in the above   : 2
% 0.20/0.48  # Current number of archived formulas  : 0
% 0.20/0.48  # Current number of archived clauses   : 8
% 0.20/0.48  # Clause-clause subsumption calls (NU) : 20
% 0.20/0.48  # Rec. Clause-clause subsumption calls : 19
% 0.20/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.48  # Unit Clause-clause subsumption calls : 0
% 0.20/0.48  # Rewrite failures with RHS unbound    : 0
% 0.20/0.48  # BW rewrite match attempts            : 0
% 0.20/0.48  # BW rewrite match successes           : 0
% 0.20/0.48  # Condensation attempts                : 0
% 0.20/0.48  # Condensation successes               : 0
% 0.20/0.48  # Termbank termtop insertions          : 477
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.003 s
% 0.20/0.48  # System time              : 0.002 s
% 0.20/0.48  # Total time               : 0.004 s
% 0.20/0.48  # Maximum resident set size: 1632 pages
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.003 s
% 0.20/0.48  # System time              : 0.005 s
% 0.20/0.48  # Total time               : 0.007 s
% 0.20/0.48  # Maximum resident set size: 1680 pages
% 0.20/0.48  % E---3.1 exiting
% 0.20/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------