↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n012.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.07s 0.35s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  11 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  16   ~;   7   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   31 (   4 sgn  14   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query_15,conjecture,
    ? [X7,X8] : ~ accept_city(X7,X8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_15) ).

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/sandbox/benchmark/Axioms/AGT001+0.ax',a1_6) ).

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

fof(event_38,axiom,
    any_agent_in_all_proposed_teams(countryamedicalorganization,christiancountrychumanitarianorganization,coastvillage),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_38) ).

fof(event_37,axiom,
    the_agent_not_in_any_proposed_teams(countryamedicalorganization,christiancountrychumanitarianorganization,coastvillage),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_37) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X7,X8] : ~ accept_city(X7,X8),
    inference(assume_negation,[status(cth)],[query_15]) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X7,X8] : ~ accept_city(X7,X8),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,plain,
    ! [X27,X28,X29] :
      ( ~ accept_leader(X27,X28)
      | ~ accept_city(X27,X29)
      | ~ the_agent_not_in_any_proposed_teams(X27,X28,X29) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_6])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X18,X19] : accept_city(X18,X19),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

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

cnf(c_0_10,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_7]) ).

cnf(c_0_11,negated_conjecture,
    accept_city(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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_9]) ).

cnf(c_0_13,plain,
    any_agent_in_all_proposed_teams(countryamedicalorganization,christiancountrychumanitarianorganization,coastvillage),
    inference(split_conjunct,[status(thm)],[event_38]) ).

