↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n006.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 01:12:51 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(hilbert_implies_3,conjecture,
    implies_3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3) ).

fof(cn1,axiom,
    ( cn1
  <=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn1) ).

fof(implies_3,axiom,
    ( implies_3
  <=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).

fof(luka_cn1,axiom,
    cn1,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn1) ).

fof(c_0_4,negated_conjecture,
    ~ implies_3,
    inference(assume_negation,[status(cth)],[hilbert_implies_3]) ).

fof(c_0_5,plain,
    ! [X83,X84,X85] :
      ( ( cn1
        | ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))) )
      & ( is_a_theorem(implies(implies(X83,X84),implies(implies(X84,X85),implies(X83,X85))))
        | ~ cn1 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn1])])])])]) ).

fof(c_0_6,negated_conjecture,
    ~ implies_3,
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ! [X27,X28,X29] :
      ( ( implies_3
        | ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0)))) )
      & ( is_a_theorem(implies(implies(X27,X28),implies(implies(X28,X29),implies(X27,X29))))
        | ~ implies_3 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_3])])])])]) ).

cnf(c_0_8,plain,
    ( ~ cn1
    | is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    cn1,
    inference(split_conjunct,[status(thm)],[luka_cn1]) ).

fof(c_0_10,negated_conjecture,
    ~ implies_3,
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0))))
    | implies_3 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_13,negated_conjecture,
    ~ implies_3,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38  % Computer : n006.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 00:33:33 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43  Running first-order theorem proving
% 0.16/5.43  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.16/5.45  % Version: 3.5.1
% 0.16/5.45  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/5.45  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.45  % Starting sh5l with 300s (1) cores
% 0.16/5.45  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1636655 completed with status 0
% 0.16/5.45  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.16/5.45  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/5.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.45  % No SInE strategy applied
% 0.16/5.45  % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/5.45  % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.45  % Starting SubtermCWHack with 151s (1) cores
% 0.16/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.16/5.45  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.16/5.45  % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.16/5.45  % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.45  % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 1636671 completed with status 0
% 0.16/5.45  % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.16/5.45  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/5.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/5.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.45  % No SInE strategy applied
% 0.16/5.45  % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/5.45  % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.45  % Starting SubtermCWHack with 151s (1) cores
% 0.16/5.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.16/5.45  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.16/5.45  % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.16/5.45  % Preprocessing time       : 0.001 s
% 0.16/5.45  % Presaturation interreduction done
% 0.16/5.45  
% 0.16/5.45  % Proof found!
% 0.16/5.45  % SZS status Theorem
% 0.16/5.45  % SZS output start CNFRefutation
% See solution above
% 0.16/5.45  % Parsed axioms                        : 43
% 0.16/5.45  % Removed by relevancy pruning/SinE    : 0
% 0.16/5.45  % Initial clauses                      : 72
% 0.16/5.45  % Removed in clause preprocessing      : 0
% 0.16/5.45  % Initial clauses in saturation        : 72
% 0.16/5.45  % Processed clauses                    : 65
% 0.16/5.45  % ...of these trivial                  : 9
% 0.16/5.45  % ...subsumed                          : 1
% 0.16/5.45  % ...remaining for further processing  : 54
% 0.16/5.45  % Other redundant clauses eliminated   : 0
% 0.16/5.45  % Clauses deleted for lack of memory   : 0
% 0.16/5.45  % Backward-subsumed                    : 1
% 0.16/5.45  % Backward-rewritten                   : 1
% 0.16/5.45  % Generated clauses                    : 0
% 0.16/5.45  % ...of the previous two non-redundant : 1
% 0.16/5.45  % ...aggressively subsumed             : 0
% 0.16/5.45  % Contextual simplify-reflections      : 0
% 0.16/5.45  % Paramodulations                      : 0
% 0.16/5.45  % Factorizations                       : 0
% 0.16/5.45  % NegExts                              : 0
% 0.16/5.45  % Equation resolutions                 : 0
% 0.16/5.45  % Disequality decompositions           : 0
% 0.16/5.45  % Total rewrite steps                  : 24
% 0.16/5.45  % ...of those cached                   : 8
% 0.16/5.45  % Propositional unsat checks           : 0
% 0.16/5.45  %    Propositional check models        : 0
% 0.16/5.45  %    Propositional check unsatisfiable : 0
% 0.16/5.45  %    Propositional clauses             : 0
% 0.16/5.45  %    Propositional clauses after purity: 0
% 0.16/5.45  %    Propositional unsat core size     : 0
% 0.16/5.45  %    Propositional preprocessing time  : 0.000
% 0.16/5.45  %    Propositional encoding time       : 0.000
% 0.16/5.45  %    Propositional solver time         : 0.000
% 0.16/5.45  %    Success case prop preproc time    : 0.000
% 0.16/5.45  %    Success case prop encoding time   : 0.000
% 0.16/5.45  %    Success case prop solver time     : 0.000
% 0.16/5.45  % Current number of processed clauses  : 52
% 0.16/5.45  %    Positive orientable unit clauses  : 16
% 0.16/5.45  %    Positive unorientable unit clauses: 0
% 0.16/5.45  %    Negative unit clauses             : 1
% 0.16/5.45  %    Non-unit-clauses                  : 35
% 0.16/5.45  % Current number of unprocessed clauses: 8
% 0.16/5.45  % ...number of literals in the above   : 16
% 0.16/5.45  % Current number of archived formulas  : 0
% 0.16/5.45  % Current number of archived clauses   : 2
% 0.16/5.45  % Clause-clause subsumption calls (NU) : 42
% 0.16/5.45  % Rec. Clause-clause subsumption calls : 41
% 0.16/5.45  % Non-unit clause-clause subsumptions  : 0
% 0.16/5.45  % Unit Clause-clause subsumption calls : 26
% 0.16/5.45  % Rewrite failures with RHS unbound    : 0
% 0.16/5.45  % BW rewrite match attempts            : 6
% 0.16/5.45  % BW rewrite match successes           : 2
% 0.16/5.45  % Condensation attempts                : 0
% 0.16/5.45  % Condensation successes               : 0
% 0.16/5.45  % Termbank termtop insertions          : 4641
% 0.16/5.45  % Search garbage collected termcells   : 1092
% 0.16/5.45  
% 0.16/5.45  % -------------------------------------------------
% 0.16/5.45  % User time                : 0.009 s
% 0.16/5.45  % System time              : 0.003 s
% 0.16/5.45  % Total time               : 0.013 s
% 0.16/5.45  % Maximum resident set size: 3636 pages
% 0.16/5.45  
% 0.16/5.45  % -------------------------------------------------
% 0.16/5.45  % User time                : 0.022 s
% 0.16/5.45  % System time              : 0.017 s
% 0.16/5.45  % Total time               : 0.038 s
% 0.16/5.45  % Maximum resident set size: 4608 pages
% 0.16/5.45  % E exiting
%------------------------------------------------------------------------------