↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR025+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/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 12:15:56 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(query175,conjecture,
    ( mtvisible(c_patterndetectormt)
   => genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query175) ).

fof(ax3_13007,axiom,
    genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_13007) ).

fof(c_0_2,negated_conjecture,
    ~ ( mtvisible(c_patterndetectormt)
     => genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
    inference(assume_negation,[status(cth)],[query175]) ).

fof(c_0_3,negated_conjecture,
    ( ~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931)
    & mtvisible(c_patterndetectormt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

cnf(c_0_4,negated_conjecture,
    ~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,plain,
    genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    inference(split_conjunct,[status(thm)],[ax3_13007]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR025+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 14:24:27 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/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
% 1.15/1.43  % Version: 3.5.1
% 1.15/1.43  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.15/1.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/1.43  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.15/1.43  % Starting new_bool_3 with 300s (1) cores
% 1.15/1.43  % Starting new_bool_1 with 300s (1) cores
% 1.15/1.43  % Starting sh5l with 300s (1) cores
% 1.15/1.43  % new_bool_3 with pid 3071652 completed with status 0
% 1.15/1.43  % Result found by new_bool_3
% 1.15/1.43  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.15/1.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/1.43  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.15/1.43  % Starting new_bool_3 with 300s (1) cores
% 1.15/1.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.15/1.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.15/1.43  % Search class: FHUNF-FFSM00-SFFFFFNN
% 1.15/1.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.15/1.43  % Starting SubtermCWHack with 31s (1) cores
% 1.15/1.43  % SubtermCWHack with pid 3071661 completed with status 0
% 1.15/1.43  % Result found by SubtermCWHack
% 1.15/1.43  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.15/1.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/1.43  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.15/1.43  % Starting new_bool_3 with 300s (1) cores
% 1.15/1.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.15/1.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.15/1.43  % Search class: FHUNF-FFSM00-SFFFFFNN
% 1.15/1.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.15/1.43  % Starting SubtermCWHack with 31s (1) cores
% 1.15/1.43  % Preprocessing time       : 0.055 s
% 1.15/1.43  
% 1.15/1.43  % Proof found!
% 1.15/1.43  % SZS status Theorem
% 1.15/1.43  % SZS output start CNFRefutation
% See solution above
% 1.15/1.43  % Parsed axioms                        : 44217
% 1.15/1.43  % Removed by relevancy pruning/SinE    : 44186
% 1.15/1.43  % Initial clauses                      : 32
% 1.15/1.43  % Removed in clause preprocessing      : 0
% 1.15/1.43  % Initial clauses in saturation        : 32
% 1.15/1.43  % Processed clauses                    : 20
% 1.15/1.43  % ...of these trivial                  : 4
% 1.15/1.43  % ...subsumed                          : 0
% 1.15/1.43  % ...remaining for further processing  : 15
% 1.15/1.43  % Other redundant clauses eliminated   : 0
% 1.15/1.43  % Clauses deleted for lack of memory   : 0
% 1.15/1.43  % Backward-subsumed                    : 0
% 1.15/1.43  % Backward-rewritten                   : 0
% 1.15/1.43  % Generated clauses                    : 0
% 1.15/1.43  % ...of the previous two non-redundant : 0
% 1.15/1.43  % ...aggressively subsumed             : 0
% 1.15/1.43  % Contextual simplify-reflections      : 0
% 1.15/1.43  % Paramodulations                      : 0
% 1.15/1.43  % Factorizations                       : 0
% 1.15/1.43  % NegExts                              : 0
% 1.15/1.43  % Equation resolutions                 : 0
% 1.15/1.43  % Disequality decompositions           : 0
% 1.15/1.43  % Total rewrite steps                  : 5
% 1.15/1.43  % ...of those cached                   : 1
% 1.15/1.43  % Propositional unsat checks           : 0
% 1.15/1.43  %    Propositional check models        : 0
% 1.15/1.43  %    Propositional check unsatisfiable : 0
% 1.15/1.43  %    Propositional clauses             : 0
% 1.15/1.43  %    Propositional clauses after purity: 0
% 1.15/1.43  %    Propositional unsat core size     : 0
% 1.15/1.43  %    Propositional preprocessing time  : 0.000
% 1.15/1.43  %    Propositional encoding time       : 0.000
% 1.15/1.43  %    Propositional solver time         : 0.000
% 1.15/1.43  %    Success case prop preproc time    : 0.000
% 1.15/1.43  %    Success case prop encoding time   : 0.000
% 1.15/1.43  %    Success case prop solver time     : 0.000
% 1.15/1.43  % Current number of processed clauses  : 15
% 1.15/1.43  %    Positive orientable unit clauses  : 15
% 1.15/1.43  %    Positive unorientable unit clauses: 0
% 1.15/1.43  %    Negative unit clauses             : 0
% 1.15/1.43  %    Non-unit-clauses                  : 0
% 1.15/1.43  % Current number of unprocessed clauses: 12
% 1.15/1.43  % ...number of literals in the above   : 30
% 1.15/1.43  % Current number of archived formulas  : 0
% 1.15/1.43  % Current number of archived clauses   : 0
% 1.15/1.43  % Clause-clause subsumption calls (NU) : 0
% 1.15/1.43  % Rec. Clause-clause subsumption calls : 0
% 1.15/1.43  % Non-unit clause-clause subsumptions  : 0
% 1.15/1.43  % Unit Clause-clause subsumption calls : 0
% 1.15/1.43  % Rewrite failures with RHS unbound    : 0
% 1.15/1.43  % BW rewrite match attempts            : 0
% 1.15/1.43  % BW rewrite match successes           : 0
% 1.15/1.43  % Condensation attempts                : 0
% 1.15/1.43  % Condensation successes               : 0
% 1.15/1.43  % Termbank termtop insertions          : 292758
% 1.15/1.43  % Search garbage collected termcells   : 157732
% 1.15/1.43  
% 1.15/1.43  % -------------------------------------------------
% 1.15/1.43  % User time                : 0.118 s
% 1.15/1.43  % System time              : 0.100 s
% 1.15/1.43  % Total time               : 0.218 s
% 1.15/1.43  % Maximum resident set size: 84020 pages
% 1.15/1.43  
% 1.15/1.43  % -------------------------------------------------
% 1.15/1.43  % User time                : 0.840 s
% 1.15/1.43  % System time              : 0.147 s
% 1.15/1.43  % Total time               : 0.987 s
% 1.15/1.43  % Maximum resident set size: 37888 pages
% 1.15/1.43  % E exiting
%------------------------------------------------------------------------------