↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n008.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 11:47:27 AM UTC 2026

% Result   : Theorem 0.14s 5.49s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  12 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :   63 (  29   ~;  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   :   31 (   3 sgn  16   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query_16,conjecture,
    ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query_16) ).

fof(a1_5,axiom,
    ! [X1,X4,X2] :
      ( any_agent_in_all_proposed_teams(X1,X4,X2)
     => accept_leader(X1,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a1_5) ).

fof(a2_9,axiom,
    ! [X1] :
      ( ( accept_population(X1,other,n0)
        & accept_population(X1,native,n0)
        & accept_population(X1,muslim,n1)
        & accept_population(X1,christian,n24)
        & accept_population(X1,atheist,n75) )
    <=> accept_city(X1,towna) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a2_9) ).

fof(a1_6,axiom,
    ! [X1,X4,X2] :
      ( the_agent_not_in_any_proposed_teams(X1,X4,X2)
     => ~ ( accept_leader(X1,X4)
          & accept_city(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a1_6) ).

fof(event_249,axiom,
    any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,sufferterragovernment,towna),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+1.ax',event_249) ).

fof(event_248,axiom,
    the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,sufferterragovernment,towna),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+1.ax',event_248) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
    inference(assume_negation,[status(cth)],[query_16]) ).

fof(c_0_7,negated_conjecture,
    ~ ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

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

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

fof(c_0_10,negated_conjecture,
    ! [X88,X89] : accept_population(muslimcountrybhumanitarianorganization,X88,X89),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).

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

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

cnf(c_0_13,plain,
    any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,sufferterragovernment,towna),
    inference(split_conjunct,[status(thm)],[event_249]) ).

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

cnf(c_0_15,negated_conjecture,
    accept_population(muslimcountrybhumanitarianorganization,X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_17,plain,
    the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,sufferterragovernment,towna),
    inference(split_conjunct,[status(thm)],[event_248]) ).

cnf(c_0_18,plain,
    accept_leader(muslimcountrybhumanitarianorganization,sufferterragovernment),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_15])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : AGT016+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.37  % Computer : n008.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % 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 12:50:14 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/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.14/5.49  % Version: 3.5.1
% 0.14/5.49  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/5.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/5.49  % Starting new_bool_3 with 600s (2) cores
% 0.14/5.49  % Starting new_bool_1 with 600s (2) cores
% 0.14/5.49  % Starting sh5l with 300s (1) cores
% 0.14/5.49  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1015590 completed with status 0
% 0.14/5.49  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.14/5.49  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/5.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/5.49  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.49  % No SInE strategy applied
% 0.14/5.49  % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/5.49  % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.14/5.49  % Starting SubtermCWHack with 82s (1) cores
% 0.14/5.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.14/5.49  % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 82s (1) cores
% 0.14/5.49  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1015595 completed with status 0
% 0.14/5.49  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.14/5.49  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/5.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/5.49  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.49  % No SInE strategy applied
% 0.14/5.49  % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/5.49  % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.14/5.49  % Starting SubtermCWHack with 82s (1) cores
% 0.14/5.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.14/5.49  % Preprocessing time       : 0.004 s
% 0.14/5.49  
% 0.14/5.49  % Proof found!
% 0.14/5.49  % SZS status Theorem
% 0.14/5.49  % SZS output start CNFRefutation
% See solution above
% 0.14/5.49  % Parsed axioms                        : 556
% 0.14/5.49  % Removed by relevancy pruning/SinE    : 0
% 0.14/5.49  % Initial clauses                      : 629
% 0.14/5.49  % Removed in clause preprocessing      : 0
% 0.14/5.49  % Initial clauses in saturation        : 629
% 0.14/5.49  % Processed clauses                    : 681
% 0.14/5.49  % ...of these trivial                  : 19
% 0.14/5.49  % ...subsumed                          : 0
% 0.14/5.49  % ...remaining for further processing  : 661
% 0.14/5.49  % Other redundant clauses eliminated   : 2
% 0.14/5.49  % Clauses deleted for lack of memory   : 0
% 0.14/5.49  % Backward-subsumed                    : 0
% 0.14/5.49  % Backward-rewritten                   : 0
% 0.14/5.49  % Generated clauses                    : 975
% 0.14/5.49  % ...of the previous two non-redundant : 814
% 0.14/5.49  % ...aggressively subsumed             : 0
% 0.14/5.49  % Contextual simplify-reflections      : 0
% 0.14/5.49  % Paramodulations                      : 971
% 0.14/5.49  % Factorizations                       : 2
% 0.14/5.49  % NegExts                              : 0
% 0.14/5.49  % Equation resolutions                 : 2
% 0.14/5.49  % Disequality decompositions           : 0
% 0.14/5.49  % Total rewrite steps                  : 230
% 0.14/5.49  % ...of those cached                   : 158
% 0.14/5.49  % Propositional unsat checks           : 0
% 0.14/5.49  %    Propositional check models        : 0
% 0.14/5.49  %    Propositional check unsatisfiable : 0
% 0.14/5.49  %    Propositional clauses             : 0
% 0.14/5.49  %    Propositional clauses after purity: 0
% 0.14/5.49  %    Propositional unsat core size     : 0
% 0.14/5.49  %    Propositional preprocessing time  : 0.000
% 0.14/5.49  %    Propositional encoding time       : 0.000
% 0.14/5.49  %    Propositional solver time         : 0.000
% 0.14/5.49  %    Success case prop preproc time    : 0.000
% 0.14/5.49  %    Success case prop encoding time   : 0.000
% 0.14/5.49  %    Success case prop solver time     : 0.000
% 0.14/5.49  % Current number of processed clauses  : 659
% 0.14/5.49  %    Positive orientable unit clauses  : 515
% 0.14/5.49  %    Positive unorientable unit clauses: 0
% 0.14/5.49  %    Negative unit clauses             : 41
% 0.14/5.49  %    Non-unit-clauses                  : 103
% 0.14/5.49  % Current number of unprocessed clauses: 762
% 0.14/5.49  % ...number of literals in the above   : 1511
% 0.14/5.49  % Current number of archived formulas  : 0
% 0.14/5.49  % Current number of archived clauses   : 0
% 0.14/5.49  % Clause-clause subsumption calls (NU) : 2454
% 0.14/5.49  % Rec. Clause-clause subsumption calls : 941
% 0.14/5.49  % Non-unit clause-clause subsumptions  : 0
% 0.14/5.49  % Unit Clause-clause subsumption calls : 1080
% 0.14/5.49  % Rewrite failures with RHS unbound    : 0
% 0.14/5.49  % BW rewrite match attempts            : 170
% 0.14/5.49  % BW rewrite match successes           : 0
% 0.14/5.49  % Condensation attempts                : 0
% 0.14/5.49  % Condensation successes               : 0
% 0.14/5.49  % Termbank termtop insertions          : 34200
% 0.14/5.49  % Search garbage collected termcells   : 1164
% 0.14/5.49  
% 0.14/5.49  % -------------------------------------------------
% 0.14/5.49  % User time                : 0.020 s
% 0.14/5.49  % System time              : 0.010 s
% 0.14/5.49  % Total time               : 0.029 s
% 0.14/5.49  % Maximum resident set size: 4596 pages
% 0.14/5.49  
% 0.14/5.49  % -------------------------------------------------
% 0.14/5.49  % User time                : 0.066 s
% 0.14/5.49  % System time              : 0.024 s
% 0.14/5.49  % Total time               : 0.090 s
% 0.14/5.49  % Maximum resident set size: 5376 pages
% 0.14/5.49  % E exiting
%------------------------------------------------------------------------------