↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n014.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:10:21 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(conj_6,conjecture,
    v_R(v_Z,v_s_H),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_6) ).

fof(conj_2,hypothesis,
    ! [X9,X10] :
      ( v_Q(X9,X10)
     => ! [X11] :
          ( c_Natural_Oevaln(v_d,X10,v_n,X11)
         => v_R(X9,X11) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).

fof(conj_5,hypothesis,
    c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_5) ).

fof(conj_1,hypothesis,
    ! [X9,X10] :
      ( v_P(X9,X10)
     => ! [X11] :
          ( c_Natural_Oevaln(v_c,X10,v_n,X11)
         => v_Q(X9,X11) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

fof(conj_4,hypothesis,
    c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_4) ).

fof(conj_3,hypothesis,
    v_P(v_Z,v_s),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_3) ).

fof(c_0_6,negated_conjecture,
    ~ v_R(v_Z,v_s_H),
    inference(assume_negation,[status(cth)],[conj_6]) ).

fof(c_0_7,negated_conjecture,
    ~ v_R(v_Z,v_s_H),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_8,hypothesis,
    ! [X334,X335,X336] :
      ( v_R(X334,X336)
      | ~ c_Natural_Oevaln(v_d,X335,v_n,X336)
      | ~ v_Q(X334,X335) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_2])])])]) ).

fof(c_0_9,negated_conjecture,
    ~ v_R(v_Z,v_s_H),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

cnf(c_0_10,hypothesis,
    ( ~ c_Natural_Oevaln(v_d,X2,v_n,X3)
    | ~ v_Q(X1,X2)
    | v_R(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,hypothesis,
    c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
    inference(split_conjunct,[status(thm)],[conj_5]) ).

fof(c_0_12,hypothesis,
    ! [X331,X332,X333] :
      ( v_Q(X331,X333)
      | ~ c_Natural_Oevaln(v_c,X332,v_n,X333)
      | ~ v_P(X331,X332) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])])]) ).

