↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV386+1 : TPTP v9.3.1. Released v3.3.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 02:54:37 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(l22_co,conjecture,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] :
          ( ~ ok(insert_cpq(triple(X1,X2,X3),X4))
          | ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_co) ).

fof(l22_l26,lemma,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_l26) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ! [X4] :
            ( ~ ok(insert_cpq(triple(X1,X2,X3),X4))
            | ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ) ),
    inference(assume_negation,[status(cth)],[l22_co]) ).

fof(c_0_3,lemma,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    inference(fof_simplification,[status(thm)],[l22_l26]) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ! [X4] :
            ( ~ ok(insert_cpq(triple(X1,X2,X3),X4))
            | ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_5,lemma,
    ! [X119,X120,X121,X122] :
      ( ~ check_cpq(insert_cpq(triple(X119,X120,X121),X122))
      | check_cpq(triple(X119,X120,X121)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_6,negated_conjecture,
    ( ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
    & check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
    & ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_7,lemma,
    ( ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4))
    | check_cpq(triple(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    check_cpq(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV386+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38  % Computer : n018.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Mon Sep 21 08:46:19 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  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/5.44  % Version: 3.5.1
% 0.15/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44  % Starting sh5l with 300s (1) cores
% 0.15/5.44  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1495170 completed with status 0
% 0.15/5.44  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.44  % No SInE strategy applied
% 0.15/5.44  % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/5.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.44  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.44  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.45  % Starting new_bool_3 with 136s (1) cores
% 0.15/5.45  % Starting new_bool_1 with 136s (1) cores
% 0.15/5.45  % new_bool_1 with pid 1495178 completed with status 0
% 0.15/5.45  % Result found by new_bool_1
% 0.15/5.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45  % No SInE strategy applied
% 0.15/5.45  % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/5.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.45  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.45  % Starting new_bool_3 with 136s (1) cores
% 0.15/5.45  % Starting new_bool_1 with 136s (1) cores
% 0.15/5.45  % Preprocessing time       : 0.001 s
% 0.15/5.45  % Presaturation interreduction done
% 0.15/5.45  
% 0.15/5.45  % Proof found!
% 0.15/5.45  % SZS status Theorem
% 0.15/5.45  % SZS output start CNFRefutation
% See solution above
% 0.15/5.45  % Parsed axioms                        : 43
% 0.15/5.45  % Removed by relevancy pruning/SinE    : 0
% 0.15/5.45  % Initial clauses                      : 56
% 0.15/5.45  % Removed in clause preprocessing      : 4
% 0.15/5.45  % Initial clauses in saturation        : 52
% 0.15/5.45  % Processed clauses                    : 71
% 0.15/5.45  % ...of these trivial                  : 0
% 0.15/5.45  % ...subsumed                          : 0
% 0.15/5.45  % ...remaining for further processing  : 71
% 0.15/5.45  % Other redundant clauses eliminated   : 3
% 0.15/5.45  % Clauses deleted for lack of memory   : 0
% 0.15/5.45  % Backward-subsumed                    : 0
% 0.15/5.45  % Backward-rewritten                   : 0
% 0.15/5.45  % Generated clauses                    : 3
% 0.15/5.45  % ...of the previous two non-redundant : 2
% 0.15/5.45  % ...aggressively subsumed             : 0
% 0.15/5.45  % Contextual simplify-reflections      : 2
% 0.15/5.45  % Paramodulations                      : 1
% 0.15/5.45  % Factorizations                       : 0
% 0.15/5.45  % NegExts                              : 0
% 0.15/5.45  % Equation resolutions                 : 3
% 0.15/5.45  % Disequality decompositions           : 0
% 0.15/5.45  % Total rewrite steps                  : 0
% 0.15/5.45  % ...of those cached                   : 0
% 0.15/5.45  % Propositional unsat checks           : 0
% 0.15/5.45  %    Propositional check models        : 0
% 0.15/5.45  %    Propositional check unsatisfiable : 0
% 0.15/5.45  %    Propositional clauses             : 0
% 0.15/5.45  %    Propositional clauses after purity: 0
% 0.15/5.45  %    Propositional unsat core size     : 0
% 0.15/5.45  %    Propositional preprocessing time  : 0.000
% 0.15/5.45  %    Propositional encoding time       : 0.000
% 0.15/5.45  %    Propositional solver time         : 0.000
% 0.15/5.45  %    Success case prop preproc time    : 0.000
% 0.15/5.45  %    Success case prop encoding time   : 0.000
% 0.15/5.45  %    Success case prop solver time     : 0.000
% 0.15/5.45  % Current number of processed clauses  : 17
% 0.15/5.45  %    Positive orientable unit clauses  : 8
% 0.15/5.45  %    Positive unorientable unit clauses: 0
% 0.15/5.45  %    Negative unit clauses             : 5
% 0.15/5.45  %    Non-unit-clauses                  : 4
% 0.15/5.45  % Current number of unprocessed clauses: 35
% 0.15/5.45  % ...number of literals in the above   : 77
% 0.15/5.45  % Current number of archived formulas  : 0
% 0.15/5.45  % Current number of archived clauses   : 54
% 0.15/5.45  % Clause-clause subsumption calls (NU) : 85
% 0.15/5.45  % Rec. Clause-clause subsumption calls : 58
% 0.15/5.45  % Non-unit clause-clause subsumptions  : 2
% 0.15/5.45  % Unit Clause-clause subsumption calls : 11
% 0.15/5.45  % Rewrite failures with RHS unbound    : 0
% 0.15/5.45  % BW rewrite match attempts            : 8
% 0.15/5.45  % BW rewrite match successes           : 0
% 0.15/5.45  % Condensation attempts                : 0
% 0.15/5.45  % Condensation successes               : 0
% 0.15/5.45  % Termbank termtop insertions          : 4289
% 0.15/5.45  % Search garbage collected termcells   : 597
% 0.15/5.45  
% 0.15/5.45  % -------------------------------------------------
% 0.15/5.45  % User time                : 0.006 s
% 0.15/5.45  % System time              : 0.002 s
% 0.15/5.45  % Total time               : 0.008 s
% 0.15/5.45  % Maximum resident set size: 3688 pages
% 0.15/5.45  
% 0.15/5.45  % -------------------------------------------------
% 0.15/5.45  % User time                : 0.023 s
% 0.15/5.45  % System time              : 0.012 s
% 0.15/5.45  % Total time               : 0.034 s
% 0.15/5.45  % Maximum resident set size: 4864 pages
% 0.15/5.45  % E exiting
%------------------------------------------------------------------------------