↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : AGT005+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n017.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  : 600s
% DateTime : Thu Jul 14 11:57:48 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   27 (  19 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :   73 (  30   ~;  27   |;  14   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :   13 (  13 usr;  13 con; 0-0 aty)
%            Number of variables   :   23 (   5 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(a1_1,axiom,
    ! [X1,X2,X3,X4] :
      ( accept_team(X1,X4,X2,X3)
    <=> ( accept_city(X1,X2)
        & accept_leader(X1,X4)
        & accept_number(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a1_1) ).

fof(deduced_166,axiom,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_166) ).

fof(query_5,conjecture,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query_5) ).

fof(deduced_84,axiom,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_84) ).

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

fof(deduced_81,axiom,
    accept_population(christiansufferterrahumanitarianorganization,atheist,n75),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_81) ).

fof(deduced_80,axiom,
    accept_population(christiansufferterrahumanitarianorganization,christian,n24),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_80) ).

fof(deduced_172,axiom,
    accept_population(christiansufferterrahumanitarianorganization,muslim,n1),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_172) ).

fof(deduced_171,axiom,
    accept_population(christiansufferterrahumanitarianorganization,native,n0),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_171) ).

fof(deduced_85,axiom,
    accept_population(christiansufferterrahumanitarianorganization,other,n0),
    file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_85) ).

fof(c_0_10,plain,
    ! [X5,X6,X7,X8,X5,X6,X7,X8] :
      ( ( accept_city(X5,X6)
        | ~ accept_team(X5,X8,X6,X7) )
      & ( accept_leader(X5,X8)
        | ~ accept_team(X5,X8,X6,X7) )
      & ( accept_number(X5,X7)
        | ~ accept_team(X5,X8,X6,X7) )
      & ( ~ accept_city(X5,X6)
        | ~ accept_leader(X5,X8)
        | ~ accept_number(X5,X7)
        | accept_team(X5,X8,X6,X7) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])])])]) ).

cnf(c_0_11,plain,
    ( accept_team(X1,X2,X3,X4)
    | ~ accept_number(X1,X4)
    | ~ accept_leader(X1,X2)
    | ~ accept_city(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_12,plain,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    inference(split_conjunct,[status(thm)],[deduced_166]) ).

fof(c_0_13,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(assume_negation,[status(cth)],[query_5]) ).

cnf(c_0_14,plain,
    ( accept_team(christiansufferterrahumanitarianorganization,X1,X2,n3)
    | ~ accept_leader(christiansufferterrahumanitarianorganization,X1)
    | ~ accept_city(christiansufferterrahumanitarianorganization,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(split_conjunct,[status(thm)],[deduced_84]) ).

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

fof(c_0_17,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(fof_simplification,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    ( accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,X1,n3)
    | ~ accept_city(christiansufferterrahumanitarianorganization,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    ( accept_city(X1,towna)
    | ~ 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) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,plain,
    accept_population(christiansufferterrahumanitarianorganization,atheist,n75),
    inference(split_conjunct,[status(thm)],[deduced_81]) ).

cnf(c_0_21,plain,
    accept_population(christiansufferterrahumanitarianorganization,christian,n24),
    inference(split_conjunct,[status(thm)],[deduced_80]) ).

cnf(c_0_22,plain,
    accept_population(christiansufferterrahumanitarianorganization,muslim,n1),
    inference(split_conjunct,[status(thm)],[deduced_172]) ).

cnf(c_0_23,plain,
    accept_population(christiansufferterrahumanitarianorganization,native,n0),
    inference(split_conjunct,[status(thm)],[deduced_171]) ).

cnf(c_0_24,plain,
    accept_population(christiansufferterrahumanitarianorganization,other,n0),
    inference(split_conjunct,[status(thm)],[deduced_85]) ).

cnf(c_0_25,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_26,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : AGT005+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun  4 02:20:14 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.016 s
% 0.25/1.43  
% 0.25/1.43  # Failure: Out of unprocessed clauses!
% 0.25/1.43  # OLD status GaveUp
% 0.25/1.43  # Parsed axioms                        : 923
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 822
% 0.25/1.43  # Initial clauses                      : 101
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 101
% 0.25/1.43  # Processed clauses                    : 101
% 0.25/1.43  # ...of these trivial                  : 7
% 0.25/1.43  # ...subsumed                          : 0
% 0.25/1.43  # ...remaining for further processing  : 94
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 0
% 0.25/1.43  # ...of the previous two non-trivial   : 0
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 0
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 94
% 0.25/1.43  #    Positive orientable unit clauses  : 77
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 17
% 0.25/1.43  #    Non-unit-clauses                  : 0
% 0.25/1.43  # Current number of unprocessed clauses: 0
% 0.25/1.43  # ...number of literals in the above   : 0
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 0
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 114
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 27
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 7884
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.017 s
% 0.25/1.43  # System time              : 0.000 s
% 0.25/1.43  # Total time               : 0.017 s
% 0.25/1.43  # Maximum resident set size: 4268 pages
% 0.25/1.43  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.43  # Preprocessing time       : 0.039 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 27
% 0.25/1.43  # Proof object clause steps            : 13
% 0.25/1.43  # Proof object formula steps           : 14
% 0.25/1.43  # Proof object conjectures             : 4
% 0.25/1.43  # Proof object clause conjectures      : 1
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 10
% 0.25/1.43  # Proof object initial formulas used   : 10
% 0.25/1.43  # Proof object generating inferences   : 3
% 0.25/1.43  # Proof object simplifying inferences  : 7
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 923
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 996
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 996
% 0.25/1.43  # Processed clauses                    : 1013
% 0.25/1.43  # ...of these trivial                  : 44
% 0.25/1.43  # ...subsumed                          : 3
% 0.25/1.43  # ...remaining for further processing  : 966
% 0.25/1.43  # Other redundant clauses eliminated   : 2
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 1368
% 0.25/1.43  # ...of the previous two non-trivial   : 802
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 1364
% 0.25/1.43  # Factorizations                       : 2
% 0.25/1.43  # Equation resolutions                 : 2
% 0.25/1.43  # Current number of processed clauses  : 964
% 0.25/1.43  #    Positive orientable unit clauses  : 810
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 47
% 0.25/1.43  #    Non-unit-clauses                  : 107
% 0.25/1.43  # Current number of unprocessed clauses: 785
% 0.25/1.43  # ...number of literals in the above   : 1760
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 0
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 2569
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 917
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 2076
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 348
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 42992
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.070 s
% 0.25/1.43  # System time              : 0.006 s
% 0.25/1.43  # Total time               : 0.076 s
% 0.25/1.43  # Maximum resident set size: 8692 pages
%------------------------------------------------------------------------------