TSTP Solution File: NUN133-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : NUN133-1 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n003.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:09:33 EDT 2023

% Result   : Unsatisfiable 1087.28s 137.41s
% Output   : CNFRefutation 1087.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   37 (  37 unt;   0 nHn;   8 RR)
%            Number of literals    :   37 (  36 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(sum_s,axiom,
    sum(s(X1)) = '+'(s(X1),sum(X1)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',sum_s) ).

cnf(plus_comm,axiom,
    '+'(X1,X2) = '+'(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',plus_comm) ).

cnf(goal,negated_conjecture,
    times(sum(s(a)),sum(s(a))) != cubes(s(a)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',goal) ).

cnf(cubes_s,axiom,
    cubes(s(X1)) = '+'(times(s(X1),times(s(X1),s(X1))),cubes(X1)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',cubes_s) ).

cnf(times_s,axiom,
    times(s(X1),X2) = '+'(X2,times(X1,X2)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',times_s) ).

cnf(plus_sum,axiom,
    '+'(sum(X1),sum(X1)) = times(X1,s(X1)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',plus_sum) ).

cnf(induction_hypothesis,axiom,
    times(sum(a),sum(a)) = cubes(a),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',induction_hypothesis) ).

cnf(plus_assoc,axiom,
    '+'(X1,'+'(X2,X3)) = '+'('+'(X1,X2),X3),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',plus_assoc) ).

cnf(distr,axiom,
    times(X1,'+'(X2,X3)) = '+'(times(X1,X2),times(X1,X3)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',distr) ).

cnf(distr_001,axiom,
    times('+'(X1,X2),X3) = '+'(times(X1,X3),times(X2,X3)),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',distr_001) ).

cnf(times_one,axiom,
    times(X1,one) = X1,
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',times_one) ).

cnf(times_comm,axiom,
    times(X1,X2) = times(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',times_comm) ).

cnf(times_assoc,axiom,
    times(X1,times(X2,X3)) = times(times(X1,X2),X3),
    file('/export/starexec/sandbox/tmp/tmp.03evLOtnEg/E---3.1_8182.p',times_assoc) ).

cnf(c_0_13,axiom,
    sum(s(X1)) = '+'(s(X1),sum(X1)),
    sum_s ).

cnf(c_0_14,axiom,
    '+'(X1,X2) = '+'(X2,X1),
    plus_comm ).

cnf(c_0_15,negated_conjecture,
    times(sum(s(a)),sum(s(a))) != cubes(s(a)),
    goal ).

cnf(c_0_16,plain,
    sum(s(X1)) = '+'(sum(X1),s(X1)),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    cubes(s(X1)) = '+'(times(s(X1),times(s(X1),s(X1))),cubes(X1)),
    cubes_s ).

cnf(c_0_18,axiom,
    times(s(X1),X2) = '+'(X2,times(X1,X2)),
    times_s ).

cnf(c_0_19,axiom,
    '+'(sum(X1),sum(X1)) = times(X1,s(X1)),
    plus_sum ).

cnf(c_0_20,negated_conjecture,
    cubes(s(a)) != times('+'(sum(a),s(a)),'+'(sum(a),s(a))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).

cnf(c_0_21,plain,
    cubes(s(X1)) = '+'(cubes(X1),'+'('+'('+'(sum(X1),sum(X1)),s(X1)),times(X1,'+'('+'(sum(X1),sum(X1)),s(X1))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_14]),c_0_18]),c_0_14]) ).

cnf(c_0_22,axiom,
    times(sum(a),sum(a)) = cubes(a),
    induction_hypothesis ).

cnf(c_0_23,negated_conjecture,
    times('+'(sum(a),s(a)),'+'(sum(a),s(a))) != '+'(times(sum(a),sum(a)),'+'('+'('+'(sum(a),sum(a)),s(a)),times(a,'+'('+'(sum(a),sum(a)),s(a))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_24,axiom,
    '+'(X1,'+'(X2,X3)) = '+'('+'(X1,X2),X3),
    plus_assoc ).

cnf(c_0_25,axiom,
    times(X1,'+'(X2,X3)) = '+'(times(X1,X2),times(X1,X3)),
    distr ).

cnf(c_0_26,axiom,
    times('+'(X1,X2),X3) = '+'(times(X1,X3),times(X2,X3)),
    distr_001 ).

cnf(c_0_27,axiom,
    times(X1,one) = X1,
    times_one ).

cnf(c_0_28,axiom,
    times(X1,X2) = times(X2,X1),
    times_comm ).

cnf(c_0_29,axiom,
    times(X1,times(X2,X3)) = times(times(X1,X2),X3),
    times_assoc ).

cnf(c_0_30,negated_conjecture,
    '+'(sum(a),'+'(times(a,sum(a)),'+'(times(sum(a),sum(a)),'+'(sum(a),'+'(sum(a),'+'(s(a),times(sum(a),s(a)))))))) != '+'(times(sum(a),sum(a)),'+'(sum(a),'+'(sum(a),'+'(times(a,sum(a)),'+'(sum(a),'+'(sum(a),'+'(times(a,sum(a)),s(a)))))))),
    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)],[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)],[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)],[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_23,c_0_24]),c_0_24]),c_0_24]),c_0_25]),c_0_26]),c_0_18]),c_0_14]),c_0_24]),c_0_26]),c_0_18]),c_0_19]),c_0_14]),c_0_24]),c_0_14]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_25]),c_0_25]),c_0_19]),c_0_14]),c_0_24]),c_0_14]),c_0_24]),c_0_24]),c_0_24]) ).

