TSTP Solution File: AGT014+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : AGT014+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:08:51 EDT 2024

% Result   : Theorem 0.24s 0.59s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (  11 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :   61 (  27   ~;  21   |;  10   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :   34 (   5 sgn  17   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query_14,conjecture,
    ? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
    file('/export/starexec/sandbox/tmp/tmp.PnU76uwguo/E---3.1_20543.p',query_14) ).

fof(a1_5,axiom,
    ! [X1,X4,X2] :
      ( any_agent_in_all_proposed_teams(X1,X4,X2)
     => accept_leader(X1,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.PnU76uwguo/E---3.1_20543.p',a1_5) ).

fof(a2_9,axiom,
    ! [X1] :
      ( ( accept_population(X1,atheist,n75)
        & accept_population(X1,christian,n24)
        & accept_population(X1,muslim,n1)
        & accept_population(X1,native,n0)
        & accept_population(X1,other,n0) )
    <=> accept_city(X1,towna) ),
    file('/export/starexec/sandbox/tmp/tmp.PnU76uwguo/E---3.1_20543.p',a2_9) ).

fof(a1_6,axiom,
    ! [X1,X4,X2] :
      ( the_agent_not_in_any_proposed_teams(X1,X4,X2)
     => ~ ( accept_city(X1,X2)
          & accept_leader(X1,X4) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnU76uwguo/E---3.1_20543.p',a1_6) ).

fof(event_12,axiom,
    any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    file('/export/starexec/sandbox/tmp/tmp.PnU76uwguo/E---3.1_20543.p',event_12) ).

fof(event_11,axiom,
    the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    file('/export/starexec/sandbox/tmp/tmp.PnU76uwguo/E---3.1_20543.p',event_11) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query_14])]) ).

fof(c_0_7,plain,
    ! [X32,X33,X34] :
      ( ~ any_agent_in_all_proposed_teams(X32,X33,X34)
      | accept_leader(X32,X33) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_5])])]) ).

fof(c_0_8,plain,
    ! [X48] :
      ( ( ~ accept_population(X48,atheist,n75)
        | ~ accept_population(X48,christian,n24)
        | ~ accept_population(X48,muslim,n1)
        | ~ accept_population(X48,native,n0)
        | ~ accept_population(X48,other,n0)
        | accept_city(X48,towna) )
      & ( accept_population(X48,atheist,n75)
        | ~ accept_city(X48,towna) )
      & ( accept_population(X48,christian,n24)
        | ~ accept_city(X48,towna) )
      & ( accept_population(X48,muslim,n1)
        | ~ accept_city(X48,towna) )
      & ( accept_population(X48,native,n0)
        | ~ accept_city(X48,towna) )
      & ( accept_population(X48,other,n0)
        | ~ accept_city(X48,towna) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_9])])])]) ).

fof(c_0_9,negated_conjecture,
    ! [X88,X89,X90] : accept_population(X88,X89,X90),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

fof(c_0_10,plain,
    ! [X35,X36,X37] :
      ( ~ the_agent_not_in_any_proposed_teams(X35,X36,X37)
      | ~ accept_city(X35,X37)
      | ~ accept_leader(X35,X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_6])])]) ).

