TSTP Solution File: COL001-1 by E-SAT---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.2.0
% Problem  : COL001-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d SAT

% 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 : Mon Jun 24 04:46:09 EDT 2024

% Result   : Unsatisfiable 1.03s 0.60s
% Output   : CNFRefutation 1.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   6 RR)
%            Number of literals    :   13 (  12 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   4 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.yRsn6r06aY/E---3.1_15142.p',s_definition) ).

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

cnf(prove_fixed_point,negated_conjecture,
    X1 != apply(combinator,X1),
    file('/export/starexec/sandbox2/tmp/tmp.yRsn6r06aY/E---3.1_15142.p',prove_fixed_point) ).

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

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

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

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_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    X1 != apply(combinator,X1),
    c_0_5 ).

cnf(c_0_8,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_3,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    apply(apply(apply(s,apply(s,apply(k,combinator))),X1),X2) != apply(X2,apply(X1,X2)),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

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

cnf(c_0_11,negated_conjecture,
    apply(apply(apply(s,apply(s,apply(k,combinator))),apply(apply(s,k),X1)),X2) != apply(X2,X2),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(er,[status(thm)],[c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : COL001-1 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.12  % Command    : run_E %s %d SAT
% 0.13/0.34  % Computer : n015.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   : Tue Jun 18 16:30:24 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  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.yRsn6r06aY/E---3.1_15142.p
% 1.03/0.60  # Version: 3.2.0
% 1.03/0.60  # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.03/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.60  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.03/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.03/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.03/0.60  # Starting sh5l with 300s (1) cores
% 1.03/0.60  # sh5l with pid 15223 completed with status 0
% 1.03/0.60  # Result found by sh5l
% 1.03/0.60  # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.03/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.60  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.03/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.03/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.03/0.60  # Starting sh5l with 300s (1) cores
% 1.03/0.60  # SinE strategy is gf500_gu_R04_F100_L20000
% 1.03/0.60  # Search class: FUUPS-FFSF22-MFFFFFNN
% 1.03/0.60  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.60  # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 1.03/0.60  # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 15231 completed with status 0
% 1.03/0.60  # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 1.03/0.60  # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.03/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.60  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.03/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.03/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.03/0.60  # Starting sh5l with 300s (1) cores
% 1.03/0.60  # SinE strategy is gf500_gu_R04_F100_L20000
% 1.03/0.60  # Search class: FUUPS-FFSF22-MFFFFFNN
% 1.03/0.60  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.60  # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 1.03/0.60  # Preprocessing time       : 0.001 s
% 1.03/0.60  
% 1.03/0.60  # Proof found!
% 1.03/0.60  # SZS status Unsatisfiable
% 1.03/0.60  # SZS output start CNFRefutation
% See solution above
% 1.03/0.60  # Parsed axioms                        : 3
% 1.03/0.60  # Removed by relevancy pruning/SinE    : 0
% 1.03/0.60  # Initial clauses                      : 3
% 1.03/0.60  # Removed in clause preprocessing      : 0
% 1.03/0.60  # Initial clauses in saturation        : 3
% 1.03/0.60  # Processed clauses                    : 214
% 1.03/0.60  # ...of these trivial                  : 20
% 1.03/0.60  # ...subsumed                          : 123
% 1.03/0.60  # ...remaining for further processing  : 71
% 1.03/0.60  # Other redundant clauses eliminated   : 0
% 1.03/0.60  # Clauses deleted for lack of memory   : 0
% 1.03/0.60  # Backward-subsumed                    : 1
% 1.03/0.60  # Backward-rewritten                   : 7
% 1.03/0.60  # Generated clauses                    : 5417
% 1.03/0.60  # ...of the previous two non-redundant : 5062
% 1.03/0.60  # ...aggressively subsumed             : 0
% 1.03/0.60  # Contextual simplify-reflections      : 0
% 1.03/0.60  # Paramodulations                      : 5416
% 1.03/0.60  # Factorizations                       : 0
% 1.03/0.60  # NegExts                              : 0
% 1.03/0.60  # Equation resolutions                 : 1
% 1.03/0.60  # Disequality decompositions           : 0
% 1.03/0.60  # Total rewrite steps                  : 1596
% 1.03/0.60  # ...of those cached                   : 744
% 1.03/0.60  # Propositional unsat checks           : 0
% 1.03/0.60  #    Propositional check models        : 0
% 1.03/0.60  #    Propositional check unsatisfiable : 0
% 1.03/0.60  #    Propositional clauses             : 0
% 1.03/0.60  #    Propositional clauses after purity: 0
% 1.03/0.60  #    Propositional unsat core size     : 0
% 1.03/0.60  #    Propositional preprocessing time  : 0.000
% 1.03/0.60  #    Propositional encoding time       : 0.000
% 1.03/0.60  #    Propositional solver time         : 0.000
% 1.03/0.60  #    Success case prop preproc time    : 0.000
% 1.03/0.60  #    Success case prop encoding time   : 0.000
% 1.03/0.60  #    Success case prop solver time     : 0.000
% 1.03/0.60  # Current number of processed clauses  : 63
% 1.03/0.60  #    Positive orientable unit clauses  : 42
% 1.03/0.60  #    Positive unorientable unit clauses: 13
% 1.03/0.60  #    Negative unit clauses             : 8
% 1.03/0.60  #    Non-unit-clauses                  : 0
% 1.03/0.60  # Current number of unprocessed clauses: 4844
% 1.03/0.60  # ...number of literals in the above   : 4844
% 1.03/0.60  # Current number of archived formulas  : 0
% 1.03/0.60  # Current number of archived clauses   : 8
% 1.03/0.60  # Clause-clause subsumption calls (NU) : 0
% 1.03/0.60  # Rec. Clause-clause subsumption calls : 0
% 1.03/0.60  # Non-unit clause-clause subsumptions  : 0
% 1.03/0.60  # Unit Clause-clause subsumption calls : 57
% 1.03/0.60  # Rewrite failures with RHS unbound    : 50
% 1.03/0.60  # BW rewrite match attempts            : 1354
% 1.03/0.60  # BW rewrite match successes           : 31
% 1.03/0.60  # Condensation attempts                : 0
% 1.03/0.60  # Condensation successes               : 0
% 1.03/0.60  # Termbank termtop insertions          : 150366
% 1.03/0.60  # Search garbage collected termcells   : 2
% 1.03/0.60  
% 1.03/0.60  # -------------------------------------------------
% 1.03/0.60  # User time                : 0.098 s
% 1.03/0.60  # System time              : 0.006 s
% 1.03/0.60  # Total time               : 0.105 s
% 1.03/0.60  # Maximum resident set size: 1616 pages
% 1.03/0.60  
% 1.03/0.60  # -------------------------------------------------
% 1.03/0.60  # User time                : 0.100 s
% 1.03/0.60  # System time              : 0.008 s
% 1.03/0.60  # Total time               : 0.108 s
% 1.03/0.60  # Maximum resident set size: 1692 pages
% 1.03/0.60  % E---3.1 exiting
% 1.03/0.60  % E exiting
%------------------------------------------------------------------------------