TSTP Solution File: COL064-11 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : COL064-11 : TPTP v8.1.2. Bugfixed v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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:51 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_v_combinator,negated_conjecture,
    apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),b)),t)),t),x),y),z) != apply(apply(z,x),y),
    file('/export/starexec/sandbox2/tmp/tmp.mXUfcQbH6v/E---3.1_2892.p',prove_v_combinator) ).

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

cnf(t_definition,axiom,
    apply(apply(t,X1),X2) = apply(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.mXUfcQbH6v/E---3.1_2892.p',t_definition) ).

cnf(c_0_3,negated_conjecture,
    apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),b)),t)),t),x),y),z) != apply(apply(z,x),y),
    inference(fof_simplification,[status(thm)],[prove_v_combinator]) ).

cnf(c_0_4,negated_conjecture,
    apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),b)),t)),t),x),y),z) != apply(apply(z,x),y),
    c_0_3 ).

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

cnf(c_0_6,axiom,
    apply(apply(t,X1),X2) = apply(X2,X1),
    t_definition ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[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_4,c_0_5]),c_0_5]),c_0_5]),c_0_6]),c_0_5]),c_0_5]),c_0_6]),c_0_5]),c_0_6]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : COL064-11 : TPTP v8.1.2. Bugfixed v1.2.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n011.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 11:43:19 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/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.mXUfcQbH6v/E---3.1_2892.p
% 0.20/0.49  # Version: 3.1.0
% 0.20/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49  # Starting sh5l with 300s (1) cores
% 0.20/0.49  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3037 completed with status 0
% 0.20/0.49  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: FUUPS-FFSF22-DFFFFFNN
% 0.20/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.49  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.49  # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.49  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49  # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 3044 completed with status 0
% 0.20/0.49  # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.20/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: FUUPS-FFSF22-DFFFFFNN
% 0.20/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.20/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.49  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.49  # Preprocessing time       : 0.001 s
% 0.20/0.49  # Presaturation interreduction done
% 0.20/0.49  
% 0.20/0.49  # Proof found!
% 0.20/0.49  # SZS status Unsatisfiable
% 0.20/0.49  # SZS output start CNFRefutation
% See solution above
% 0.20/0.49  # Parsed axioms                        : 3
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.49  # Initial clauses                      : 3
% 0.20/0.49  # Removed in clause preprocessing      : 0
% 0.20/0.49  # Initial clauses in saturation        : 3
% 0.20/0.49  # Processed clauses                    : 3
% 0.20/0.49  # ...of these trivial                  : 0
% 0.20/0.49  # ...subsumed                          : 0
% 0.20/0.49  # ...remaining for further processing  : 2
% 0.20/0.49  # Other redundant clauses eliminated   : 0
% 0.20/0.49  # Clauses deleted for lack of memory   : 0
% 0.20/0.49  # Backward-subsumed                    : 0
% 0.20/0.49  # Backward-rewritten                   : 0
% 0.20/0.49  # Generated clauses                    : 0
% 0.20/0.49  # ...of the previous two non-redundant : 0
% 0.20/0.49  # ...aggressively subsumed             : 0
% 0.20/0.49  # Contextual simplify-reflections      : 0
% 0.20/0.49  # Paramodulations                      : 0
% 0.20/0.49  # Factorizations                       : 0
% 0.20/0.49  # NegExts                              : 0
% 0.20/0.49  # Equation resolutions                 : 0
% 0.20/0.49  # Disequality decompositions           : 0
% 0.20/0.49  # Total rewrite steps                  : 10
% 0.20/0.49  # ...of those cached                   : 0
% 0.20/0.49  # Propositional unsat checks           : 0
% 0.20/0.49  #    Propositional check models        : 0
% 0.20/0.49  #    Propositional check unsatisfiable : 0
% 0.20/0.49  #    Propositional clauses             : 0
% 0.20/0.49  #    Propositional clauses after purity: 0
% 0.20/0.49  #    Propositional unsat core size     : 0
% 0.20/0.49  #    Propositional preprocessing time  : 0.000
% 0.20/0.49  #    Propositional encoding time       : 0.000
% 0.20/0.49  #    Propositional solver time         : 0.000
% 0.20/0.49  #    Success case prop preproc time    : 0.000
% 0.20/0.49  #    Success case prop encoding time   : 0.000
% 0.20/0.49  #    Success case prop solver time     : 0.000
% 0.20/0.49  # Current number of processed clauses  : 2
% 0.20/0.49  #    Positive orientable unit clauses  : 2
% 0.20/0.49  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 0
% 0.20/0.50  #    Non-unit-clauses                  : 0
% 0.20/0.50  # Current number of unprocessed clauses: 0
% 0.20/0.50  # ...number of literals in the above   : 0
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 0
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.50  # Unit Clause-clause subsumption calls : 0
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 0
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 126
% 0.20/0.50  # Search garbage collected termcells   : 2
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.000 s
% 0.20/0.50  # Total time               : 0.004 s
% 0.20/0.50  # Maximum resident set size: 1552 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.011 s
% 0.20/0.50  # System time              : 0.005 s
% 0.20/0.50  # Total time               : 0.016 s
% 0.20/0.50  # Maximum resident set size: 1692 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------