TSTP Solution File: SWW225+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SWW225+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.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  : 300s
% DateTime : Tue May 21 06:41:55 EDT 2024

% Result   : Theorem 0.86s 0.73s
% Output   : CNFRefutation 0.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  15 unt;   0 def)
%            Number of atoms       :   31 (   6 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   20 (  11   ~;   6   |;   1   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :   18 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
    c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(fact_real__of__nat__Suc,axiom,
    ! [X6] : hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(X6)) = c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X6),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_real__of__nat__Suc) ).

fof(fact_nat__less__real__le,axiom,
    ! [X18,X19] :
      ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,X19,X18)
    <=> c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X19),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),hAPP(c_RealDef_Oreal(tc_Nat_Onat),X18)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_nat__less__real__le) ).

fof(fact_real__eq__of__nat,axiom,
    c_RealDef_Oreal(tc_Nat_Onat) = c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_real__eq__of__nat) ).

fof(fact_le__imp__less__Suc,axiom,
    ! [X6,X7] :
      ( c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,X7,X6)
     => c_Orderings_Oord__class_Oless(tc_Nat_Onat,X7,c_Nat_OSuc(X6)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_le__imp__less__Suc) ).

fof(fact__096N1_A_L_AN2_A_060_061_Af_A_IN1_A_L_AN2_J_096,axiom,
    c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____),hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact__096N1_A_L_AN2_A_060_061_Af_A_IN1_A_L_AN2_J_096) ).

fof(c_0_6,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))))),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

fof(c_0_7,plain,
    ! [X504] : hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(X504)) = c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X504),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),
    inference(variable_rename,[status(thm)],[fact_real__of__nat__Suc]) ).

fof(c_0_8,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))))),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X507,X508] :
      ( ( ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X508,X507)
        | c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X508),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),hAPP(c_RealDef_Oreal(tc_Nat_Onat),X507)) )
      & ( ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X508),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),hAPP(c_RealDef_Oreal(tc_Nat_Onat),X507))
        | c_Orderings_Oord__class_Oless(tc_Nat_Onat,X508,X507) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_nat__less__real__le])])]) ).

cnf(c_0_10,plain,
    hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(X1)) = c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X1),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    c_RealDef_Oreal(tc_Nat_Onat) = c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),
    inference(split_conjunct,[status(thm)],[fact_real__eq__of__nat]) ).

cnf(c_0_12,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),hAPP(c_RealDef_Oreal(tc_Nat_Onat),c_Nat_OSuc(hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_RealDef_Oreal(tc_Nat_Onat),X1),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)),hAPP(c_RealDef_Oreal(tc_Nat_Onat),X2))
    | ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    c_Groups_Oplus__class_Oplus(tc_RealDef_Oreal,hAPP(c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),X1),c_Groups_Oone__class_Oone(tc_RealDef_Oreal)) = hAPP(c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),c_Nat_OSuc(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,hAPP(c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),c_Nat_OSuc(c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),hAPP(c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),c_Nat_OSuc(hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).

cnf(c_0_16,plain,
    ( c_Orderings_Oord__class_Oless__eq(tc_RealDef_Oreal,hAPP(c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),c_Nat_OSuc(X1)),hAPP(c_Nat_Osemiring__1__class_Oof__nat(tc_RealDef_Oreal),X2))
    | ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,X1,X2) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_14]),c_0_11]) ).

fof(c_0_17,plain,
    ! [X305,X306] :
      ( ~ c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,X306,X305)
      | c_Orderings_Oord__class_Oless(tc_Nat_Onat,X306,c_Nat_OSuc(X305)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_le__imp__less__Suc])])]) ).

