TSTP Solution File: SWW209+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWW209+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n024.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 : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 00:10:18 EDT 2022

% Result   : Theorem 0.34s 1.51s
% Output   : CNFRefutation 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   26 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   18 (   9   ~;   4   |;   1   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-4 aty)
%            Number of variables   :   34 (   3 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
    ! [X4,X5] :
      ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,X4,X5)
     => c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),X4),hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),X5)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).

fof(fact_o__apply,axiom,
    ! [X11,X1,X2,X10,X8,X9] : hAPP(hAPP(c_Fun_Ocomp(X9,X8,X10,X2),X1),X11) = hAPP(X2,hAPP(X1,X11)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_o__apply) ).

fof(fact__096ALL_Am_An_O_Am_A_060_An_A_N_N_062_Af_Am_A_060_Af_An_096,axiom,
    ! [X4,X5] :
      ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,X4,X5)
     => c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_f____,X4),hAPP(v_f____,X5)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact__096ALL_Am_An_O_Am_A_060_An_A_N_N_062_Af_Am_A_060_Af_An_096) ).

fof(fact__096ALL_Am_An_O_Am_A_060_An_A_N_N_062_Ag_Am_A_060_Ag_An_096,axiom,
    ! [X4,X5] :
      ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,X4,X5)
     => c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_ga____,X4),hAPP(v_ga____,X5)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact__096ALL_Am_An_O_Am_A_060_An_A_N_N_062_Ag_Am_A_060_Ag_An_096) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X4,X5] :
        ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,X4,X5)
       => c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),X4),hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),X5)) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

fof(c_0_5,negated_conjecture,
    ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,esk1_0,esk2_0)
    & ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),esk1_0),hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),esk2_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X12,X13,X14,X15,X16,X17] : hAPP(hAPP(c_Fun_Ocomp(X17,X16,X15,X14),X13),X12) = hAPP(X14,hAPP(X13,X12)),
    inference(variable_rename,[status(thm)],[fact_o__apply]) ).

cnf(c_0_7,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),esk1_0),hAPP(hAPP(c_Fun_Ocomp(tc_Nat_Onat,tc_Nat_Onat,tc_Nat_Onat,v_f____),v_ga____),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    hAPP(hAPP(c_Fun_Ocomp(X1,X2,X3,X4),X5),X6) = hAPP(X4,hAPP(X5,X6)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X6,X7] :
      ( ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X6,X7)
      | c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_f____,X6),hAPP(v_f____,X7)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact__096ALL_Am_An_O_Am_A_060_An_A_N_N_062_Af_Am_A_060_Af_An_096])]) ).

cnf(c_0_10,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_f____,hAPP(v_ga____,esk1_0)),hAPP(v_f____,hAPP(v_ga____,esk2_0))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).

cnf(c_0_11,plain,
    ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_f____,X1),hAPP(v_f____,X2))
    | ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X6,X7] :
      ( ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X6,X7)
      | c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_ga____,X6),hAPP(v_ga____,X7)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact__096ALL_Am_An_O_Am_A_060_An_A_N_N_062_Ag_Am_A_060_Ag_An_096])]) ).

cnf(c_0_13,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_ga____,esk1_0),hAPP(v_ga____,esk2_0)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,hAPP(v_ga____,X1),hAPP(v_ga____,X2))
    | ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    c_Orderings_Oord__class_Oless(tc_Nat_Onat,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWW209+1 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.13  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jun  4 08:36:50 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.34/1.51  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.34/1.51  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.34/1.51  # Preprocessing time       : 0.036 s
% 0.34/1.51  
% 0.34/1.51  # Proof found!
% 0.34/1.51  # SZS status Theorem
% 0.34/1.51  # SZS output start CNFRefutation
% See solution above
% 0.34/1.51  # Proof object total steps             : 17
% 0.34/1.51  # Proof object clause steps            : 8
% 0.34/1.51  # Proof object formula steps           : 9
% 0.34/1.51  # Proof object conjectures             : 8
% 0.34/1.51  # Proof object clause conjectures      : 5
% 0.34/1.51  # Proof object formula conjectures     : 3
% 0.34/1.51  # Proof object initial clauses used    : 5
% 0.34/1.51  # Proof object initial formulas used   : 4
% 0.34/1.51  # Proof object generating inferences   : 2
% 0.34/1.51  # Proof object simplifying inferences  : 4
% 0.34/1.51  # Training examples: 0 positive, 0 negative
% 0.34/1.51  # Parsed axioms                        : 1161
% 0.34/1.51  # Removed by relevancy pruning/SinE    : 1060
% 0.34/1.51  # Initial clauses                      : 142
% 0.34/1.51  # Removed in clause preprocessing      : 10
% 0.34/1.51  # Initial clauses in saturation        : 132
% 0.34/1.51  # Processed clauses                    : 141
% 0.34/1.51  # ...of these trivial                  : 2
% 0.34/1.51  # ...subsumed                          : 32
% 0.34/1.51  # ...remaining for further processing  : 107
% 0.34/1.51  # Other redundant clauses eliminated   : 13
% 0.34/1.51  # Clauses deleted for lack of memory   : 0
% 0.34/1.51  # Backward-subsumed                    : 1
% 0.34/1.51  # Backward-rewritten                   : 1
% 0.34/1.51  # Generated clauses                    : 874
% 0.34/1.51  # ...of the previous two non-trivial   : 734
% 0.34/1.51  # Contextual simplify-reflections      : 3
% 0.34/1.51  # Paramodulations                      : 850
% 0.34/1.51  # Factorizations                       : 4
% 0.34/1.51  # Equation resolutions                 : 20
% 0.34/1.51  # Current number of processed clauses  : 97
% 0.34/1.51  #    Positive orientable unit clauses  : 25
% 0.34/1.51  #    Positive unorientable unit clauses: 5
% 0.34/1.51  #    Negative unit clauses             : 7
% 0.34/1.51  #    Non-unit-clauses                  : 60
% 0.34/1.51  # Current number of unprocessed clauses: 725
% 0.34/1.51  # ...number of literals in the above   : 1530
% 0.34/1.51  # Current number of archived formulas  : 0
% 0.34/1.51  # Current number of archived clauses   : 2
% 0.34/1.51  # Clause-clause subsumption calls (NU) : 837
% 0.34/1.51  # Rec. Clause-clause subsumption calls : 825
% 0.34/1.51  # Non-unit clause-clause subsumptions  : 31
% 0.34/1.51  # Unit Clause-clause subsumption calls : 66
% 0.34/1.51  # Rewrite failures with RHS unbound    : 0
% 0.34/1.51  # BW rewrite match attempts            : 75
% 0.34/1.51  # BW rewrite match successes           : 26
% 0.34/1.51  # Condensation attempts                : 0
% 0.34/1.51  # Condensation successes               : 0
% 0.34/1.51  # Termbank termtop insertions          : 40491
% 0.34/1.51  
% 0.34/1.51  # -------------------------------------------------
% 0.34/1.51  # User time                : 0.047 s
% 0.34/1.51  # System time              : 0.003 s
% 0.34/1.51  # Total time               : 0.050 s
% 0.34/1.51  # Maximum resident set size: 5548 pages
%------------------------------------------------------------------------------