cnf(c_0_14,plain,
    ( ~ accept_leader(X1,X2)
    | ~ the_agent_not_in_any_proposed_teams(X1,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_15,plain,
    the_agent_not_in_any_proposed_teams(countryamedicalorganization,christiancountrychumanitarianorganization,coastvillage),
    inference(split_conjunct,[status(thm)],[event_37]) ).

cnf(c_0_16,plain,
    accept_leader(countryamedicalorganization,christiancountrychumanitarianorganization),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : AGT015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.30  % Computer : n012.cluster.edu
% 0.05/0.30  % Model    : x86_64 x86_64
% 0.05/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30  % Memory   : 8046.5625MB
% 0.05/0.30  % OS       : Linux 6.8.0-71-generic
% 0.05/0.30  % CPULimit : 300
% 0.05/0.30  % WCLimit  : 300
% 0.05/0.30  % DateTime : Mon Sep 21 12:49:07 UTC 2026
% 0.05/0.30  % CPUTime  : 
% 0.05/0.30  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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.07/0.35  % Version: 3.5.1
% 0.07/0.35  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.07/0.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.07/0.35  % Starting new_bool_3 with 600s (2) cores
% 0.07/0.35  % Starting new_bool_1 with 600s (2) cores
% 0.07/0.35  % Starting sh5l with 300s (1) cores
% 0.07/0.35  % new_bool_3 with pid 2392431 completed with status 9
% 0.07/0.35  % sh5l with pid 2392433 completed with status 0
% 0.07/0.35  % Result found by sh5l
% 0.07/0.35  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.07/0.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.07/0.35  % Starting new_bool_3 with 600s (2) cores
% 0.07/0.35  % Starting new_bool_1 with 600s (2) cores
% 0.07/0.35  % Starting sh5l with 300s (1) cores
% 0.07/0.35  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.35  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.35  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.35  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.35  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.35  % SubtermCWHack with pid 2392442 completed with status 0
% 0.07/0.35  % Result found by SubtermCWHack
% 0.07/0.35  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.07/0.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.07/0.35  % Starting new_bool_3 with 600s (2) cores
% 0.07/0.35  % Starting new_bool_1 with 600s (2) cores
% 0.07/0.35  % Starting sh5l with 300s (1) cores
% 0.07/0.35  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.35  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.35  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.35  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.35  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.35  % Preprocessing time       : 0.002 s
% 0.07/0.35  
% 0.07/0.35  % Proof found!
% 0.07/0.35  % SZS status Theorem
% 0.07/0.35  % SZS output start CNFRefutation
% See solution above
% 0.07/0.35  % Parsed axioms                        : 556
% 0.07/0.35  % Removed by relevancy pruning/SinE    : 270
% 0.07/0.35  % Initial clauses                      : 299
% 0.07/0.35  % Removed in clause preprocessing      : 0
% 0.07/0.35  % Initial clauses in saturation        : 299
% 0.07/0.35  % Processed clauses                    : 352
% 0.07/0.35  % ...of these trivial                  : 19
% 0.07/0.35  % ...subsumed                          : 0
% 0.07/0.35  % ...remaining for further processing  : 333
% 0.07/0.35  % Other redundant clauses eliminated   : 2
% 0.07/0.35  % Clauses deleted for lack of memory   : 0
% 0.07/0.35  % Backward-subsumed                    : 0
% 0.07/0.35  % Backward-rewritten                   : 0
% 0.07/0.35  % Generated clauses                    : 98
% 0.07/0.35  % ...of the previous two non-redundant : 80
% 0.07/0.35  % ...aggressively subsumed             : 0
% 0.07/0.35  % Contextual simplify-reflections      : 0
% 0.07/0.35  % Paramodulations                      : 94
% 0.07/0.35  % Factorizations                       : 2
% 0.07/0.35  % NegExts                              : 0
% 0.07/0.35  % Equation resolutions                 : 2
% 0.07/0.35  % Disequality decompositions           : 0
% 0.07/0.35  % Total rewrite steps                  : 36
% 0.07/0.35  % ...of those cached                   : 5
% 0.07/0.35  % Propositional unsat checks           : 0
% 0.07/0.35  %    Propositional check models        : 0
% 0.07/0.35  %    Propositional check unsatisfiable : 0
% 0.07/0.35  %    Propositional clauses             : 0
% 0.07/0.35  %    Propositional clauses after purity: 0
% 0.07/0.35  %    Propositional unsat core size     : 0
% 0.07/0.35  %    Propositional preprocessing time  : 0.000
% 0.07/0.35  %    Propositional encoding time       : 0.000
% 0.07/0.35  %    Propositional solver time         : 0.000
% 0.07/0.35  %    Success case prop preproc time    : 0.000
% 0.07/0.35  %    Success case prop encoding time   : 0.000
% 0.07/0.35  %    Success case prop solver time     : 0.000
% 0.07/0.35  % Current number of processed clauses  : 331
% 0.07/0.35  %    Positive orientable unit clauses  : 265
% 0.07/0.35  %    Positive unorientable unit clauses: 0
% 0.07/0.35  %    Negative unit clauses             : 41
% 0.07/0.35  %    Non-unit-clauses                  : 25
% 0.07/0.35  % Current number of unprocessed clauses: 27
% 0.07/0.35  % ...number of literals in the above   : 76
% 0.07/0.35  % Current number of archived formulas  : 0
% 0.07/0.35  % Current number of archived clauses   : 0
% 0.07/0.35  % Clause-clause subsumption calls (NU) : 88
% 0.07/0.35  % Rec. Clause-clause subsumption calls : 79
% 0.07/0.35  % Non-unit clause-clause subsumptions  : 0
% 0.07/0.35  % Unit Clause-clause subsumption calls : 386
% 0.07/0.35  % Rewrite failures with RHS unbound    : 0
% 0.07/0.35  % BW rewrite match attempts            : 124
% 0.07/0.35  % BW rewrite match successes           : 0
% 0.07/0.35  % Condensation attempts                : 0
% 0.07/0.35  % Condensation successes               : 0
% 0.07/0.35  % Termbank termtop insertions          : 12678
% 0.07/0.35  % Search garbage collected termcells   : 1754
% 0.07/0.35  
% 0.07/0.35  % -------------------------------------------------
% 0.07/0.35  % User time                : 0.011 s
% 0.07/0.35  % System time              : 0.004 s
% 0.07/0.35  % Total time               : 0.015 s
% 0.07/0.35  % Maximum resident set size: 4852 pages
% 0.07/0.35  
% 0.07/0.35  % -------------------------------------------------
% 0.07/0.35  % User time                : 0.030 s
% 0.07/0.35  % System time              : 0.017 s
% 0.07/0.35  % Total time               : 0.047 s
% 0.07/0.35  % Maximum resident set size: 5376 pages
% 0.07/0.35  % E exiting
%------------------------------------------------------------------------------