↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : COL021-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:09:19 PM UTC 2026

% Result   : Unsatisfiable 0.23s 0.55s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;   5 RR)
%            Number of literals    :   10 (   9 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   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   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_fixed_point,negated_conjecture,
    X1 != apply(combinator,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).

cnf(m_definition,axiom,
    apply(m,X1) = apply(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_definition) ).

cnf(b_definition,axiom,
    apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).

cnf(c_0_3,negated_conjecture,
    X1 != apply(combinator,X1),
    inference(fof_simplification,[status(thm)],[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,negated_conjecture,
    X1 != apply(combinator,X1),
    c_0_3 ).

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

cnf(c_0_8,negated_conjecture,
    apply(m,apply(apply(b,combinator),X1)) != apply(X1,apply(apply(b,combinator),X1)),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(er,[status(thm)],[c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : COL021-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45  % Computer : n013.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Mon Sep 21 14:04:37 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52  Running first-order theorem proving
% 0.23/0.52  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.55  % Version: 3.5.1
% 0.23/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55  % Starting sh5l with 300s (1) cores
% 0.23/0.55  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 950738 completed with status 0
% 0.23/0.55  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.55  % No SInE strategy applied
% 0.23/0.55  % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.23/0.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.55  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.55  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.23/0.55  % Starting new_bool_3 with 136s (1) cores
% 0.23/0.55  % Starting new_bool_1 with 136s (1) cores
% 0.23/0.55  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 950744 completed with status 0
% 0.23/0.55  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.55  % No SInE strategy applied
% 0.23/0.55  % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.23/0.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.55  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.55  % Preprocessing time       : 0.002 s
% 0.23/0.55  
% 0.23/0.55  % Proof found!
% 0.23/0.55  % SZS status Unsatisfiable
% 0.23/0.55  % SZS output start CNFRefutation
% See solution above
% 0.23/0.55  % Parsed axioms                        : 4
% 0.23/0.55  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.55  % Initial clauses                      : 4
% 0.23/0.55  % Removed in clause preprocessing      : 0
% 0.23/0.55  % Initial clauses in saturation        : 4
% 0.23/0.55  % Processed clauses                    : 13
% 0.23/0.55  % ...of these trivial                  : 0
% 0.23/0.55  % ...subsumed                          : 0
% 0.23/0.55  % ...remaining for further processing  : 13
% 0.23/0.55  % Other redundant clauses eliminated   : 0
% 0.23/0.55  % Clauses deleted for lack of memory   : 0
% 0.23/0.55  % Backward-subsumed                    : 0
% 0.23/0.55  % Backward-rewritten                   : 0
% 0.23/0.55  % Generated clauses                    : 86
% 0.23/0.55  % ...of the previous two non-redundant : 73
% 0.23/0.55  % ...aggressively subsumed             : 0
% 0.23/0.55  % Contextual simplify-reflections      : 0
% 0.23/0.55  % Paramodulations                      : 85
% 0.23/0.55  % Factorizations                       : 0
% 0.23/0.55  % NegExts                              : 0
% 0.23/0.55  % Equation resolutions                 : 1
% 0.23/0.55  % Disequality decompositions           : 0
% 0.23/0.55  % Total rewrite steps                  : 23
% 0.23/0.55  % ...of those cached                   : 3
% 0.23/0.55  % Propositional unsat checks           : 0
% 0.23/0.55  %    Propositional check models        : 0
% 0.23/0.55  %    Propositional check unsatisfiable : 0
% 0.23/0.55  %    Propositional clauses             : 0
% 0.23/0.55  %    Propositional clauses after purity: 0
% 0.23/0.55  %    Propositional unsat core size     : 0
% 0.23/0.55  %    Propositional preprocessing time  : 0.000
% 0.23/0.55  %    Propositional encoding time       : 0.000
% 0.23/0.55  %    Propositional solver time         : 0.000
% 0.23/0.55  %    Success case prop preproc time    : 0.000
% 0.23/0.55  %    Success case prop encoding time   : 0.000
% 0.23/0.55  %    Success case prop solver time     : 0.000
% 0.23/0.55  % Current number of processed clauses  : 13
% 0.23/0.55  %    Positive orientable unit clauses  : 8
% 0.23/0.55  %    Positive unorientable unit clauses: 2
% 0.23/0.55  %    Negative unit clauses             : 3
% 0.23/0.55  %    Non-unit-clauses                  : 0
% 0.23/0.55  % Current number of unprocessed clauses: 64
% 0.23/0.55  % ...number of literals in the above   : 64
% 0.23/0.55  % Current number of archived formulas  : 0
% 0.23/0.55  % Current number of archived clauses   : 0
% 0.23/0.55  % Clause-clause subsumption calls (NU) : 0
% 0.23/0.55  % Rec. Clause-clause subsumption calls : 0
% 0.23/0.55  % Non-unit clause-clause subsumptions  : 0
% 0.23/0.55  % Unit Clause-clause subsumption calls : 3
% 0.23/0.55  % Rewrite failures with RHS unbound    : 0
% 0.23/0.55  % BW rewrite match attempts            : 20
% 0.23/0.55  % BW rewrite match successes           : 0
% 0.23/0.55  % Condensation attempts                : 0
% 0.23/0.55  % Condensation successes               : 0
% 0.23/0.55  % Termbank termtop insertions          : 1700
% 0.23/0.55  % Search garbage collected termcells   : 2
% 0.23/0.55  
% 0.23/0.55  % -------------------------------------------------
% 0.23/0.55  % User time                : 0.006 s
% 0.23/0.55  % System time              : 0.004 s
% 0.23/0.55  % Total time               : 0.010 s
% 0.23/0.55  % Maximum resident set size: 3628 pages
% 0.23/0.55  
% 0.23/0.55  % -------------------------------------------------
% 0.23/0.55  % User time                : 0.027 s
% 0.23/0.55  % System time              : 0.018 s
% 0.23/0.55  % Total time               : 0.045 s
% 0.23/0.55  % Maximum resident set size: 4864 pages
% 0.23/0.55  % E exiting
%------------------------------------------------------------------------------