TSTP Solution File: FLD039-3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : FLD039-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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 : Mon May 20 19:52:28 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_addition_1,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).

cnf(existence_of_identity_addition,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).

cnf(sum_3,negated_conjecture,
    sum(additive_identity,multiplicative_identity,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_3) ).

cnf(well_definedness_of_multiplicative_identity,axiom,
    defined(multiplicative_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_multiplicative_identity) ).

cnf(commutativity_addition,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).

cnf(different_identities,axiom,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',different_identities) ).

cnf(c_0_6,plain,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).

cnf(c_0_7,plain,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).

cnf(c_0_8,plain,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    c_0_6 ).

cnf(c_0_9,negated_conjecture,
    sum(additive_identity,multiplicative_identity,additive_identity),
    sum_3 ).

cnf(c_0_10,plain,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    c_0_7 ).

cnf(c_0_11,axiom,
    defined(multiplicative_identity),
    well_definedness_of_multiplicative_identity ).

cnf(c_0_12,plain,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_addition]) ).

cnf(c_0_13,negated_conjecture,
    ( sum(X1,X2,additive_identity)
    | ~ sum(X3,multiplicative_identity,X2)
    | ~ sum(X1,X3,additive_identity) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    sum(additive_identity,multiplicative_identity,multiplicative_identity),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    c_0_12 ).

cnf(c_0_16,negated_conjecture,
    ( sum(X1,multiplicative_identity,additive_identity)
    | ~ sum(X1,additive_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ( sum(multiplicative_identity,X1,additive_identity)
    | ~ sum(X1,additive_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    sum(multiplicative_identity,additive_identity,additive_identity),
    inference(spm,[status(thm)],[c_0_15,c_0_9]) ).

cnf(c_0_19,plain,
    ( sum(X1,X2,multiplicative_identity)
    | ~ sum(X3,multiplicative_identity,X2)
    | ~ sum(X1,X3,additive_identity) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    sum(multiplicative_identity,multiplicative_identity,additive_identity),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    inference(fof_simplification,[status(thm)],[different_identities]) ).

cnf(c_0_22,negated_conjecture,
    ( sum(X1,additive_identity,multiplicative_identity)
    | ~ sum(X1,multiplicative_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    c_0_21 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_9]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : FLD039-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n011.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 21:12:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 16903 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # SAT001_MinMin_p005000_rr_RG with pid 16907 completed with status 0
% 0.20/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Unsatisfiable
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 29
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 13
% 0.20/0.50  # Initial clauses                      : 16
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 16
% 0.20/0.50  # Processed clauses                    : 63
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 3
% 0.20/0.50  # ...remaining for further processing  : 60
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 112
% 0.20/0.50  # ...of the previous two non-redundant : 87
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 112
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 17
% 0.20/0.50  # ...of those cached                   : 5
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 44
% 0.20/0.50  #    Positive orientable unit clauses  : 18
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 2
% 0.20/0.50  #    Non-unit-clauses                  : 24
% 0.20/0.50  # Current number of unprocessed clauses: 56
% 0.20/0.50  # ...number of literals in the above   : 192
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 16
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 112
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 112
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 3
% 0.20/0.50  # Unit Clause-clause subsumption calls : 0
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 4
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 1950
% 0.20/0.50  # Search garbage collected termcells   : 149
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.004 s
% 0.20/0.50  # Total time               : 0.007 s
% 0.20/0.50  # Maximum resident set size: 1732 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.005 s
% 0.20/0.50  # System time              : 0.006 s
% 0.20/0.50  # Total time               : 0.011 s
% 0.20/0.50  # Maximum resident set size: 1724 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E exiting
%------------------------------------------------------------------------------