cnf(c_0_11,plain,
    ( accept_leader(X1,X2)
    | ~ any_agent_in_all_proposed_teams(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    inference(split_conjunct,[status(thm)],[event_12]) ).

cnf(c_0_13,plain,
    ( accept_city(X1,towna)
    | ~ accept_population(X1,atheist,n75)
    | ~ accept_population(X1,christian,n24)
    | ~ accept_population(X1,muslim,n1)
    | ~ accept_population(X1,native,n0)
    | ~ accept_population(X1,other,n0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    accept_population(X1,X2,X3),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( ~ the_agent_not_in_any_proposed_teams(X1,X2,X3)
    | ~ accept_city(X1,X3)
    | ~ accept_leader(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    inference(split_conjunct,[status(thm)],[event_11]) ).

cnf(c_0_17,plain,
    accept_leader(muslimcountrybhumanitarianorganization,countryacivilorganization),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    accept_city(X1,towna),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : AGT014+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.07/0.17  % Command    : run_E %s %d THM
% 0.17/0.38  % Computer : n005.cluster.edu
% 0.17/0.38  % Model    : x86_64 x86_64
% 0.17/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38  % Memory   : 8042.1875MB
% 0.17/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38  % CPULimit   : 300
% 0.17/0.38  % WCLimit    : 300
% 0.17/0.38  % DateTime   : Fri May  3 12:51:11 EDT 2024
% 0.17/0.38  % CPUTime    : 
% 0.24/0.54  Running first-order theorem proving
% 0.24/0.54  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/tmp/tmp.PnU76uwguo/E---3.1_20543.p
% 0.24/0.59  # Version: 3.1.0
% 0.24/0.59  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.59  # Starting new_bool_3 with 600s (2) cores
% 0.24/0.59  # Starting new_bool_1 with 600s (2) cores
% 0.24/0.59  # Starting sh5l with 300s (1) cores
% 0.24/0.59  # new_bool_3 with pid 20661 completed with status 8
% 0.24/0.59  # new_bool_1 with pid 20662 completed with status 8
% 0.24/0.59  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 20660 completed with status 0
% 0.24/0.59  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.24/0.59  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.59  # No SInE strategy applied
% 0.24/0.59  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.59  # Scheduled 9 strats onto 3 cores with 900 seconds (900 total)
% 0.24/0.59  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 244s (1) cores
% 0.24/0.59  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.24/0.59  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 82s (1) cores
% 0.24/0.59  # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 20681 completed with status 0
% 0.24/0.59  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.24/0.59  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.59  # No SInE strategy applied
% 0.24/0.59  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.59  # Scheduled 9 strats onto 3 cores with 900 seconds (900 total)
% 0.24/0.59  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 244s (1) cores
% 0.24/0.59  # Preprocessing time       : 0.003 s
% 0.24/0.59  # Presaturation interreduction done
% 0.24/0.59  
% 0.24/0.59  # Proof found!
% 0.24/0.59  # SZS status Theorem
% 0.24/0.59  # SZS output start CNFRefutation
% See solution above
% 0.24/0.59  # Parsed axioms                        : 556
% 0.24/0.59  # Removed by relevancy pruning/SinE    : 0
% 0.24/0.59  # Initial clauses                      : 629
% 0.24/0.59  # Removed in clause preprocessing      : 67
% 0.24/0.59  # Initial clauses in saturation        : 562
% 0.24/0.59  # Processed clauses                    : 777
% 0.24/0.59  # ...of these trivial                  : 0
% 0.24/0.59  # ...subsumed                          : 0
% 0.24/0.59  # ...remaining for further processing  : 777
% 0.24/0.59  # Other redundant clauses eliminated   : 2
% 0.24/0.59  # Clauses deleted for lack of memory   : 0
% 0.24/0.59  # Backward-subsumed                    : 0
% 0.24/0.59  # Backward-rewritten                   : 0
% 0.24/0.59  # Generated clauses                    : 96
% 0.24/0.59  # ...of the previous two non-redundant : 41
% 0.24/0.59  # ...aggressively subsumed             : 0
% 0.24/0.59  # Contextual simplify-reflections      : 0
% 0.24/0.59  # Paramodulations                      : 94
% 0.24/0.59  # Factorizations                       : 0
% 0.24/0.59  # NegExts                              : 0
% 0.24/0.59  # Equation resolutions                 : 2
% 0.24/0.59  # Disequality decompositions           : 0
% 0.24/0.59  # Total rewrite steps                  : 56
% 0.24/0.59  # ...of those cached                   : 5
% 0.24/0.59  # Propositional unsat checks           : 0
% 0.24/0.59  #    Propositional check models        : 0
% 0.24/0.59  #    Propositional check unsatisfiable : 0
% 0.24/0.59  #    Propositional clauses             : 0
% 0.24/0.59  #    Propositional clauses after purity: 0
% 0.24/0.59  #    Propositional unsat core size     : 0
% 0.24/0.59  #    Propositional preprocessing time  : 0.000
% 0.24/0.59  #    Propositional encoding time       : 0.000
% 0.24/0.59  #    Propositional solver time         : 0.000
% 0.24/0.59  #    Success case prop preproc time    : 0.000
% 0.24/0.59  #    Success case prop encoding time   : 0.000
% 0.24/0.59  #    Success case prop solver time     : 0.000
% 0.24/0.59  # Current number of processed clauses  : 213
% 0.24/0.59  #    Positive orientable unit clauses  : 163
% 0.24/0.59  #    Positive unorientable unit clauses: 0
% 0.24/0.59  #    Negative unit clauses             : 41
% 0.24/0.59  #    Non-unit-clauses                  : 9
% 0.24/0.59  # Current number of unprocessed clauses: 388
% 0.24/0.59  # ...number of literals in the above   : 415
% 0.24/0.59  # Current number of archived formulas  : 0
% 0.24/0.59  # Current number of archived clauses   : 563
% 0.24/0.59  # Clause-clause subsumption calls (NU) : 146
% 0.24/0.59  # Rec. Clause-clause subsumption calls : 130
% 0.24/0.59  # Non-unit clause-clause subsumptions  : 0
% 0.24/0.59  # Unit Clause-clause subsumption calls : 899
% 0.24/0.59  # Rewrite failures with RHS unbound    : 0
% 0.24/0.59  # BW rewrite match attempts            : 169
% 0.24/0.59  # BW rewrite match successes           : 0
% 0.24/0.59  # Condensation attempts                : 0
% 0.24/0.59  # Condensation successes               : 0
% 0.24/0.59  # Termbank termtop insertions          : 23122
% 0.24/0.59  # Search garbage collected termcells   : 1168
% 0.24/0.59  
% 0.24/0.59  # -------------------------------------------------
% 0.24/0.59  # User time                : 0.027 s
% 0.24/0.59  # System time              : 0.007 s
% 0.24/0.59  # Total time               : 0.034 s
% 0.24/0.59  # Maximum resident set size: 2912 pages
% 0.24/0.59  
% 0.24/0.59  # -------------------------------------------------
% 0.24/0.59  # User time                : 0.092 s
% 0.24/0.59  # System time              : 0.081 s
% 0.24/0.59  # Total time               : 0.173 s
% 0.24/0.59  # Maximum resident set size: 2140 pages
% 0.24/0.59  % E---3.1 exiting
% 0.24/0.59  % E exiting
%------------------------------------------------------------------------------