↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n001.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:22:53 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
    ( ~ defined(X2)
    | ~ defined(X1)
    | less_or_equal(X2,X1)
    | less_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

cnf(not_less_or_equal_2,negated_conjecture,
    ~ less_or_equal(a,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_2) ).

cnf(c_0_3,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | less_or_equal(X2,X1)
    | less_or_equal(X1,X2) ),
    inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).

cnf(c_0_4,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | less_or_equal(X2,X1)
    | less_or_equal(X1,X2) ),
    c_0_3 ).

cnf(c_0_5,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_6,negated_conjecture,
    ~ less_or_equal(a,a),
    inference(fof_simplification,[status(thm)],[not_less_or_equal_2]) ).

cnf(c_0_7,hypothesis,
    ( ~ defined(X1)
    | less_or_equal(X1,a)
    | less_or_equal(a,X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ~ less_or_equal(a,a),
    c_0_6 ).

cnf(c_0_9,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : FLD056-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.47  % Computer : n001.cluster.edu
% 0.20/5.47  % Model    : x86_64 x86_64
% 0.20/5.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.47  % Memory   : 8046.5625MB
% 0.20/5.47  % OS       : Linux 6.8.0-71-generic
% 0.20/5.47  % CPULimit : 300
% 0.20/5.47  % WCLimit  : 300
% 0.20/5.47  % DateTime : Mon Sep 21 15:48:05 UTC 2026
% 0.20/5.47  % CPUTime  : 
% 0.20/5.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.54  Running first-order theorem proving
% 0.24/5.54  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.24/5.58  % Version: 3.5.1
% 0.24/5.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.58  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.58  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.58  % Starting sh5l with 300s (1) cores
% 0.24/5.58  % new_bool_1 with pid 3494974 completed with status 0
% 0.24/5.58  % Result found by new_bool_1
% 0.24/5.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.58  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.58  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/5.58  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/5.58  % Search class: FGUNF-FFMF22-SFFFFFNN
% 0.24/5.58  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.58  % Starting SubtermCWHack with 31s (1) cores
% 0.24/5.58  % SubtermCWHack with pid 3494976 completed with status 0
% 0.24/5.58  % Result found by SubtermCWHack
% 0.24/5.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.58  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.58  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/5.58  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/5.58  % Search class: FGUNF-FFMF22-SFFFFFNN
% 0.24/5.58  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.58  % Starting SubtermCWHack with 31s (1) cores
% 0.24/5.58  % Preprocessing time       : 0.002 s
% 0.24/5.58  
% 0.24/5.58  % Proof found!
% 0.24/5.58  % SZS status Unsatisfiable
% 0.24/5.58  % SZS output start CNFRefutation
% See solution above
% 0.24/5.58  % Parsed axioms                        : 29
% 0.24/5.58  % Removed by relevancy pruning/SinE    : 7
% 0.24/5.58  % Initial clauses                      : 22
% 0.24/5.58  % Removed in clause preprocessing      : 0
% 0.24/5.58  % Initial clauses in saturation        : 22
% 0.24/5.58  % Processed clauses                    : 13
% 0.24/5.58  % ...of these trivial                  : 0
% 0.24/5.58  % ...subsumed                          : 2
% 0.24/5.58  % ...remaining for further processing  : 11
% 0.24/5.58  % Other redundant clauses eliminated   : 0
% 0.24/5.58  % Clauses deleted for lack of memory   : 0
% 0.24/5.58  % Backward-subsumed                    : 0
% 0.24/5.58  % Backward-rewritten                   : 0
% 0.24/5.58  % Generated clauses                    : 11
% 0.24/5.58  % ...of the previous two non-redundant : 7
% 0.24/5.58  % ...aggressively subsumed             : 0
% 0.24/5.58  % Contextual simplify-reflections      : 0
% 0.24/5.58  % Paramodulations                      : 11
% 0.24/5.58  % Factorizations                       : 0
% 0.24/5.58  % NegExts                              : 0
% 0.24/5.58  % Equation resolutions                 : 0
% 0.24/5.58  % Disequality decompositions           : 0
% 0.24/5.58  % Total rewrite steps                  : 0
% 0.24/5.58  % ...of those cached                   : 0
% 0.24/5.58  % Propositional unsat checks           : 0
% 0.24/5.58  %    Propositional check models        : 0
% 0.24/5.58  %    Propositional check unsatisfiable : 0
% 0.24/5.58  %    Propositional clauses             : 0
% 0.24/5.58  %    Propositional clauses after purity: 0
% 0.24/5.58  %    Propositional unsat core size     : 0
% 0.24/5.58  %    Propositional preprocessing time  : 0.000
% 0.24/5.58  %    Propositional encoding time       : 0.000
% 0.24/5.58  %    Propositional solver time         : 0.000
% 0.24/5.58  %    Success case prop preproc time    : 0.000
% 0.24/5.58  %    Success case prop encoding time   : 0.000
% 0.24/5.58  %    Success case prop solver time     : 0.000
% 0.24/5.58  % Current number of processed clauses  : 11
% 0.24/5.58  %    Positive orientable unit clauses  : 2
% 0.24/5.58  %    Positive unorientable unit clauses: 0
% 0.24/5.58  %    Negative unit clauses             : 1
% 0.24/5.58  %    Non-unit-clauses                  : 8
% 0.24/5.58  % Current number of unprocessed clauses: 16
% 0.24/5.58  % ...number of literals in the above   : 55
% 0.24/5.58  % Current number of archived formulas  : 0
% 0.24/5.58  % Current number of archived clauses   : 0
% 0.24/5.58  % Clause-clause subsumption calls (NU) : 8
% 0.24/5.58  % Rec. Clause-clause subsumption calls : 8
% 0.24/5.58  % Non-unit clause-clause subsumptions  : 2
% 0.24/5.59  % Unit Clause-clause subsumption calls : 0
% 0.24/5.59  % Rewrite failures with RHS unbound    : 0
% 0.24/5.59  % BW rewrite match attempts            : 0
% 0.24/5.59  % BW rewrite match successes           : 0
% 0.24/5.59  % Condensation attempts                : 0
% 0.24/5.59  % Condensation successes               : 0
% 0.24/5.59  % Termbank termtop insertions          : 919
% 0.24/5.59  % Search garbage collected termcells   : 93
% 0.24/5.59  
% 0.24/5.59  % -------------------------------------------------
% 0.24/5.59  % User time                : 0.006 s
% 0.24/5.59  % System time              : 0.002 s
% 0.24/5.59  % Total time               : 0.007 s
% 0.24/5.59  % Maximum resident set size: 3916 pages
% 0.24/5.59  
% 0.24/5.59  % -------------------------------------------------
% 0.24/5.59  % User time                : 0.008 s
% 0.24/5.59  % System time              : 0.008 s
% 0.24/5.59  % Total time               : 0.016 s
% 0.24/5.59  % Maximum resident set size: 4864 pages
% 0.24/5.59  % E exiting
%------------------------------------------------------------------------------