TSTP Solution File: NUM844+2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUM844+2 : TPTP v8.1.2. Released v4.1.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 19:08:40 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof('ass(cond(52, 0), 0)',axiom,
    ! [X10,X11] : vplus(vsucc(X10),X11) = vsucc(vplus(X10,X11)),
    file('/export/starexec/sandbox2/tmp/tmp.VTc8YvVyX8/E---3.1_32593.p','ass(cond(52, 0), 0)') ).

fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
    ! [X16,X17] :
      ( vplus(X16,vsucc(X17)) = vsucc(vplus(X16,X17))
      & vplus(X16,v1) = vsucc(X16) ),
    file('/export/starexec/sandbox2/tmp/tmp.VTc8YvVyX8/E---3.1_32593.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X8,X9] : vplus(X9,X8) = vplus(X8,X9),
    file('/export/starexec/sandbox2/tmp/tmp.VTc8YvVyX8/E---3.1_32593.p','ass(cond(61, 0), 0)') ).

fof('ass(cond(33, 0), 0)',axiom,
    ! [X13,X14,X15] : vplus(vplus(X13,X14),X15) = vplus(X13,vplus(X14,X15)),
    file('/export/starexec/sandbox2/tmp/tmp.VTc8YvVyX8/E---3.1_32593.p','ass(cond(33, 0), 0)') ).

fof('holds(266, 415, 3)',conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) = vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    file('/export/starexec/sandbox2/tmp/tmp.VTc8YvVyX8/E---3.1_32593.p','holds(266, 415, 3)') ).

fof(c_0_5,plain,
    ! [X26,X27] : vplus(vsucc(X26),X27) = vsucc(vplus(X26,X27)),
    inference(variable_rename,[status(thm)],['ass(cond(52, 0), 0)']) ).

fof(c_0_6,plain,
    ! [X32,X33] :
      ( vplus(X32,vsucc(X33)) = vsucc(vplus(X32,X33))
      & vplus(X32,v1) = vsucc(X32) ),
    inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))']) ).

