↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n008.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:16:31 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(query172_1,negated_conjecture,
    ifeq3(genls(c_tptpcol_16_130924,c_tptpcol_15_130923),true,a,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query172_1) ).

cnf(ax2_4304,axiom,
    genls(c_tptpcol_16_130924,c_tptpcol_15_130923) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_4304) ).

cnf(ifeq_axiom_001,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).

cnf(c_0_4,negated_conjecture,
    a != b,
    inference(fof_simplification,[status(thm)],[goal]) ).

cnf(c_0_5,negated_conjecture,
    ifeq3(genls(c_tptpcol_16_130924,c_tptpcol_15_130923),true,a,b) = b,
    query172_1 ).

cnf(c_0_6,axiom,
    genls(c_tptpcol_16_130924,c_tptpcol_15_130923) = true,
    ax2_4304 ).

cnf(c_0_7,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    ifeq_axiom_001 ).

cnf(c_0_8,negated_conjecture,
    a != b,
    c_0_4 ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR072-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n008.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 14:46:25 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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.30/0.60  % Version: 3.5.1
% 0.30/0.60  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.30/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.60  % Starting new_bool_3 with 900s (3) cores
% 0.30/0.60  % Starting new_bool_1 with 900s (3) cores
% 0.30/0.60  % Starting sh5l with 300s (1) cores
% 0.30/0.60  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.30/0.60  % new_bool_1 with pid 1236983 completed with status 0
% 0.30/0.60  % Result found by new_bool_1
% 0.30/0.60  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.30/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.60  % Starting new_bool_3 with 900s (3) cores
% 0.30/0.60  % Starting new_bool_1 with 900s (3) cores
% 0.30/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.60  % Search class: FUUPM-FFMM31-MFFFFFNN
% 0.30/0.60  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.30/0.60  % Starting SubtermCWHack with 91s (1) cores
% 0.30/0.60  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 541s (1) cores
% 0.30/0.60  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 0.30/0.60  % SubtermCWHack with pid 1236986 completed with status 0
% 0.30/0.60  % Result found by SubtermCWHack
% 0.30/0.60  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.30/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.60  % Starting new_bool_3 with 900s (3) cores
% 0.30/0.60  % Starting new_bool_1 with 900s (3) cores
% 0.30/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.60  % Search class: FUUPM-FFMM31-MFFFFFNN
% 0.30/0.60  % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.30/0.60  % Starting SubtermCWHack with 91s (1) cores
% 0.30/0.60  % Preprocessing time       : 0.004 s
% 0.30/0.60  
% 0.30/0.60  % Proof found!
% 0.30/0.60  % SZS status Unsatisfiable
% 0.30/0.60  % SZS output start CNFRefutation
% See solution above
% 0.30/0.60  % Parsed axioms                        : 8012
% 0.30/0.60  % Removed by relevancy pruning/SinE    : 7977
% 0.30/0.60  % Initial clauses                      : 35
% 0.30/0.60  % Removed in clause preprocessing      : 0
% 0.30/0.60  % Initial clauses in saturation        : 35
% 0.30/0.60  % Processed clauses                    : 16
% 0.30/0.60  % ...of these trivial                  : 4
% 0.30/0.60  % ...subsumed                          : 0
% 0.30/0.60  % ...remaining for further processing  : 11
% 0.30/0.60  % Other redundant clauses eliminated   : 0
% 0.30/0.60  % Clauses deleted for lack of memory   : 0
% 0.30/0.60  % Backward-subsumed                    : 0
% 0.30/0.60  % Backward-rewritten                   : 0
% 0.30/0.60  % Generated clauses                    : 0
% 0.30/0.60  % ...of the previous two non-redundant : 0
% 0.30/0.60  % ...aggressively subsumed             : 0
% 0.30/0.60  % Contextual simplify-reflections      : 0
% 0.30/0.60  % Paramodulations                      : 0
% 0.30/0.60  % Factorizations                       : 0
% 0.30/0.60  % NegExts                              : 0
% 0.30/0.60  % Equation resolutions                 : 0
% 0.30/0.60  % Disequality decompositions           : 0
% 0.30/0.60  % Total rewrite steps                  : 6
% 0.30/0.60  % ...of those cached                   : 1
% 0.30/0.60  % Propositional unsat checks           : 0
% 0.30/0.60  %    Propositional check models        : 0
% 0.30/0.60  %    Propositional check unsatisfiable : 0
% 0.30/0.60  %    Propositional clauses             : 0
% 0.30/0.60  %    Propositional clauses after purity: 0
% 0.30/0.60  %    Propositional unsat core size     : 0
% 0.30/0.60  %    Propositional preprocessing time  : 0.000
% 0.30/0.60  %    Propositional encoding time       : 0.000
% 0.30/0.60  %    Propositional solver time         : 0.000
% 0.30/0.60  %    Success case prop preproc time    : 0.000
% 0.30/0.60  %    Success case prop encoding time   : 0.000
% 0.30/0.60  %    Success case prop solver time     : 0.000
% 0.30/0.60  % Current number of processed clauses  : 11
% 0.30/0.60  %    Positive orientable unit clauses  : 10
% 0.30/0.60  %    Positive unorientable unit clauses: 0
% 0.30/0.60  %    Negative unit clauses             : 1
% 0.30/0.60  %    Non-unit-clauses                  : 0
% 0.30/0.60  % Current number of unprocessed clauses: 19
% 0.30/0.60  % ...number of literals in the above   : 19
% 0.30/0.60  % Current number of archived formulas  : 0
% 0.30/0.60  % Current number of archived clauses   : 0
% 0.30/0.60  % Clause-clause subsumption calls (NU) : 0
% 0.30/0.60  % Rec. Clause-clause subsumption calls : 0
% 0.30/0.60  % Non-unit clause-clause subsumptions  : 0
% 0.30/0.60  % Unit Clause-clause subsumption calls : 0
% 0.30/0.60  % Rewrite failures with RHS unbound    : 0
% 0.30/0.60  % BW rewrite match attempts            : 0
% 0.30/0.60  % BW rewrite match successes           : 0
% 0.30/0.60  % Condensation attempts                : 0
% 0.30/0.60  % Condensation successes               : 0
% 0.30/0.60  % Termbank termtop insertions          : 58496
% 0.30/0.60  % Search garbage collected termcells   : 23377
% 0.30/0.60  
% 0.30/0.60  % -------------------------------------------------
% 0.30/0.60  % User time                : 0.019 s
% 0.30/0.60  % System time              : 0.018 s
% 0.30/0.60  % Total time               : 0.037 s
% 0.30/0.60  % Maximum resident set size: 19204 pages
% 0.30/0.60  
% 0.30/0.60  % -------------------------------------------------
% 0.30/0.60  % User time                : 0.150 s
% 0.30/0.60  % System time              : 0.038 s
% 0.30/0.60  % Total time               : 0.188 s
% 0.30/0.60  % Maximum resident set size: 10496 pages
% 0.30/0.60  % E exiting
%------------------------------------------------------------------------------