TSTP Solution File: FLD064-3 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : FLD064-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.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 17:30:45 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_inverse_addition,axiom,
    ( sum(additive_inverse(X1),X1,additive_identity)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',existence_of_inverse_addition) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',a_is_defined) ).

cnf(commutativity_addition,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',commutativity_addition) ).

cnf(existence_of_identity_addition,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',existence_of_identity_addition) ).

cnf(well_definedness_of_additive_inverse,axiom,
    ( defined(additive_inverse(X1))
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',well_definedness_of_additive_inverse) ).

cnf(compatibility_of_order_relation_and_addition,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,X4)
    | ~ sum(X3,X5,X1)
    | ~ sum(X4,X5,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',compatibility_of_order_relation_and_addition) ).

cnf(less_or_equal_2,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',less_or_equal_2) ).

cnf(not_less_or_equal_3,negated_conjecture,
    ~ less_or_equal(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox2/tmp/tmp.T4Bv0ha5jG/E---3.1_4223.p',not_less_or_equal_3) ).

cnf(c_0_8,axiom,
    ( sum(additive_inverse(X1),X1,additive_identity)
    | ~ defined(X1) ),
    existence_of_inverse_addition ).

cnf(c_0_9,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_10,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    commutativity_addition ).

cnf(c_0_11,hypothesis,
    sum(additive_inverse(a),a,additive_identity),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    existence_of_identity_addition ).

cnf(c_0_13,axiom,
    ( defined(additive_inverse(X1))
    | ~ defined(X1) ),
    well_definedness_of_additive_inverse ).

cnf(c_0_14,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,X4)
    | ~ sum(X3,X5,X1)
    | ~ sum(X4,X5,X2) ),
    compatibility_of_order_relation_and_addition ).

cnf(c_0_15,hypothesis,
    sum(a,additive_inverse(a),additive_identity),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    ( sum(additive_identity,additive_inverse(X1),additive_inverse(X1))
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,hypothesis,
    ( less_or_equal(X1,additive_identity)
    | ~ less_or_equal(X2,a)
    | ~ sum(X2,additive_inverse(a),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,hypothesis,
    sum(additive_identity,additive_inverse(a),additive_inverse(a)),
    inference(spm,[status(thm)],[c_0_16,c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    less_or_equal(additive_identity,a),
    less_or_equal_2 ).

cnf(c_0_20,negated_conjecture,
    ~ less_or_equal(additive_inverse(a),additive_identity),
    not_less_or_equal_3 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD064-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n025.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 23:36:06 EDT 2023
% 0.12/0.33  % 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.T4Bv0ha5jG/E---3.1_4223.p
% 0.19/0.48  # Version: 3.1pre001
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4302 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.48  # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48  # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48  # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 0.19/0.48  # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 4307 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.48  # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Unsatisfiable
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 29
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.48  # Initial clauses                      : 29
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 29
% 0.19/0.48  # Processed clauses                    : 88
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 2
% 0.19/0.48  # ...remaining for further processing  : 86
% 0.19/0.48  # Other redundant clauses eliminated   : 0
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 160
% 0.19/0.48  # ...of the previous two non-redundant : 139
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 158
% 0.19/0.48  # Factorizations                       : 2
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 0
% 0.19/0.48  # Total rewrite steps                  : 22
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 57
% 0.19/0.48  #    Positive orientable unit clauses  : 23
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 2
% 0.19/0.48  #    Non-unit-clauses                  : 32
% 0.19/0.48  # Current number of unprocessed clauses: 109
% 0.19/0.48  # ...number of literals in the above   : 326
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 29
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 114
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 111
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 2
% 0.19/0.48  # Unit Clause-clause subsumption calls : 18
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 1
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 0
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 2707
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.005 s
% 0.19/0.48  # System time              : 0.001 s
% 0.19/0.48  # Total time               : 0.006 s
% 0.19/0.48  # Maximum resident set size: 1652 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.026 s
% 0.19/0.48  # System time              : 0.003 s
% 0.19/0.48  # Total time               : 0.030 s
% 0.19/0.48  # Maximum resident set size: 1696 pages
% 0.19/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------