TSTP Solution File: COL006-7 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : COL006-7 : TPTP v8.1.2. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n012.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:37 EDT 2024

% Result   : Unsatisfiable 131.71s 17.09s
% Output   : CNFRefutation 131.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   49 (  49 unt;   0 nHn;   6 RR)
%            Number of literals    :   49 (  48 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :  104 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(s_definition,axiom,
    apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.4bVl6lhpgN/E---3.1_4476.p',s_definition) ).

cnf(k_definition,axiom,
    apply(apply(k,X1),X2) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.4bVl6lhpgN/E---3.1_4476.p',k_definition) ).

cnf(strong_fixed_point,axiom,
    strong_fixed_point = apply(apply(s,apply(k,apply(apply(apply(s,s),apply(apply(s,k),k)),apply(apply(s,s),apply(s,k))))),apply(apply(s,apply(k,s)),k)),
    file('/export/starexec/sandbox2/tmp/tmp.4bVl6lhpgN/E---3.1_4476.p',strong_fixed_point) ).

cnf(prove_strong_fixed_point,negated_conjecture,
    apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
    file('/export/starexec/sandbox2/tmp/tmp.4bVl6lhpgN/E---3.1_4476.p',prove_strong_fixed_point) ).

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

cnf(c_0_5,axiom,
    apply(apply(k,X1),X2) = X1,
    k_definition ).

cnf(c_0_6,plain,
    apply(apply(apply(s,apply(k,X1)),X2),X3) = apply(X1,apply(X2,X3)),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,plain,
    apply(apply(apply(s,apply(s,apply(k,X1))),X2),X3) = apply(X1,apply(X3,apply(X2,X3))),
    inference(spm,[status(thm)],[c_0_4,c_0_6]) ).

cnf(c_0_8,plain,
    apply(apply(apply(s,k),X1),X2) = X2,
    inference(spm,[status(thm)],[c_0_5,c_0_4]) ).

cnf(c_0_9,plain,
    apply(apply(apply(s,apply(apply(s,X1),X2)),X3),X4) = apply(apply(apply(X1,X4),apply(X2,X4)),apply(X3,X4)),
    inference(spm,[status(thm)],[c_0_4,c_0_4]) ).

cnf(c_0_10,plain,
    apply(apply(apply(s,apply(s,apply(k,apply(k,X1)))),X2),X3) = X1,
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_11,axiom,
    strong_fixed_point = apply(apply(s,apply(k,apply(apply(apply(s,s),apply(apply(s,k),k)),apply(apply(s,s),apply(s,k))))),apply(apply(s,apply(k,s)),k)),
    strong_fixed_point ).

cnf(c_0_12,plain,
    apply(apply(apply(s,X1),apply(apply(s,k),X2)),X3) = apply(apply(X1,X3),X3),
    inference(spm,[status(thm)],[c_0_4,c_0_8]) ).

cnf(c_0_13,plain,
    apply(apply(apply(s,X1),apply(k,X2)),X3) = apply(apply(X1,X3),X2),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_14,plain,
    apply(apply(apply(s,apply(apply(s,s),X1)),X2),apply(s,apply(k,apply(k,X3)))) = X3,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    apply(apply(apply(s,apply(apply(s,s),apply(s,k))),apply(apply(s,s),apply(s,k))),apply(s,apply(k,X1))) = apply(strong_fixed_point,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_5]),c_0_6]),c_0_12]) ).

cnf(c_0_16,plain,
    apply(apply(apply(s,apply(s,X1)),X2),apply(k,X3)) = apply(apply(X1,apply(X2,apply(k,X3))),X3),
    inference(spm,[status(thm)],[c_0_4,c_0_13]) ).

cnf(c_0_17,plain,
    apply(strong_fixed_point,apply(k,X1)) = X1,
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    apply(apply(apply(s,apply(s,X1)),apply(apply(s,k),X2)),X3) = apply(apply(X1,X3),apply(X3,X3)),
    inference(spm,[status(thm)],[c_0_4,c_0_12]) ).