cnf(c_0_13,negated_conjecture,
    ~ v_R(v_Z,v_s_H),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,hypothesis,
    ( ~ v_Q(X1,v_s1)
    | v_R(X1,v_s_H) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,hypothesis,
    ( ~ c_Natural_Oevaln(v_c,X2,v_n,X3)
    | ~ v_P(X1,X2)
    | v_Q(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,hypothesis,
    c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
    inference(split_conjunct,[status(thm)],[conj_4]) ).

cnf(c_0_17,negated_conjecture,
    ~ v_Q(v_Z,v_s1),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,hypothesis,
    ( ~ v_P(X1,v_s)
    | v_Q(X1,v_s1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,hypothesis,
    v_P(v_Z,v_s),
    inference(split_conjunct,[status(thm)],[conj_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW344+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.47  % Computer : n014.cluster.edu
% 0.10/0.47  % Model    : x86_64 x86_64
% 0.10/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.47  % Memory   : 8046.5625MB
% 0.10/0.47  % OS       : Linux 6.8.0-71-generic
% 0.10/0.47  % CPULimit : 300
% 0.10/0.47  % WCLimit  : 300
% 0.10/0.47  % DateTime : Mon Sep 21 09:48:20 UTC 2026
% 0.10/0.47  % CPUTime  : 
% 0.10/0.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.51  Running first-order theorem proving
% 0.10/0.51  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.27/0.79  % Version: 3.5.1
% 0.27/0.79  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.27/0.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.79  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.79  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.79  % Starting sh5l with 300s (1) cores
% 0.27/0.79  % new_bool_1 with pid 3771022 completed with status 0
% 0.27/0.79  % Result found by new_bool_1
% 0.27/0.79  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.27/0.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.79  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.79  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.79  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.79  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.79  % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.27/0.79  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.79  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.79  % SubtermCWHack with pid 3771026 completed with status 0
% 0.27/0.79  % Result found by SubtermCWHack
% 0.27/0.79  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.27/0.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.79  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.79  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.79  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.79  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.79  % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.27/0.79  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.79  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.79  % Preprocessing time       : 0.025 s
% 0.27/0.79  
% 0.27/0.79  % Proof found!
% 0.27/0.79  % SZS status Theorem
% 0.27/0.79  % SZS output start CNFRefutation
% See solution above
% 0.27/0.79  % Parsed axioms                        : 5211
% 0.27/0.79  % Removed by relevancy pruning/SinE    : 4451
% 0.27/0.79  % Initial clauses                      : 1144
% 0.27/0.79  % Removed in clause preprocessing      : 56
% 0.27/0.79  % Initial clauses in saturation        : 1088
% 0.27/0.79  % Processed clauses                    : 216
% 0.27/0.79  % ...of these trivial                  : 10
% 0.27/0.79  % ...subsumed                          : 62
% 0.27/0.79  % ...remaining for further processing  : 144
% 0.27/0.79  % Other redundant clauses eliminated   : 19
% 0.27/0.79  % Clauses deleted for lack of memory   : 0
% 0.27/0.79  % Backward-subsumed                    : 0
% 0.27/0.79  % Backward-rewritten                   : 0
% 0.27/0.79  % Generated clauses                    : 57
% 0.27/0.79  % ...of the previous two non-redundant : 30
% 0.27/0.79  % ...aggressively subsumed             : 0
% 0.27/0.79  % Contextual simplify-reflections      : 0
% 0.27/0.79  % Paramodulations                      : 30
% 0.27/0.79  % Factorizations                       : 0
% 0.27/0.79  % NegExts                              : 0
% 0.27/0.79  % Equation resolutions                 : 27
% 0.27/0.79  % Disequality decompositions           : 0
% 0.27/0.79  % Total rewrite steps                  : 27
% 0.27/0.79  % ...of those cached                   : 8
% 0.27/0.79  % Propositional unsat checks           : 0
% 0.27/0.79  %    Propositional check models        : 0
% 0.27/0.79  %    Propositional check unsatisfiable : 0
% 0.27/0.79  %    Propositional clauses             : 0
% 0.27/0.79  %    Propositional clauses after purity: 0
% 0.27/0.79  %    Propositional unsat core size     : 0
% 0.27/0.79  %    Propositional preprocessing time  : 0.000
% 0.27/0.79  %    Propositional encoding time       : 0.000
% 0.27/0.79  %    Propositional solver time         : 0.000
% 0.27/0.79  %    Success case prop preproc time    : 0.000
% 0.27/0.79  %    Success case prop encoding time   : 0.000
% 0.27/0.79  %    Success case prop solver time     : 0.000
% 0.27/0.79  % Current number of processed clauses  : 127
% 0.27/0.79  %    Positive orientable unit clauses  : 53
% 0.27/0.79  %    Positive unorientable unit clauses: 0
% 0.27/0.79  %    Negative unit clauses             : 44
% 0.27/0.79  %    Non-unit-clauses                  : 30
% 0.27/0.79  % Current number of unprocessed clauses: 902
% 0.27/0.79  % ...number of literals in the above   : 2069
% 0.27/0.79  % Current number of archived formulas  : 0
% 0.27/0.79  % Current number of archived clauses   : 0
% 0.27/0.79  % Clause-clause subsumption calls (NU) : 638
% 0.27/0.79  % Rec. Clause-clause subsumption calls : 371
% 0.27/0.79  % Non-unit clause-clause subsumptions  : 10
% 0.27/0.79  % Unit Clause-clause subsumption calls : 424
% 0.27/0.79  % Rewrite failures with RHS unbound    : 0
% 0.27/0.79  % BW rewrite match attempts            : 19
% 0.27/0.79  % BW rewrite match successes           : 0
% 0.27/0.79  % Condensation attempts                : 0
% 0.27/0.79  % Condensation successes               : 0
% 0.27/0.79  % Termbank termtop insertions          : 236512
% 0.27/0.79  % Search garbage collected termcells   : 57653
% 0.27/0.79  
% 0.27/0.79  % -------------------------------------------------
% 0.27/0.79  % User time                : 0.108 s
% 0.27/0.79  % System time              : 0.029 s
% 0.27/0.79  % Total time               : 0.137 s
% 0.27/0.79  % Maximum resident set size: 13740 pages
% 0.27/0.79  
% 0.27/0.79  % -------------------------------------------------
% 0.27/0.79  % User time                : 0.220 s
% 0.27/0.79  % System time              : 0.037 s
% 0.27/0.79  % Total time               : 0.257 s
% 0.27/0.79  % Maximum resident set size: 12544 pages
% 0.27/0.79  % E exiting
%------------------------------------------------------------------------------