↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : AGT003+1 : TPTP v9.2.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n023.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 : Tue May  5 04:03:45 PM UTC 2026

% Result   : Theorem 1.54s 1.82s
% Output   : CNFRefutation 1.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (  13 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   38 (  17   ~;  15   |;   5   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   27 (   6 sgn   8   !;   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/sandbox2/benchmark/Axioms/AGT001+0.ax',a1_1) ).

fof(event_26,axiom,
    accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+1.ax',event_26) ).

fof(event_90,axiom,
    accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+1.ax',event_90) ).

fof(event_93,axiom,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
    file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+1.ax',event_93) ).

fof(query_3,conjecture,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query_3) ).

fof(c_0_5,plain,
    ! [X88,X89,X90,X91] :
      ( ( accept_city(X88,X89)
        | ~ accept_team(X88,X91,X89,X90) )
      & ( accept_leader(X88,X91)
        | ~ accept_team(X88,X91,X89,X90) )
      & ( accept_number(X88,X90)
        | ~ accept_team(X88,X91,X89,X90) )
      & ( ~ accept_city(X88,X89)
        | ~ accept_leader(X88,X91)
        | ~ accept_number(X88,X90)
        | accept_team(X88,X91,X89,X90) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])]) ).

cnf(c_0_6,plain,
    ( accept_city(X1,X2)
    | ~ accept_team(X1,X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_7,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
    inference(split_conjunct,[status(thm)],[event_26]) ).

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

cnf(c_0_9,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

cnf(c_0_11,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
    inference(split_conjunct,[status(thm)],[event_90]) ).

cnf(c_0_12,plain,
    ( accept_team(christiansufferterrahumanitarianorganization,X1,towna,X2)
    | ~ accept_number(christiansufferterrahumanitarianorganization,X2)
    | ~ accept_leader(christiansufferterrahumanitarianorganization,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    accept_number(christiansufferterrahumanitarianorganization,n5),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( accept_leader(X1,X2)
    | ~ accept_team(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
    inference(split_conjunct,[status(thm)],[event_93]) ).

fof(c_0_16,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query_3])]) ).

cnf(c_0_17,plain,
    ( accept_team(christiansufferterrahumanitarianorganization,X1,towna,n5)
    | ~ accept_leader(christiansufferterrahumanitarianorganization,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : AGT003+1 : TPTP v9.2.1. Bugfixed v3.1.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n023.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 10:08:39 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.54/1.82  % Version  : CSE_E---1.7
% 1.54/1.82  % Problem  : theBenchmark.p
% 1.54/1.82  % SZS status Theorem for theBenchmark.p
% 1.54/1.82  % SZS output start CNFRefutation
% See solution above
% 1.54/1.83  % Total time : 1.426s
%------------------------------------------------------------------------------