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

View Problem - Process Solution

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

% Computer : n001.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:28 EDT 2023

% Result   : Unsatisfiable 0.15s 0.50s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   43 (  22 unt;   0 nHn;  43 RR)
%            Number of literals    :   87 (   0 equ;  47 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   62 (   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/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',associativity_addition_1) ).

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

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',well_definedness_of_additive_identity) ).

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

cnf(sum_6,negated_conjecture,
    sum(additive_identity,c,d),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',sum_6) ).

cnf(c_is_defined,hypothesis,
    defined(c),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',c_is_defined) ).

cnf(sum_5,negated_conjecture,
    sum(additive_identity,a,b),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',sum_5) ).

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

cnf(associativity_addition_2,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X4,X5,X1)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X6,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',associativity_addition_2) ).

cnf(totality_of_addition,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',totality_of_addition) ).

cnf(d_is_defined,hypothesis,
    defined(d),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',d_is_defined) ).

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',b_is_defined) ).

cnf(not_sum_7,negated_conjecture,
    ~ sum(a,c,add(d,b)),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',not_sum_7) ).

cnf(well_definedness_of_addition,axiom,
    ( defined(add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.MDKtMgl0OT/E---3.1_2261.p',well_definedness_of_addition) ).

cnf(c_0_14,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    associativity_addition_1 ).

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

cnf(c_0_16,plain,
    ( sum(X1,X2,X3)
    | ~ defined(X3)
    | ~ sum(X1,X4,additive_identity)
    | ~ sum(X4,X3,X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,axiom,
    defined(additive_identity),
    well_definedness_of_additive_identity ).

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

cnf(c_0_19,plain,
    ( sum(additive_identity,X1,X2)
    | ~ defined(X2)
    | ~ sum(additive_identity,X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17])]) ).

cnf(c_0_20,negated_conjecture,
    sum(additive_identity,c,d),
    sum_6 ).

cnf(c_0_21,hypothesis,
    defined(c),
    c_is_defined ).

cnf(c_0_22,negated_conjecture,
    sum(additive_identity,a,b),
    sum_5 ).

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

cnf(c_0_24,plain,
    ( sum(X1,additive_identity,X1)
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    sum(additive_identity,d,c),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_26,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X4,X5,X1)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X6,X3) ),
    associativity_addition_2 ).

cnf(c_0_27,negated_conjecture,
    sum(additive_identity,b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_23])]) ).

cnf(c_0_28,plain,
    ( sum(X1,X2,X3)
    | ~ defined(X3)
    | ~ sum(X4,additive_identity,X2)
    | ~ sum(X1,X4,X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    sum(d,additive_identity,c),
    inference(spm,[status(thm)],[c_0_18,c_0_25]) ).

cnf(c_0_30,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_addition ).

cnf(c_0_31,plain,
    ( sum(X1,X2,X3)
    | ~ defined(X2)
    | ~ sum(X4,additive_identity,X1)
    | ~ sum(X4,X2,X3) ),
    inference(spm,[status(thm)],[c_0_26,c_0_15]) ).

cnf(c_0_32,negated_conjecture,
    sum(b,additive_identity,a),
    inference(spm,[status(thm)],[c_0_18,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( sum(X1,c,X2)
    | ~ defined(X2)
    | ~ sum(X1,d,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    ( sum(X1,X2,add(X2,X1))
    | ~ defined(X1)
    | ~ defined(X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_30]) ).

cnf(c_0_35,hypothesis,
    defined(d),
    d_is_defined ).

cnf(c_0_36,negated_conjecture,
    ( sum(a,X1,X2)
    | ~ defined(X1)
    | ~ sum(b,X1,X2) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    ( sum(X1,c,add(d,X1))
    | ~ defined(add(d,X1))
    | ~ defined(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).

cnf(c_0_38,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_39,negated_conjecture,
    ~ sum(a,c,add(d,b)),
    not_sum_7 ).

cnf(c_0_40,negated_conjecture,
    ~ defined(add(d,b)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]),c_0_38])]),c_0_39]) ).

cnf(c_0_41,axiom,
    ( defined(add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    well_definedness_of_addition ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38]),c_0_35])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09  % Problem    : FLD013-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n001.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Oct  2 23:57:37 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.15/0.40  Running first-order model finding
% 0.15/0.40  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.MDKtMgl0OT/E---3.1_2261.p
% 0.15/0.50  # Version: 3.1pre001
% 0.15/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50  # Starting sh5l with 300s (1) cores
% 0.15/0.50  # new_bool_1 with pid 2341 completed with status 0
% 0.15/0.50  # Result found by new_bool_1
% 0.15/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.50  # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.15/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.50  # SAT001_MinMin_p005000_rr_RG with pid 2345 completed with status 0
% 0.15/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.50  # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.15/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.50  # Preprocessing time       : 0.001 s
% 0.15/0.50  # Presaturation interreduction done
% 0.15/0.50  
% 0.15/0.50  # Proof found!
% 0.15/0.50  # SZS status Unsatisfiable
% 0.15/0.50  # SZS output start CNFRefutation
% See solution above
% 0.15/0.50  # Parsed axioms                        : 33
% 0.15/0.50  # Removed by relevancy pruning/SinE    : 19
% 0.15/0.50  # Initial clauses                      : 14
% 0.15/0.50  # Removed in clause preprocessing      : 0
% 0.15/0.50  # Initial clauses in saturation        : 14
% 0.15/0.50  # Processed clauses                    : 1504
% 0.15/0.50  # ...of these trivial                  : 23
% 0.15/0.50  # ...subsumed                          : 928
% 0.15/0.50  # ...remaining for further processing  : 553
% 0.15/0.50  # Other redundant clauses eliminated   : 0
% 0.15/0.50  # Clauses deleted for lack of memory   : 0
% 0.15/0.50  # Backward-subsumed                    : 11
% 0.15/0.50  # Backward-rewritten                   : 0
% 0.15/0.50  # Generated clauses                    : 6085
% 0.15/0.50  # ...of the previous two non-redundant : 5338
% 0.15/0.50  # ...aggressively subsumed             : 0
% 0.15/0.50  # Contextual simplify-reflections      : 0
% 0.15/0.50  # Paramodulations                      : 6085
% 0.15/0.50  # Factorizations                       : 0
% 0.15/0.50  # NegExts                              : 0
% 0.15/0.50  # Equation resolutions                 : 0
% 0.15/0.50  # Total rewrite steps                  : 3363
% 0.15/0.50  # Propositional unsat checks           : 0
% 0.15/0.50  #    Propositional check models        : 0
% 0.15/0.50  #    Propositional check unsatisfiable : 0
% 0.15/0.50  #    Propositional clauses             : 0
% 0.15/0.50  #    Propositional clauses after purity: 0
% 0.15/0.50  #    Propositional unsat core size     : 0
% 0.15/0.50  #    Propositional preprocessing time  : 0.000
% 0.15/0.50  #    Propositional encoding time       : 0.000
% 0.15/0.50  #    Propositional solver time         : 0.000
% 0.15/0.50  #    Success case prop preproc time    : 0.000
% 0.15/0.50  #    Success case prop encoding time   : 0.000
% 0.15/0.50  #    Success case prop solver time     : 0.000
% 0.15/0.50  # Current number of processed clauses  : 528
% 0.15/0.50  #    Positive orientable unit clauses  : 72
% 0.15/0.50  #    Positive unorientable unit clauses: 0
% 0.15/0.50  #    Negative unit clauses             : 2
% 0.15/0.50  #    Non-unit-clauses                  : 454
% 0.15/0.50  # Current number of unprocessed clauses: 3839
% 0.15/0.50  # ...number of literals in the above   : 12732
% 0.15/0.50  # Current number of archived formulas  : 0
% 0.15/0.50  # Current number of archived clauses   : 25
% 0.15/0.50  # Clause-clause subsumption calls (NU) : 16538
% 0.15/0.50  # Rec. Clause-clause subsumption calls : 15545
% 0.15/0.50  # Non-unit clause-clause subsumptions  : 939
% 0.15/0.50  # Unit Clause-clause subsumption calls : 0
% 0.15/0.50  # Rewrite failures with RHS unbound    : 0
% 0.15/0.50  # BW rewrite match attempts            : 35
% 0.15/0.50  # BW rewrite match successes           : 0
% 0.15/0.50  # Condensation attempts                : 0
% 0.15/0.50  # Condensation successes               : 0
% 0.15/0.50  # Termbank termtop insertions          : 72319
% 0.15/0.50  
% 0.15/0.50  # -------------------------------------------------
% 0.15/0.50  # User time                : 0.085 s
% 0.15/0.50  # System time              : 0.006 s
% 0.15/0.50  # Total time               : 0.091 s
% 0.15/0.50  # Maximum resident set size: 1628 pages
% 0.15/0.50  
% 0.15/0.50  # -------------------------------------------------
% 0.15/0.50  # User time                : 0.086 s
% 0.15/0.50  # System time              : 0.008 s
% 0.15/0.50  # Total time               : 0.094 s
% 0.15/0.50  # Maximum resident set size: 1700 pages
% 0.15/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------