cnf(c_0_18,negated_conjecture,
    ~ c_Orderings_Oord__class_Oless(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____),c_Nat_OSuc(hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____)))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( c_Orderings_Oord__class_Oless(tc_Nat_Onat,X1,c_Nat_OSuc(X2))
    | ~ c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_20,plain,
    c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____),hAPP(v_f____,c_Groups_Oplus__class_Oplus(tc_Nat_Onat,v_N1____,v_N2____))),
    inference(split_conjunct,[status(thm)],[fact__096N1_A_L_AN2_A_060_061_Af_A_IN1_A_L_AN2_J_096]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SWW225+1 : TPTP v8.2.0. Released v5.2.0.
% 0.08/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat May 18 19:37:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  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/benchmark/theBenchmark.p
% 0.86/0.73  # Version: 3.1.0
% 0.86/0.73  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.86/0.73  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.73  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.86/0.73  # Starting new_bool_3 with 300s (1) cores
% 0.86/0.73  # Starting new_bool_1 with 300s (1) cores
% 0.86/0.73  # Starting sh5l with 300s (1) cores
% 0.86/0.73  # new_bool_1 with pid 10664 completed with status 0
% 0.86/0.73  # Result found by new_bool_1
% 0.86/0.73  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.86/0.73  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.73  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.86/0.73  # Starting new_bool_3 with 300s (1) cores
% 0.86/0.73  # Starting new_bool_1 with 300s (1) cores
% 0.86/0.73  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.86/0.73  # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.86/0.73  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.73  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.86/0.73  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 10667 completed with status 0
% 0.86/0.73  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.86/0.73  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.86/0.73  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.73  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.86/0.73  # Starting new_bool_3 with 300s (1) cores
% 0.86/0.73  # Starting new_bool_1 with 300s (1) cores
% 0.86/0.73  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.86/0.73  # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.86/0.73  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.73  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.86/0.73  # Preprocessing time       : 0.012 s
% 0.86/0.73  # Presaturation interreduction done
% 0.86/0.73  
% 0.86/0.73  # Proof found!
% 0.86/0.73  # SZS status Theorem
% 0.86/0.73  # SZS output start CNFRefutation
% See solution above
% 0.86/0.73  # Parsed axioms                        : 1269
% 0.86/0.73  # Removed by relevancy pruning/SinE    : 738
% 0.86/0.73  # Initial clauses                      : 726
% 0.86/0.73  # Removed in clause preprocessing      : 16
% 0.86/0.73  # Initial clauses in saturation        : 710
% 0.86/0.73  # Processed clauses                    : 2875
% 0.86/0.73  # ...of these trivial                  : 63
% 0.86/0.73  # ...subsumed                          : 1587
% 0.86/0.73  # ...remaining for further processing  : 1225
% 0.86/0.73  # Other redundant clauses eliminated   : 132
% 0.86/0.73  # Clauses deleted for lack of memory   : 0
% 0.86/0.73  # Backward-subsumed                    : 10
% 0.86/0.73  # Backward-rewritten                   : 7
% 0.86/0.73  # Generated clauses                    : 6062
% 0.86/0.73  # ...of the previous two non-redundant : 4982
% 0.86/0.73  # ...aggressively subsumed             : 0
% 0.86/0.73  # Contextual simplify-reflections      : 2
% 0.86/0.73  # Paramodulations                      : 5926
% 0.86/0.73  # Factorizations                       : 6
% 0.86/0.73  # NegExts                              : 0
% 0.86/0.73  # Equation resolutions                 : 140
% 0.86/0.73  # Disequality decompositions           : 0
% 0.86/0.73  # Total rewrite steps                  : 3917
% 0.86/0.73  # ...of those cached                   : 3201
% 0.86/0.73  # Propositional unsat checks           : 0
% 0.86/0.73  #    Propositional check models        : 0
% 0.86/0.73  #    Propositional check unsatisfiable : 0
% 0.86/0.73  #    Propositional clauses             : 0
% 0.86/0.73  #    Propositional clauses after purity: 0
% 0.86/0.73  #    Propositional unsat core size     : 0
% 0.86/0.73  #    Propositional preprocessing time  : 0.000
% 0.86/0.73  #    Propositional encoding time       : 0.000
% 0.86/0.73  #    Propositional solver time         : 0.000
% 0.86/0.73  #    Success case prop preproc time    : 0.000
% 0.86/0.73  #    Success case prop encoding time   : 0.000
% 0.86/0.73  #    Success case prop solver time     : 0.000
% 0.86/0.73  # Current number of processed clauses  : 600
% 0.86/0.73  #    Positive orientable unit clauses  : 192
% 0.86/0.73  #    Positive unorientable unit clauses: 7
% 0.86/0.73  #    Negative unit clauses             : 188
% 0.86/0.73  #    Non-unit-clauses                  : 213
% 0.86/0.73  # Current number of unprocessed clauses: 3354
% 0.86/0.73  # ...number of literals in the above   : 6050
% 0.86/0.73  # Current number of archived formulas  : 0
% 0.86/0.73  # Current number of archived clauses   : 555
% 0.86/0.73  # Clause-clause subsumption calls (NU) : 17852
% 0.86/0.73  # Rec. Clause-clause subsumption calls : 14012
% 0.86/0.73  # Non-unit clause-clause subsumptions  : 307
% 0.86/0.73  # Unit Clause-clause subsumption calls : 4734
% 0.86/0.73  # Rewrite failures with RHS unbound    : 0
% 0.86/0.73  # BW rewrite match attempts            : 1882
% 0.86/0.73  # BW rewrite match successes           : 250
% 0.86/0.73  # Condensation attempts                : 0
% 0.86/0.73  # Condensation successes               : 0
% 0.86/0.73  # Termbank termtop insertions          : 150473
% 0.86/0.73  # Search garbage collected termcells   : 12394
% 0.86/0.73  
% 0.86/0.73  # -------------------------------------------------
% 0.86/0.73  # User time                : 0.192 s
% 0.86/0.73  # System time              : 0.009 s
% 0.86/0.73  # Total time               : 0.201 s
% 0.86/0.73  # Maximum resident set size: 4948 pages
% 0.86/0.73  
% 0.86/0.73  # -------------------------------------------------
% 0.86/0.73  # User time                : 0.231 s
% 0.86/0.73  # System time              : 0.012 s
% 0.86/0.73  # Total time               : 0.243 s
% 0.86/0.73  # Maximum resident set size: 3104 pages
% 0.86/0.73  % E---3.1 exiting
% 0.86/0.73  % E exiting
%------------------------------------------------------------------------------