↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n018.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 03:48:04 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(sos_02,axiom,
    ( ~ le(max(X1,X2),X3)
    | le(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).

cnf(sos_05,axiom,
    ( ~ le(s(X6),X7)
    | ~ le(s(X5),X6)
    | ~ le(s(X4),X5)
    | ~ le(s(X3),X4)
    | ~ le(s(X2),X3)
    | ~ le(s(X1),X2)
    | ~ eq(f(X7),a0)
    | ~ eq(f(X6),a0)
    | ~ eq(f(X5),a0)
    | ~ eq(f(X4),a0)
    | ~ eq(f(X3),a0)
    | ~ eq(f(X2),a0)
    | ~ eq(f(X1),a0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).

cnf(sos_03,axiom,
    ( ~ le(max(X1,X2),X3)
    | le(X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).

cnf(sos_01,axiom,
    le(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).

cnf(sos_04,axiom,
    eq(f(X1),a0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).

cnf(c_0_5,plain,
    ( ~ le(max(X1,X2),X3)
    | le(X1,X3) ),
    inference(fof_simplification,[status(thm)],[sos_02]) ).

cnf(c_0_6,plain,
    ( ~ le(s(X6),X7)
    | ~ le(s(X5),X6)
    | ~ le(s(X4),X5)
    | ~ le(s(X3),X4)
    | ~ le(s(X2),X3)
    | ~ le(s(X1),X2)
    | ~ eq(f(X7),a0)
    | ~ eq(f(X6),a0)
    | ~ eq(f(X5),a0)
    | ~ eq(f(X4),a0)
    | ~ eq(f(X3),a0)
    | ~ eq(f(X2),a0)
    | ~ eq(f(X1),a0) ),
    inference(fof_simplification,[status(thm)],[sos_05]) ).

cnf(c_0_7,plain,
    ( ~ le(max(X1,X2),X3)
    | le(X2,X3) ),
    inference(fof_simplification,[status(thm)],[sos_03]) ).

cnf(c_0_8,plain,
    ( ~ le(max(X1,X2),X3)
    | le(X1,X3) ),
    c_0_5 ).

cnf(c_0_9,axiom,
    le(X1,X1),
    sos_01 ).

cnf(c_0_10,plain,
    ( ~ le(s(X6),X7)
    | ~ le(s(X5),X6)
    | ~ le(s(X4),X5)
    | ~ le(s(X3),X4)
    | ~ le(s(X2),X3)
    | ~ le(s(X1),X2)
    | ~ eq(f(X7),a0)
    | ~ eq(f(X6),a0)
    | ~ eq(f(X5),a0)
    | ~ eq(f(X4),a0)
    | ~ eq(f(X3),a0)
    | ~ eq(f(X2),a0)
    | ~ eq(f(X1),a0) ),
    c_0_6 ).

cnf(c_0_11,axiom,
    eq(f(X1),a0),
    sos_04 ).

cnf(c_0_12,plain,
    ( ~ le(max(X1,X2),X3)
    | le(X2,X3) ),
    c_0_7 ).

cnf(c_0_13,plain,
    le(X1,max(X1,X2)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    ( ~ le(s(X7),X6)
    | ~ le(s(X6),X5)
    | ~ le(s(X5),X4)
    | ~ le(s(X4),X3)
    | ~ le(s(X3),X1)
    | ~ le(s(X1),X2) ),
    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)],[c_0_10,c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11])]) ).

cnf(c_0_15,plain,
    le(X1,max(max(X2,X1),X3)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    ( ~ le(s(X6),X5)
    | ~ le(s(X5),X4)
    | ~ le(s(X4),X3)
    | ~ le(s(X3),X1)
    | ~ le(s(X1),X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,plain,
    ( ~ le(s(X5),X4)
    | ~ le(s(X4),X3)
    | ~ le(s(X3),X1)
    | ~ le(s(X1),X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_18,plain,
    ( ~ le(s(X4),X3)
    | ~ le(s(X3),X1)
    | ~ le(s(X1),X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_19,plain,
    ( ~ le(s(X3),X1)
    | ~ le(s(X1),X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_20,plain,
    ~ le(s(X1),X2),
    inference(spm,[status(thm)],[c_0_19,c_0_15]) ).

cnf(c_0_21,plain,
    $false,
    inference(spm,[status(thm)],[c_0_20,c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO612-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48  % Computer : n018.cluster.edu
% 0.19/0.48  % Model    : x86_64 x86_64
% 0.19/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48  % Memory   : 8046.5625MB
% 0.19/0.48  % OS       : Linux 6.8.0-71-generic
% 0.19/0.48  % CPULimit : 300
% 0.19/0.48  % WCLimit  : 300
% 0.19/0.49  % DateTime : Mon Sep 21 12:06:13 UTC 2026
% 0.19/0.49  % CPUTime  : 
% 0.19/0.49  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.59  Running first-order theorem proving
% 0.24/0.59  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.24/0.64  % Version: 3.5.1
% 0.24/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.64  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64  % Starting sh5l with 300s (1) cores
% 0.24/0.64  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1835577 completed with status 0
% 0.24/0.64  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.64  % No SInE strategy applied
% 0.24/0.64  % Search class: FHHNS-FFSF21-SFFFFFNN
% 0.24/0.64  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.64  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.64  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.64  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.64  % Starting new_bool_1 with 136s (1) cores
% 0.24/0.64  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1835582 completed with status 0
% 0.24/0.64  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.64  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.64  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.64  % No SInE strategy applied
% 0.24/0.64  % Search class: FHHNS-FFSF21-SFFFFFNN
% 0.24/0.64  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.64  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.64  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.64  % Preprocessing time       : 0.002 s
% 0.24/0.64  % Presaturation interreduction done
% 0.24/0.64  
% 0.24/0.64  % Proof found!
% 0.24/0.64  % SZS status Unsatisfiable
% 0.24/0.64  % SZS output start CNFRefutation
% See solution above
% 0.24/0.64  % Parsed axioms                        : 5
% 0.24/0.64  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.64  % Initial clauses                      : 5
% 0.24/0.64  % Removed in clause preprocessing      : 0
% 0.24/0.64  % Initial clauses in saturation        : 5
% 0.24/0.64  % Processed clauses                    : 23
% 0.24/0.64  % ...of these trivial                  : 0
% 0.24/0.64  % ...subsumed                          : 0
% 0.24/0.64  % ...remaining for further processing  : 23
% 0.24/0.64  % Other redundant clauses eliminated   : 0
% 0.24/0.64  % Clauses deleted for lack of memory   : 0
% 0.24/0.64  % Backward-subsumed                    : 5
% 0.24/0.64  % Backward-rewritten                   : 0
% 0.24/0.64  % Generated clauses                    : 72
% 0.24/0.64  % ...of the previous two non-redundant : 63
% 0.24/0.64  % ...aggressively subsumed             : 0
% 0.24/0.64  % Contextual simplify-reflections      : 0
% 0.24/0.64  % Paramodulations                      : 72
% 0.24/0.64  % Factorizations                       : 0
% 0.24/0.64  % NegExts                              : 0
% 0.24/0.64  % Equation resolutions                 : 0
% 0.24/0.64  % Disequality decompositions           : 0
% 0.24/0.64  % Total rewrite steps                  : 7
% 0.24/0.64  % ...of those cached                   : 0
% 0.24/0.64  % Propositional unsat checks           : 0
% 0.24/0.64  %    Propositional check models        : 0
% 0.24/0.64  %    Propositional check unsatisfiable : 0
% 0.24/0.64  %    Propositional clauses             : 0
% 0.24/0.64  %    Propositional clauses after purity: 0
% 0.24/0.64  %    Propositional unsat core size     : 0
% 0.24/0.64  %    Propositional preprocessing time  : 0.000
% 0.24/0.64  %    Propositional encoding time       : 0.000
% 0.24/0.64  %    Propositional solver time         : 0.000
% 0.24/0.64  %    Success case prop preproc time    : 0.000
% 0.24/0.64  %    Success case prop encoding time   : 0.000
% 0.24/0.64  %    Success case prop solver time     : 0.000
% 0.24/0.64  % Current number of processed clauses  : 13
% 0.24/0.64  %    Positive orientable unit clauses  : 10
% 0.24/0.64  %    Positive unorientable unit clauses: 0
% 0.24/0.64  %    Negative unit clauses             : 1
% 0.24/0.64  %    Non-unit-clauses                  : 2
% 0.24/0.64  % Current number of unprocessed clauses: 50
% 0.24/0.64  % ...number of literals in the above   : 130
% 0.24/0.64  % Current number of archived formulas  : 0
% 0.24/0.64  % Current number of archived clauses   : 10
% 0.24/0.64  % Clause-clause subsumption calls (NU) : 8
% 0.24/0.64  % Rec. Clause-clause subsumption calls : 8
% 0.24/0.64  % Non-unit clause-clause subsumptions  : 4
% 0.24/0.64  % Unit Clause-clause subsumption calls : 17
% 0.24/0.64  % Rewrite failures with RHS unbound    : 0
% 0.24/0.64  % BW rewrite match attempts            : 8
% 0.24/0.64  % BW rewrite match successes           : 0
% 0.24/0.64  % Condensation attempts                : 0
% 0.24/0.64  % Condensation successes               : 0
% 0.24/0.65  % Termbank termtop insertions          : 1136
% 0.24/0.65  % Search garbage collected termcells   : 41
% 0.24/0.65  
% 0.24/0.65  % -------------------------------------------------
% 0.24/0.65  % User time                : 0.006 s
% 0.24/0.65  % System time              : 0.004 s
% 0.24/0.65  % Total time               : 0.010 s
% 0.24/0.65  % Maximum resident set size: 3636 pages
% 0.24/0.65  
% 0.24/0.65  % -------------------------------------------------
% 0.24/0.65  % User time                : 0.018 s
% 0.24/0.65  % System time              : 0.017 s
% 0.24/0.65  % Total time               : 0.035 s
% 0.24/0.65  % Maximum resident set size: 4864 pages
% 0.24/0.65  % E exiting
%------------------------------------------------------------------------------