↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n015.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:27:05 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(conjecture,conjecture,
    about_event(s,e1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture) ).

fof(ax_B3,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( ( founds_rem(X5,X4,X6)
        & part_of(X1,X4)
        & cnt(X1,decl(X2),X3)
        & subjection(X1) )
     => about_event(X1,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_B3) ).

fof(cnt_s,axiom,
    cnt(s,decl(some_action),some_target),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cnt_s) ).

fof(subj_s,axiom,
    subjection(s),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subj_s) ).

fof(founds_rem1,axiom,
    founds_rem(e1,rho_r,f1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',founds_rem1) ).

fof(partof_s,axiom,
    part_of(s,rho_r),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',partof_s) ).

fof(c_0_6,negated_conjecture,
    ~ about_event(s,e1),
    inference(assume_negation,[status(cth)],[conjecture]) ).

fof(c_0_7,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( about_event(X7,X11)
      | ~ founds_rem(X11,X10,X12)
      | ~ part_of(X7,X10)
      | ~ cnt(X7,decl(X8),X9)
      | ~ subjection(X7) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_B3])])]) ).

fof(c_0_8,negated_conjecture,
    ~ about_event(s,e1),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( ~ founds_rem(X5,X4,X6)
    | ~ part_of(X1,X4)
    | ~ cnt(X1,decl(X2),X3)
    | ~ subjection(X1)
    | about_event(X1,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    cnt(s,decl(some_action),some_target),
    inference(split_conjunct,[status(thm)],[cnt_s]) ).

cnf(c_0_11,plain,
    subjection(s),
    inference(split_conjunct,[status(thm)],[subj_s]) ).

fof(c_0_12,negated_conjecture,
    ~ about_event(s,e1),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ part_of(s,X2)
    | ~ founds_rem(X1,X2,X3)
    | about_event(s,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_14,plain,
    founds_rem(e1,rho_r,f1),
    inference(split_conjunct,[status(thm)],[founds_rem1]) ).

cnf(c_0_15,plain,
    part_of(s,rho_r),
    inference(split_conjunct,[status(thm)],[partof_s]) ).

cnf(c_0_16,negated_conjecture,
    ~ about_event(s,e1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
    [proof] ).

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