↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n019.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:14:14 PM UTC 2026

% Result   : Theorem 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   39 (   3 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   38 (  19   ~;   9   |;   3   &)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   29 (   5 sgn  13   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goal_016,conjecture,
    ? [X6,X8] :
      ~ ( ord(X6)
       => ( ~ ord(X8)
         => ord(merge(X6,X8)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_016) ).

fof(axiom_009,axiom,
    ! [X3] : merge(nil,X3) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).

fof(axiom_007,axiom,
    ! [X4] : ~ leqNat(s(X4),z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).

fof(axiom_015,axiom,
    ! [X3,X7,X6] :
      ( ord(cons(X3,cons(X7,X6)))
    <=> ( ord(cons(X7,X6))
        & leqNat(X3,X7) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).

fof(axiom_013,axiom,
    ord(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X6,X8] :
        ~ ( ord(X6)
         => ( ~ ord(X8)
           => ord(merge(X6,X8)) ) ),
    inference(assume_negation,[status(cth)],[goal_016]) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X6,X8] :
        ~ ( ord(X6)
         => ( ~ ord(X8)
           => ord(merge(X6,X8)) ) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,negated_conjecture,
    ! [X9,X10] :
      ( ord(merge(X9,X10))
      | ord(X10)
      | ~ ord(X9) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_8,plain,
    ! [X15] : merge(nil,X15) = X15,
    inference(variable_rename,[status(thm)],[axiom_009]) ).

fof(c_0_9,plain,
    ! [X4] : ~ leqNat(s(X4),z),
    inference(fof_simplification,[status(thm)],[axiom_007]) ).

fof(c_0_10,plain,
    ! [X12,X13,X14] :
      ( ( ord(cons(X12,cons(X13,X14)))
        | ~ ord(cons(X13,X14))
        | ~ leqNat(X12,X13) )
      & ( ~ ord(cons(X12,cons(X13,X14)))
        | ord(cons(X13,X14)) )
      & ( ~ ord(cons(X12,cons(X13,X14)))
        | leqNat(X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_015])])])]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ ord(X1)
    | ord(merge(X1,X2))
    | ord(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    merge(nil,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ord(nil),
    inference(split_conjunct,[status(thm)],[axiom_013]) ).

fof(c_0_14,plain,
    ! [X31] : ~ leqNat(s(X31),z),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).

cnf(c_0_15,plain,
    ( ~ ord(cons(X1,cons(X2,X3)))
    | leqNat(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ord(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_17,plain,
    ~ leqNat(s(X1),z),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    leqNat(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).

cnf(c_0_19,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX200+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n019.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 10:34:04 UTC 2026
% 0.15/0.37  % CPUTime  : 
% 0.15/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.43  % Version: 3.5.1
% 0.15/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % Starting sh5l with 300s (1) cores
% 0.15/0.43  % new_bool_1 with pid 2341862 completed with status 0
% 0.15/0.43  % Result found by new_bool_1
% 0.15/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  % Search class: FGUSS-FFSF21-MFFFFFNN
% 0.15/0.43  % partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.15/0.43  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43  % SubtermCWHack with pid 2341868 completed with status 0
% 0.15/0.43  % Result found by SubtermCWHack
% 0.15/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  % Search class: FGUSS-FFSF21-MFFFFFNN
% 0.15/0.43  % partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.15/0.43  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43  % Preprocessing time       : 0.001 s
% 0.15/0.43  
% 0.15/0.43  % Proof found!
% 0.15/0.43  % SZS status Theorem
% 0.15/0.43  % SZS output start CNFRefutation
% See solution above
% 0.15/0.43  % Parsed axioms                        : 16
% 0.15/0.43  % Removed by relevancy pruning/SinE    : 4
% 0.15/0.43  % Initial clauses                      : 15
% 0.15/0.43  % Removed in clause preprocessing      : 0
% 0.15/0.43  % Initial clauses in saturation        : 15
% 0.15/0.43  % Processed clauses                    : 12
% 0.15/0.43  % ...of these trivial                  : 0
% 0.15/0.43  % ...subsumed                          : 0
% 0.15/0.43  % ...remaining for further processing  : 12
% 0.15/0.43  % Other redundant clauses eliminated   : 0
% 0.15/0.43  % Clauses deleted for lack of memory   : 0
% 0.15/0.43  % Backward-subsumed                    : 0
% 0.15/0.43  % Backward-rewritten                   : 6
% 0.15/0.43  % Generated clauses                    : 2
% 0.15/0.43  % ...of the previous two non-redundant : 1
% 0.15/0.43  % ...aggressively subsumed             : 0
% 0.15/0.43  % Contextual simplify-reflections      : 0
% 0.15/0.43  % Paramodulations                      : 2
% 0.15/0.43  % Factorizations                       : 0
% 0.15/0.43  % NegExts                              : 0
% 0.15/0.43  % Equation resolutions                 : 0
% 0.15/0.43  % Disequality decompositions           : 0
% 0.15/0.43  % Total rewrite steps                  : 12
% 0.15/0.43  % ...of those cached                   : 2
% 0.15/0.43  % Propositional unsat checks           : 0
% 0.15/0.43  %    Propositional check models        : 0
% 0.15/0.43  %    Propositional check unsatisfiable : 0
% 0.15/0.43  %    Propositional clauses             : 0
% 0.15/0.43  %    Propositional clauses after purity: 0
% 0.15/0.43  %    Propositional unsat core size     : 0
% 0.15/0.43  %    Propositional preprocessing time  : 0.000
% 0.15/0.43  %    Propositional encoding time       : 0.000
% 0.15/0.43  %    Propositional solver time         : 0.000
% 0.15/0.43  %    Success case prop preproc time    : 0.000
% 0.15/0.43  %    Success case prop encoding time   : 0.000
% 0.15/0.43  %    Success case prop solver time     : 0.000
% 0.15/0.43  % Current number of processed clauses  : 6
% 0.15/0.43  %    Positive orientable unit clauses  : 4
% 0.15/0.43  %    Positive unorientable unit clauses: 0
% 0.15/0.43  %    Negative unit clauses             : 2
% 0.15/0.43  %    Non-unit-clauses                  : 0
% 0.15/0.43  % Current number of unprocessed clauses: 4
% 0.15/0.43  % ...number of literals in the above   : 9
% 0.15/0.43  % Current number of archived formulas  : 0
% 0.15/0.43  % Current number of archived clauses   : 6
% 0.15/0.43  % Clause-clause subsumption calls (NU) : 0
% 0.15/0.43  % Rec. Clause-clause subsumption calls : 0
% 0.15/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.15/0.43  % Unit Clause-clause subsumption calls : 0
% 0.15/0.43  % Rewrite failures with RHS unbound    : 0
% 0.15/0.43  % BW rewrite match attempts            : 8
% 0.15/0.43  % BW rewrite match successes           : 8
% 0.15/0.43  % Condensation attempts                : 0
% 0.15/0.43  % Condensation successes               : 0
% 0.15/0.43  % Termbank termtop insertions          : 890
% 0.15/0.43  % Search garbage collected termcells   : 126
% 0.15/0.43  
% 0.15/0.43  % -------------------------------------------------
% 0.15/0.43  % User time                : 0.003 s
% 0.15/0.43  % System time              : 0.003 s
% 0.15/0.43  % Total time               : 0.005 s
% 0.15/0.43  % Maximum resident set size: 3644 pages
% 0.15/0.43  
% 0.15/0.43  % -------------------------------------------------
% 0.15/0.43  % User time                : 0.003 s
% 0.15/0.43  % System time              : 0.006 s
% 0.15/0.43  % Total time               : 0.009 s
% 0.15/0.43  % Maximum resident set size: 4864 pages
% 0.15/0.43  % E exiting
%------------------------------------------------------------------------------