TSTP Solution File: FLD013-4 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : FLD013-4 : TPTP v8.1.2. Bugfixed v2.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:40:23 EDT 2024

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   30 (  17 unt;   0 nHn;  30 RR)
%            Number of literals    :   53 (   0 equ;  27 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    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',commutativity_addition) ).

cnf(associativity_addition_1,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',associativity_addition_1) ).

cnf(existence_of_identity_addition,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',existence_of_identity_addition) ).

cnf(sum_8,negated_conjecture,
    sum(a,c,u),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',sum_8) ).

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',well_definedness_of_additive_identity) ).

cnf(not_sum_9,negated_conjecture,
    ~ sum(d,b,u),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',not_sum_9) ).

cnf(sum_6,negated_conjecture,
    sum(additive_identity,a,b),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',sum_6) ).

cnf(sum_7,negated_conjecture,
    sum(additive_identity,c,d),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',sum_7) ).

cnf(c_is_defined,hypothesis,
    defined(c),
    file('/export/starexec/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p',c_is_defined) ).

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

cnf(c_0_10,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_11,plain,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).

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

cnf(c_0_13,negated_conjecture,
    sum(a,c,u),
    sum_8 ).

cnf(c_0_14,plain,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    c_0_10 ).

cnf(c_0_15,plain,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    c_0_11 ).

cnf(c_0_16,negated_conjecture,
    sum(c,a,u),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,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_18,axiom,
    defined(additive_identity),
    well_definedness_of_additive_identity ).

cnf(c_0_19,negated_conjecture,
    ~ sum(d,b,u),
    inference(fof_simplification,[status(thm)],[not_sum_9]) ).

cnf(c_0_20,negated_conjecture,
    ( sum(X1,X2,u)
    | ~ sum(X3,a,X2)
    | ~ sum(X1,X3,c) ),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    sum(additive_identity,a,b),
    sum_6 ).

cnf(c_0_22,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_17,c_0_15]),c_0_18])]) ).

cnf(c_0_23,negated_conjecture,
    sum(additive_identity,c,d),
    sum_7 ).

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

cnf(c_0_25,negated_conjecture,
    ~ sum(d,b,u),
    c_0_19 ).

cnf(c_0_26,negated_conjecture,
    ( sum(X1,b,u)
    | ~ sum(X1,additive_identity,c) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    sum(additive_identity,d,c),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_28,negated_conjecture,
    ~ sum(d,additive_identity,c),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : FLD013-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n009.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 13:28:25 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.lpu7qwJqOT/E---3.1_2331.p
% 0.20/0.51  # Version: 3.1.0
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # new_bool_1 with pid 2441 completed with status 0
% 0.20/0.51  # Result found by new_bool_1
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51  # SAT001_MinMin_p005000_rr_RG with pid 2447 completed with status 0
% 0.20/0.51  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.001 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Unsatisfiable
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 35
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 21
% 0.20/0.51  # Initial clauses                      : 14
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 14
% 0.20/0.51  # Processed clauses                    : 78
% 0.20/0.51  # ...of these trivial                  : 1
% 0.20/0.51  # ...subsumed                          : 2
% 0.20/0.51  # ...remaining for further processing  : 75
% 0.20/0.51  # Other redundant clauses eliminated   : 0
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 0
% 0.20/0.51  # Backward-rewritten                   : 0
% 0.20/0.51  # Generated clauses                    : 153
% 0.20/0.51  # ...of the previous two non-redundant : 125
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 0
% 0.20/0.51  # Paramodulations                      : 153
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 0
% 0.20/0.51  # Disequality decompositions           : 0
% 0.20/0.51  # Total rewrite steps                  : 59
% 0.20/0.51  # ...of those cached                   : 41
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 61
% 0.20/0.51  #    Positive orientable unit clauses  : 22
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 2
% 0.20/0.51  #    Non-unit-clauses                  : 37
% 0.20/0.51  # Current number of unprocessed clauses: 75
% 0.20/0.51  # ...number of literals in the above   : 241
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 14
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 149
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 149
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 2
% 0.20/0.51  # Unit Clause-clause subsumption calls : 5
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 2
% 0.20/0.51  # BW rewrite match successes           : 0
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 2269
% 0.20/0.51  # Search garbage collected termcells   : 156
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.004 s
% 0.20/0.51  # System time              : 0.004 s
% 0.20/0.51  # Total time               : 0.008 s
% 0.20/0.51  # Maximum resident set size: 1740 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.007 s
% 0.20/0.51  # System time              : 0.006 s
% 0.20/0.51  # Total time               : 0.013 s
% 0.20/0.51  # Maximum resident set size: 1720 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------