cnf(c_0_31,plain,
    s(X1) = '+'(one,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_27]) ).

cnf(c_0_32,plain,
    '+'(X1,X2) = '+'(X2,X1),
    c_0_14 ).

cnf(c_0_33,plain,
    times(X1,X2) = times(X2,X1),
    c_0_28 ).

cnf(c_0_34,plain,
    '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
    c_0_24 ).

cnf(c_0_35,plain,
    times(times(X1,X2),X3) = times(X1,times(X2,X3)),
    c_0_29 ).

cnf(c_0_36,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)],[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)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]),c_0_25]),c_0_27]),c_0_28]),c_0_24]),c_0_14]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_31]),c_0_14]),c_0_24]),c_0_14]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_32,c_0_33,c_0_34,c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : NUN133-1 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n003.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 20:56:33 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.15/0.41  Running first-order model finding
% 0.15/0.41  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.03evLOtnEg/E---3.1_8182.p
% 1087.28/137.41  # Version: 3.1pre001
% 1087.28/137.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1087.28/137.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1087.28/137.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1087.28/137.41  # Starting new_bool_3 with 300s (1) cores
% 1087.28/137.41  # Starting new_bool_1 with 300s (1) cores
% 1087.28/137.41  # Starting sh5l with 300s (1) cores
% 1087.28/137.41  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8259 completed with status 0
% 1087.28/137.41  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1087.28/137.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1087.28/137.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1087.28/137.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1087.28/137.41  # No SInE strategy applied
% 1087.28/137.41  # Search class: FUUPM-FFSS21-MFFFFFNN
% 1087.28/137.41  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1087.28/137.41  # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 1087.28/137.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1087.28/137.41  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1087.28/137.41  # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 1087.28/137.41  # Starting new_bool_3 with 136s (1) cores
% 1087.28/137.41  # G-E--_209_C18_F1_AE_CS_SP_S0Y with pid 8268 completed with status 7
% 1087.28/137.41  # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 130s (1) cores
% 1087.28/137.41  # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 8278 completed with status 0
% 1087.28/137.41  # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 1087.28/137.41  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1087.28/137.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1087.28/137.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1087.28/137.41  # No SInE strategy applied
% 1087.28/137.41  # Search class: FUUPM-FFSS21-MFFFFFNN
% 1087.28/137.41  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1087.28/137.41  # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 1087.28/137.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1087.28/137.41  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1087.28/137.41  # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 1087.28/137.41  # Starting new_bool_3 with 136s (1) cores
% 1087.28/137.41  # G-E--_209_C18_F1_AE_CS_SP_S0Y with pid 8268 completed with status 7
% 1087.28/137.41  # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 130s (1) cores
% 1087.28/137.41  # Preprocessing time       : 0.001 s
% 1087.28/137.41  # Presaturation interreduction done
% 1087.28/137.41  
% 1087.28/137.41  # Proof found!
% 1087.28/137.41  # SZS status Unsatisfiable
% 1087.28/137.41  # SZS output start CNFRefutation
% See solution above
% 1087.28/137.41  # Parsed axioms                        : 18
% 1087.28/137.41  # Removed by relevancy pruning/SinE    : 0
% 1087.28/137.41  # Initial clauses                      : 18
% 1087.28/137.41  # Removed in clause preprocessing      : 0
% 1087.28/137.41  # Initial clauses in saturation        : 18
% 1087.28/137.41  # Processed clauses                    : 44
% 1087.28/137.41  # ...of these trivial                  : 2
% 1087.28/137.41  # ...subsumed                          : 0
% 1087.28/137.41  # ...remaining for further processing  : 41
% 1087.28/137.41  # Other redundant clauses eliminated   : 0
% 1087.28/137.41  # Clauses deleted for lack of memory   : 0
% 1087.28/137.41  # Backward-subsumed                    : 0
% 1087.28/137.41  # Backward-rewritten                   : 8
% 1087.28/137.41  # Generated clauses                    : 64
% 1087.28/137.41  # ...of the previous two non-redundant : 46
% 1087.28/137.41  # ...aggressively subsumed             : 0
% 1087.28/137.41  # Contextual simplify-reflections      : 0
% 1087.28/137.41  # Paramodulations                      : 64
% 1087.28/137.41  # Factorizations                       : 0
% 1087.28/137.41  # NegExts                              : 0
% 1087.28/137.41  # Equation resolutions                 : 0
% 1087.28/137.41  # Total rewrite steps                  : 161
% 1087.28/137.41  # Propositional unsat checks           : 0
% 1087.28/137.41  #    Propositional check models        : 0
% 1087.28/137.41  #    Propositional check unsatisfiable : 0
% 1087.28/137.41  #    Propositional clauses             : 0
% 1087.28/137.41  #    Propositional clauses after purity: 0
% 1087.28/137.41  #    Propositional unsat core size     : 0
% 1087.28/137.41  #    Propositional preprocessing time  : 0.000
% 1087.28/137.41  #    Propositional encoding time       : 0.000
% 1087.28/137.41  #    Propositional solver time         : 0.000
% 1087.28/137.41  #    Success case prop preproc time    : 0.000
% 1087.28/137.41  #    Success case prop encoding time   : 0.000
% 1087.28/137.41  #    Success case prop solver time     : 0.000
% 1087.28/137.41  # Current number of processed clauses  : 15
% 1087.28/137.41  #    Positive orientable unit clauses  : 13
% 1087.28/137.41  #    Positive unorientable unit clauses: 2
% 1087.28/137.41  #    Negative unit clauses             : 0
% 1087.28/137.41  #    Non-unit-clauses                  : 0
% 1087.28/137.41  # Current number of unprocessed clauses: 38
% 1087.28/137.41  # ...number of literals in the above   : 38
% 1087.28/137.41  # Current number of archived formulas  : 0
% 1087.28/137.41  # Current number of archived clauses   : 26
% 1087.28/137.41  # Clause-clause subsumption calls (NU) : 0
% 1087.28/137.41  # Rec. Clause-clause subsumption calls : 0
% 1087.28/137.41  # Non-unit clause-clause subsumptions  : 0
% 1087.28/137.41  # Unit Clause-clause subsumption calls : 0
% 1087.28/137.41  # Rewrite failures with RHS unbound    : 0
% 1087.28/137.41  # BW rewrite match attempts            : 26
% 1087.28/137.41  # BW rewrite match successes           : 26
% 1087.28/137.41  # Condensation attempts                : 0
% 1087.28/137.41  # Condensation successes               : 0
% 1087.28/137.41  # Termbank termtop insertions          : 1155
% 1087.28/137.41  
% 1087.28/137.41  # -------------------------------------------------
% 1087.28/137.41  # User time                : 134.107 s
% 1087.28/137.41  # System time              : 2.071 s
% 1087.28/137.41  # Total time               : 136.178 s
% 1087.28/137.41  # Maximum resident set size: 1536 pages
% 1087.28/137.41  
% 1087.28/137.41  # -------------------------------------------------
% 1087.28/137.41  # User time                : 668.582 s
% 1087.28/137.41  # System time              : 8.373 s
% 1087.28/137.41  # Total time               : 676.954 s
% 1087.28/137.41  # Maximum resident set size: 1680 pages
% 1087.28/137.41  % E---3.1 exiting
%------------------------------------------------------------------------------