cnf(c_0_19,plain,
    apply(apply(apply(s,apply(s,X1)),strong_fixed_point),apply(k,X2)) = apply(apply(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    apply(apply(apply(apply(s,s),X1),X2),X3) = apply(apply(X2,X3),apply(apply(X1,X2),X3)),
    inference(spm,[status(thm)],[c_0_4,c_0_4]) ).

cnf(c_0_21,plain,
    apply(apply(apply(s,apply(s,k)),X1),X2) = apply(X1,X2),
    inference(spm,[status(thm)],[c_0_4,c_0_8]) ).

cnf(c_0_22,plain,
    apply(apply(apply(s,strong_fixed_point),X1),apply(k,X2)) = apply(X2,apply(X1,apply(k,X2))),
    inference(spm,[status(thm)],[c_0_4,c_0_17]) ).

cnf(c_0_23,plain,
    apply(apply(apply(apply(s,X1),X2),X3),apply(X4,apply(X2,X3))) = apply(apply(apply(s,apply(X1,X3)),X4),apply(X2,X3)),
    inference(spm,[status(thm)],[c_0_4,c_0_4]) ).

cnf(c_0_24,plain,
    apply(apply(apply(s,apply(s,strong_fixed_point)),apply(apply(s,k),X1)),apply(k,X2)) = apply(X2,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_5]) ).

cnf(c_0_25,plain,
    apply(apply(apply(s,X1),apply(apply(s,k),X2)),X3) = apply(apply(apply(s,apply(s,X1)),strong_fixed_point),apply(k,X3)),
    inference(spm,[status(thm)],[c_0_12,c_0_19]) ).

cnf(c_0_26,plain,
    apply(apply(apply(apply(s,s),apply(apply(s,k),X1)),X2),X3) = apply(apply(X2,X3),apply(X2,X3)),
    inference(spm,[status(thm)],[c_0_4,c_0_12]) ).

cnf(c_0_27,plain,
    apply(apply(apply(apply(s,s),apply(s,apply(s,k))),X1),X2) = apply(apply(X1,X2),apply(X1,X2)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_28,plain,
    apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,X1)) = apply(X1,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_17]) ).

cnf(c_0_29,plain,
    apply(apply(apply(apply(s,s),apply(s,k)),X1),X2) = apply(apply(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_12,c_0_4]) ).

cnf(c_0_30,plain,
    apply(apply(apply(apply(s,X1),apply(apply(s,X2),X3)),X4),apply(X5,apply(apply(X2,X4),apply(X3,X4)))) = apply(apply(apply(s,apply(X1,X4)),X5),apply(apply(X2,X4),apply(X3,X4))),
    inference(spm,[status(thm)],[c_0_23,c_0_4]) ).

cnf(c_0_31,plain,
    apply(apply(apply(s,apply(s,apply(s,strong_fixed_point))),strong_fixed_point),apply(k,apply(k,X1))) = apply(X1,X1),
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,plain,
    apply(apply(apply(apply(s,s),apply(apply(s,k),X1)),X2),X3) = apply(apply(apply(apply(s,s),apply(s,apply(s,k))),X2),X3),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,plain,
    apply(apply(apply(apply(s,s),apply(s,apply(s,k))),X1),X2) = apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,apply(X1,X2))),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,plain,
    apply(apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X1))),X2) = apply(X1,apply(X2,X2)),
    inference(spm,[status(thm)],[c_0_6,c_0_29]) ).

cnf(c_0_35,plain,
    apply(apply(apply(apply(s,s),apply(s,k)),X1),X2) = apply(apply(apply(s,apply(s,X1)),strong_fixed_point),apply(k,X2)),
    inference(spm,[status(thm)],[c_0_29,c_0_19]) ).

cnf(c_0_36,plain,
    apply(apply(X1,apply(apply(apply(s,X2),X3),X4)),apply(X5,apply(apply(X2,X4),apply(X3,X4)))) = apply(apply(apply(s,X1),X5),apply(apply(X2,X4),apply(X3,X4))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_6]),c_0_5]) ).

cnf(c_0_37,plain,
    apply(apply(apply(s,apply(s,apply(s,strong_fixed_point))),strong_fixed_point),apply(k,apply(k,X1))) = apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,X1)),
    inference(spm,[status(thm)],[c_0_28,c_0_31]) ).

cnf(c_0_38,plain,
    apply(apply(apply(apply(s,apply(s,s)),strong_fixed_point),apply(k,apply(apply(s,s),apply(s,k)))),apply(s,apply(k,X1))) = apply(strong_fixed_point,X1),
    inference(rw,[status(thm)],[c_0_15,c_0_19]) ).