fof(c_0_7,plain,
    ! [X24,X25] : vplus(X25,X24) = vplus(X24,X25),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

fof(c_0_8,plain,
    ! [X29,X30,X31] : vplus(vplus(X29,X30),X31) = vplus(X29,vplus(X30,X31)),
    inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).

fof(c_0_9,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(266, 415, 3)'])]) ).

cnf(c_0_10,plain,
    vplus(vsucc(X1),X2) = vsucc(vplus(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    vplus(X1,vsucc(X2)) = vsucc(vplus(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    vplus(X1,X2) = vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    vplus(vsucc(X1),X2) = vplus(X1,vsucc(X2)),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    vplus(X1,X2) = vplus(X2,X1),
    c_0_12 ).

cnf(c_0_17,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_12]),c_0_13]),c_0_15]),c_0_12]),c_0_13]),c_0_15]),c_0_16,c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : NUM844+2 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n009.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 2400
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Oct  2 13:15:14 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order model finding
% 0.19/0.46  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.VTc8YvVyX8/E---3.1_32593.p
% 0.19/0.47  # Version: 3.1pre001
% 0.19/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47  # Starting sh5l with 300s (1) cores
% 0.19/0.47  # new_bool_3 with pid 32671 completed with status 0
% 0.19/0.47  # Result found by new_bool_3
% 0.19/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47  # Search class: FHUPM-FFSM21-MFFFFFNN
% 0.19/0.47  # partial match(1): FHUPM-FFSF21-MFFFFFNN
% 0.19/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 181s (1) cores
% 0.19/0.47  # G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 32674 completed with status 0
% 0.19/0.47  # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.19/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47  # Search class: FHUPM-FFSM21-MFFFFFNN
% 0.19/0.47  # partial match(1): FHUPM-FFSF21-MFFFFFNN
% 0.19/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 181s (1) cores
% 0.19/0.47  # Preprocessing time       : 0.001 s
% 0.19/0.47  # Presaturation interreduction done
% 0.19/0.47  
% 0.19/0.47  # Proof found!
% 0.19/0.47  # SZS status Theorem
% 0.19/0.47  # SZS output start CNFRefutation
% See solution above
% 0.19/0.47  # Parsed axioms                        : 20
% 0.19/0.47  # Removed by relevancy pruning/SinE    : 3
% 0.19/0.47  # Initial clauses                      : 19
% 0.19/0.47  # Removed in clause preprocessing      : 0
% 0.19/0.47  # Initial clauses in saturation        : 19
% 0.19/0.47  # Processed clauses                    : 22
% 0.19/0.47  # ...of these trivial                  : 2
% 0.19/0.47  # ...subsumed                          : 0
% 0.19/0.47  # ...remaining for further processing  : 19
% 0.19/0.47  # Other redundant clauses eliminated   : 0
% 0.19/0.47  # Clauses deleted for lack of memory   : 0
% 0.19/0.47  # Backward-subsumed                    : 0
% 0.19/0.47  # Backward-rewritten                   : 6
% 0.19/0.47  # Generated clauses                    : 0
% 0.19/0.47  # ...of the previous two non-redundant : 4
% 0.19/0.47  # ...aggressively subsumed             : 0
% 0.19/0.47  # Contextual simplify-reflections      : 0
% 0.19/0.47  # Paramodulations                      : 0
% 0.19/0.47  # Factorizations                       : 0
% 0.19/0.47  # NegExts                              : 0
% 0.19/0.47  # Equation resolutions                 : 0
% 0.19/0.47  # Total rewrite steps                  : 33
% 0.19/0.47  # Propositional unsat checks           : 0
% 0.19/0.47  #    Propositional check models        : 0
% 0.19/0.47  #    Propositional check unsatisfiable : 0
% 0.19/0.47  #    Propositional clauses             : 0
% 0.19/0.47  #    Propositional clauses after purity: 0
% 0.19/0.47  #    Propositional unsat core size     : 0
% 0.19/0.47  #    Propositional preprocessing time  : 0.000
% 0.19/0.47  #    Propositional encoding time       : 0.000
% 0.19/0.47  #    Propositional solver time         : 0.000
% 0.19/0.47  #    Success case prop preproc time    : 0.000
% 0.19/0.47  #    Success case prop encoding time   : 0.000
% 0.19/0.47  #    Success case prop solver time     : 0.000
% 0.19/0.47  # Current number of processed clauses  : 13
% 0.19/0.47  #    Positive orientable unit clauses  : 10
% 0.19/0.47  #    Positive unorientable unit clauses: 1
% 0.19/0.47  #    Negative unit clauses             : 1
% 0.19/0.47  #    Non-unit-clauses                  : 1
% 0.19/0.47  # Current number of unprocessed clauses: 1
% 0.19/0.47  # ...number of literals in the above   : 1
% 0.19/0.47  # Current number of archived formulas  : 0
% 0.19/0.47  # Current number of archived clauses   : 6
% 0.19/0.47  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.47  # Unit Clause-clause subsumption calls : 0
% 0.19/0.47  # Rewrite failures with RHS unbound    : 0
% 0.19/0.47  # BW rewrite match attempts            : 13
% 0.19/0.47  # BW rewrite match successes           : 12
% 0.19/0.47  # Condensation attempts                : 0
% 0.19/0.47  # Condensation successes               : 0
% 0.19/0.47  # Termbank termtop insertions          : 776
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.004 s
% 0.19/0.47  # System time              : 0.001 s
% 0.19/0.47  # Total time               : 0.005 s
% 0.19/0.47  # Maximum resident set size: 1788 pages
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.004 s
% 0.19/0.47  # System time              : 0.004 s
% 0.19/0.47  # Total time               : 0.008 s
% 0.19/0.47  # Maximum resident set size: 1704 pages
% 0.19/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------