TSTP Solution File: COL046-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : COL046-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n015.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:28:07 EDT 2024

% Result   : Unsatisfiable 12.55s 2.07s
% Output   : CNFRefutation 12.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   5 RR)
%            Number of literals    :   17 (  16 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(m_definition,axiom,
    apply(m,X1) = apply(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.uRnSZe25Pg/E---3.1_21666.p',m_definition) ).

cnf(b_definition,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.uRnSZe25Pg/E---3.1_21666.p',b_definition) ).

cnf(s_definition,axiom,
    apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.uRnSZe25Pg/E---3.1_21666.p',s_definition) ).

cnf(prove_fixed_point,negated_conjecture,
    apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
    file('/export/starexec/sandbox2/tmp/tmp.uRnSZe25Pg/E---3.1_21666.p',prove_fixed_point) ).

cnf(c_0_4,axiom,
    apply(m,X1) = apply(X1,X1),
    m_definition ).

cnf(c_0_5,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    b_definition ).

cnf(c_0_6,plain,
    apply(m,apply(apply(b,X1),X2)) = apply(X1,apply(X2,apply(apply(b,X1),X2))),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,axiom,
    apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
    s_definition ).

cnf(c_0_8,negated_conjecture,
    apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
    inference(fof_simplification,[status(thm)],[prove_fixed_point]) ).

cnf(c_0_9,plain,
    apply(X1,apply(apply(X2,X1),apply(apply(apply(s,b),X2),X1))) = apply(m,apply(apply(apply(s,b),X2),X1)),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
    c_0_8 ).

cnf(c_0_11,plain,
    apply(X1,apply(apply(apply(s,X2),apply(apply(s,b),X2)),X1)) = apply(m,apply(apply(apply(s,b),X2),X1)),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_12,plain,
    apply(X1,apply(apply(X2,apply(apply(b,apply(b,X1)),X2)),apply(m,apply(apply(b,apply(b,X1)),X2)))) = apply(m,apply(m,apply(apply(b,apply(b,X1)),X2))),
    inference(spm,[status(thm)],[c_0_6,c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    apply(apply(apply(s,X1),apply(apply(s,b),X1)),f(apply(apply(s,X1),apply(apply(s,b),X1)))) != apply(m,apply(apply(apply(s,b),X1),f(apply(apply(s,X1),apply(apply(s,b),X1))))),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    apply(X1,apply(m,apply(m,apply(apply(b,apply(b,X1)),m)))) = apply(m,apply(m,apply(apply(b,apply(b,X1)),m))),
    inference(spm,[status(thm)],[c_0_12,c_0_4]) ).

cnf(c_0_15,plain,
    apply(apply(apply(s,X1),X1),X2) = apply(m,apply(X1,X2)),
    inference(spm,[status(thm)],[c_0_4,c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : COL046-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n015.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 12:00:06 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.51  Running first-order theorem proving
% 0.20/0.51  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/tmp/tmp.uRnSZe25Pg/E---3.1_21666.p
% 12.55/2.07  # Version: 3.1.0
% 12.55/2.07  # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.55/2.07  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.55/2.07  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.55/2.07  # Starting new_bool_3 with 300s (1) cores
% 12.55/2.07  # Starting new_bool_1 with 300s (1) cores
% 12.55/2.07  # Starting sh5l with 300s (1) cores
% 12.55/2.07  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21792 completed with status 0
% 12.55/2.07  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 12.55/2.07  # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.55/2.07  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.55/2.07  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.55/2.07  # No SInE strategy applied
% 12.55/2.07  # Search class: FUUPS-FFSF21-MFFFFFNN
% 12.55/2.07  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 12.55/2.07  # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 12.55/2.07  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 12.55/2.07  # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.55/2.07  # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.55/2.07  # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.55/2.07  # U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 21802 completed with status 0
% 12.55/2.07  # Result found by U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 12.55/2.07  # Preprocessing class: FSSSSMSSSSSNFFN.
% 12.55/2.07  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.55/2.07  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.55/2.07  # No SInE strategy applied
% 12.55/2.07  # Search class: FUUPS-FFSF21-MFFFFFNN
% 12.55/2.07  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 12.55/2.07  # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 12.55/2.07  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 12.55/2.07  # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.55/2.07  # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.55/2.07  # Preprocessing time       : 0.001 s
% 12.55/2.07  # Presaturation interreduction done
% 12.55/2.07  
% 12.55/2.07  # Proof found!
% 12.55/2.07  # SZS status Unsatisfiable
% 12.55/2.07  # SZS output start CNFRefutation
% See solution above
% 12.55/2.07  # Parsed axioms                        : 4
% 12.55/2.07  # Removed by relevancy pruning/SinE    : 0
% 12.55/2.07  # Initial clauses                      : 4
% 12.55/2.07  # Removed in clause preprocessing      : 0
% 12.55/2.07  # Initial clauses in saturation        : 4
% 12.55/2.07  # Processed clauses                    : 1007
% 12.55/2.07  # ...of these trivial                  : 281
% 12.55/2.07  # ...subsumed                          : 517
% 12.55/2.07  # ...remaining for further processing  : 209
% 12.55/2.07  # Other redundant clauses eliminated   : 0
% 12.55/2.07  # Clauses deleted for lack of memory   : 0
% 12.55/2.07  # Backward-subsumed                    : 4
% 12.55/2.07  # Backward-rewritten                   : 6
% 12.55/2.07  # Generated clauses                    : 59577
% 12.55/2.07  # ...of the previous two non-redundant : 58954
% 12.55/2.07  # ...aggressively subsumed             : 0
% 12.55/2.07  # Contextual simplify-reflections      : 0
% 12.55/2.07  # Paramodulations                      : 59577
% 12.55/2.07  # Factorizations                       : 0
% 12.55/2.07  # NegExts                              : 0
% 12.55/2.07  # Equation resolutions                 : 0
% 12.55/2.07  # Disequality decompositions           : 0
% 12.55/2.07  # Total rewrite steps                  : 37317
% 12.55/2.07  # ...of those cached                   : 32169
% 12.55/2.07  # Propositional unsat checks           : 0
% 12.55/2.07  #    Propositional check models        : 0
% 12.55/2.07  #    Propositional check unsatisfiable : 0
% 12.55/2.07  #    Propositional clauses             : 0
% 12.55/2.07  #    Propositional clauses after purity: 0
% 12.55/2.07  #    Propositional unsat core size     : 0
% 12.55/2.07  #    Propositional preprocessing time  : 0.000
% 12.55/2.07  #    Propositional encoding time       : 0.000
% 12.55/2.07  #    Propositional solver time         : 0.000
% 12.55/2.07  #    Success case prop preproc time    : 0.000
% 12.55/2.07  #    Success case prop encoding time   : 0.000
% 12.55/2.07  #    Success case prop solver time     : 0.000
% 12.55/2.07  # Current number of processed clauses  : 195
% 12.55/2.07  #    Positive orientable unit clauses  : 63
% 12.55/2.07  #    Positive unorientable unit clauses: 69
% 12.55/2.07  #    Negative unit clauses             : 63
% 12.55/2.07  #    Non-unit-clauses                  : 0
% 12.55/2.07  # Current number of unprocessed clauses: 57943
% 12.55/2.07  # ...number of literals in the above   : 57943
% 12.55/2.07  # Current number of archived formulas  : 0
% 12.55/2.07  # Current number of archived clauses   : 14
% 12.55/2.07  # Clause-clause subsumption calls (NU) : 0
% 12.55/2.07  # Rec. Clause-clause subsumption calls : 0
% 12.55/2.07  # Non-unit clause-clause subsumptions  : 0
% 12.55/2.07  # Unit Clause-clause subsumption calls : 977
% 12.55/2.07  # Rewrite failures with RHS unbound    : 0
% 12.55/2.07  # BW rewrite match attempts            : 3388
% 12.55/2.07  # BW rewrite match successes           : 48
% 12.55/2.07  # Condensation attempts                : 0
% 12.55/2.07  # Condensation successes               : 0
% 12.55/2.07  # Termbank termtop insertions          : 2585520
% 12.55/2.07  # Search garbage collected termcells   : 2
% 12.55/2.07  
% 12.55/2.07  # -------------------------------------------------
% 12.55/2.07  # User time                : 1.465 s
% 12.55/2.07  # System time              : 0.054 s
% 12.55/2.07  # Total time               : 1.519 s
% 12.55/2.07  # Maximum resident set size: 1548 pages
% 12.55/2.07  
% 12.55/2.07  # -------------------------------------------------
% 12.55/2.07  # User time                : 7.297 s
% 12.55/2.07  # System time              : 0.285 s
% 12.55/2.07  # Total time               : 7.582 s
% 12.55/2.07  # Maximum resident set size: 1688 pages
% 12.55/2.07  % E---3.1 exiting
% 12.55/2.08  % E exiting
%------------------------------------------------------------------------------