cnf(c_0_39,plain,
    apply(apply(apply(apply(s,apply(s,s)),strong_fixed_point),apply(k,X1)),X2) = apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,apply(X1,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_25]),c_0_33]) ).

cnf(c_0_40,plain,
    apply(apply(apply(s,apply(s,apply(s,apply(k,X1)))),strong_fixed_point),apply(k,X2)) = apply(X1,apply(X2,X2)),
    inference(rw,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_41,plain,
    apply(apply(X1,apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,X2))),apply(X3,apply(X2,X2))) = apply(apply(apply(s,X1),X3),apply(X2,X2)),
    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(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]),c_0_13]),c_0_13]),c_0_17]),c_0_17]),c_0_13]),c_0_13]),c_0_17]) ).

cnf(c_0_42,plain,
    apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,apply(apply(apply(s,s),apply(s,k)),apply(s,apply(k,X1))))) = apply(strong_fixed_point,X1),
    inference(rw,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,plain,
    apply(apply(apply(s,apply(s,apply(s,apply(k,X1)))),strong_fixed_point),apply(k,X2)) = apply(X1,apply(apply(apply(s,strong_fixed_point),strong_fixed_point),apply(k,X2))),
    inference(spm,[status(thm)],[c_0_40,c_0_28]) ).

cnf(c_0_44,negated_conjecture,
    apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
    inference(fof_simplification,[status(thm)],[prove_strong_fixed_point]) ).

cnf(c_0_45,plain,
    apply(apply(X1,apply(strong_fixed_point,X2)),apply(X3,apply(X2,apply(strong_fixed_point,X2)))) = apply(apply(apply(s,X1),X3),apply(X2,apply(strong_fixed_point,X2))),
    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(spm,[status(thm)],[c_0_41,c_0_42]),c_0_35]),c_0_43]),c_0_42]),c_0_35]),c_0_43]),c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
    c_0_44 ).

cnf(c_0_47,plain,
    apply(X1,apply(strong_fixed_point,X1)) = apply(strong_fixed_point,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_45]),c_0_8]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : COL006-7 : TPTP v8.1.2. Released v2.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n012.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   : Fri May  3 11:31:10 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/0.47  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.4bVl6lhpgN/E---3.1_4476.p
% 131.71/17.09  # Version: 3.1.0
% 131.71/17.09  # Preprocessing class: FSSSSMSSSSSNFFN.
% 131.71/17.09  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.71/17.09  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 131.71/17.09  # Starting new_bool_3 with 300s (1) cores
% 131.71/17.09  # Starting new_bool_1 with 300s (1) cores
% 131.71/17.09  # Starting sh5l with 300s (1) cores
% 131.71/17.09  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4606 completed with status 0
% 131.71/17.09  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 131.71/17.09  # Preprocessing class: FSSSSMSSSSSNFFN.
% 131.71/17.09  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.71/17.09  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 131.71/17.09  # No SInE strategy applied
% 131.71/17.09  # Search class: FUUPS-FFSF22-DFFFFFNN
% 131.71/17.09  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 131.71/17.09  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 131.71/17.09  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 131.71/17.09  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 131.71/17.09  # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 131.71/17.09  # Starting new_bool_3 with 136s (1) cores
% 131.71/17.09  # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 4614 completed with status 0
% 131.71/17.09  # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 131.71/17.09  # Preprocessing class: FSSSSMSSSSSNFFN.
% 131.71/17.09  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 131.71/17.09  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 131.71/17.09  # No SInE strategy applied
% 131.71/17.09  # Search class: FUUPS-FFSF22-DFFFFFNN
% 131.71/17.09  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 131.71/17.09  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 131.71/17.09  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 131.71/17.09  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 131.71/17.09  # Preprocessing time       : 0.001 s
% 131.71/17.09  # Presaturation interreduction done
% 131.71/17.09  
% 131.71/17.09  # Proof found!
% 131.71/17.09  # SZS status Unsatisfiable
% 131.71/17.09  # SZS output start CNFRefutation
% See solution above
% 131.71/17.09  # Parsed axioms                        : 4
% 131.71/17.09  # Removed by relevancy pruning/SinE    : 0
% 131.71/17.09  # Initial clauses                      : 4
% 131.71/17.09  # Removed in clause preprocessing      : 0
% 131.71/17.09  # Initial clauses in saturation        : 4
% 131.71/17.09  # Processed clauses                    : 5776
% 131.71/17.09  # ...of these trivial                  : 1715
% 131.71/17.09  # ...subsumed                          : 3114
% 131.71/17.09  # ...remaining for further processing  : 947
% 131.71/17.09  # Other redundant clauses eliminated   : 0
% 131.71/17.09  # Clauses deleted for lack of memory   : 0
% 131.71/17.09  # Backward-subsumed                    : 1
% 131.71/17.09  # Backward-rewritten                   : 218
% 131.71/17.09  # Generated clauses                    : 663871
% 131.71/17.09  # ...of the previous two non-redundant : 629318
% 131.71/17.09  # ...aggressively subsumed             : 0
% 131.71/17.09  # Contextual simplify-reflections      : 0
% 131.71/17.09  # Paramodulations                      : 663871
% 131.71/17.09  # Factorizations                       : 0
% 131.71/17.09  # NegExts                              : 0
% 131.71/17.09  # Equation resolutions                 : 0
% 131.71/17.09  # Disequality decompositions           : 0
% 131.71/17.09  # Total rewrite steps                  : 454573
% 131.71/17.09  # ...of those cached                   : 310862
% 131.71/17.09  # Propositional unsat checks           : 0
% 131.71/17.09  #    Propositional check models        : 0
% 131.71/17.09  #    Propositional check unsatisfiable : 0
% 131.71/17.09  #    Propositional clauses             : 0
% 131.71/17.09  #    Propositional clauses after purity: 0
% 131.71/17.09  #    Propositional unsat core size     : 0
% 131.71/17.09  #    Propositional preprocessing time  : 0.000
% 131.71/17.09  #    Propositional encoding time       : 0.000
% 131.71/17.09  #    Propositional solver time         : 0.000
% 131.71/17.09  #    Success case prop preproc time    : 0.000
% 131.71/17.09  #    Success case prop encoding time   : 0.000
% 131.71/17.09  #    Success case prop solver time     : 0.000
% 131.71/17.09  # Current number of processed clauses  : 724
% 131.71/17.09  #    Positive orientable unit clauses  : 566
% 131.71/17.09  #    Positive unorientable unit clauses: 158
% 131.71/17.09  #    Negative unit clauses             : 0
% 131.71/17.09  #    Non-unit-clauses                  : 0
% 131.71/17.09  # Current number of unprocessed clauses: 622608
% 131.71/17.09  # ...number of literals in the above   : 622608
% 131.71/17.09  # Current number of archived formulas  : 0
% 131.71/17.09  # Current number of archived clauses   : 223
% 131.71/17.09  # Clause-clause subsumption calls (NU) : 0
% 131.71/17.09  # Rec. Clause-clause subsumption calls : 0
% 131.71/17.09  # Non-unit clause-clause subsumptions  : 0
% 131.71/17.09  # Unit Clause-clause subsumption calls : 17579
% 131.71/17.09  # Rewrite failures with RHS unbound    : 3116
% 131.71/17.09  # BW rewrite match attempts            : 208821
% 131.71/17.09  # BW rewrite match successes           : 1316
% 131.71/17.09  # Condensation attempts                : 0
% 131.71/17.09  # Condensation successes               : 0
% 131.71/17.09  # Termbank termtop insertions          : 30101783
% 131.71/17.09  # Search garbage collected termcells   : 2
% 131.71/17.09  
% 131.71/17.09  # -------------------------------------------------
% 131.71/17.09  # User time                : 15.907 s
% 131.71/17.09  # System time              : 0.438 s
% 131.71/17.09  # Total time               : 16.345 s
% 131.71/17.09  # Maximum resident set size: 1552 pages
% 131.71/17.09  
% 131.71/17.09  # -------------------------------------------------
% 131.71/17.09  # User time                : 80.187 s
% 131.71/17.09  # System time              : 1.842 s
% 131.71/17.09  # Total time               : 82.029 s
% 131.71/17.09  # Maximum resident set size: 1688 pages
% 131.71/17.09  % E---3.1 exiting
%------------------------------------------------------------------------------