↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : AGT005+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n011.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 : Sun Sep 27 06:45:47 AM UTC 2026

% Result   : Theorem 0.24s 0.56s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (  11 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   17 (   8   ~;   6   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(a1_1,axiom,
    ! [A,C,N,L] :
      ( accept_team(A,L,C,N)
    <=> ( accept_number(A,N)
        & accept_leader(A,L)
        & accept_city(A,C) ) ),
    file('theBenchmark.p',a1_1) ).

fof(query_5,conjecture,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    file('theBenchmark.p',query_5) ).

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

cnf(c_489,plain,
    ( ~ accept_number(A,D)
    | ~ accept_leader(A,B)
    | ~ accept_city(A,C)
    | accept_team(A,B,C,D) ),
    inference(clausify,[status(thm)],[a1_1]) ).

fof(deduced_83,axiom,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    file('theBenchmark.p',deduced_83) ).

cnf(c_795,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(clausify,[status(thm)],[deduced_83]) ).

fof(deduced_84,axiom,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    file('theBenchmark.p',deduced_84) ).

cnf(c_796,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(clausify,[status(thm)],[deduced_84]) ).

fof(deduced_166,axiom,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    file('theBenchmark.p',deduced_166) ).

cnf(c_856,plain,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    inference(clausify,[status(thm)],[deduced_166]) ).

cnf(c_992,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(clausify,[status(thm)],[query_5_neg]) ).

cnf(c_1110,plain,
    ( ~ accept_number(christiansufferterrahumanitarianorganization,B)
    | ~ accept_leader(christiansufferterrahumanitarianorganization,A)
    | accept_team(christiansufferterrahumanitarianorganization,A,towna,B) ),
    inference(resolve,[status(thm)],[c_489,c_795]) ).

cnf(c_1111,plain,
    ( ~ accept_number(christiansufferterrahumanitarianorganization,A)
    | accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,A) ),
    inference(resolve,[status(thm)],[c_1110,c_796]) ).

cnf(c_1112,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(resolve,[status(thm)],[c_1111,c_856]) ).

cnf(c_1109,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_992,c_1112]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : AGT005+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.42  % Computer : n011.cluster.edu
% 0.15/0.42  % Model    : x86_64 x86_64
% 0.15/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42  % Memory   : 8046.5625MB
% 0.15/0.42  % OS       : Linux 6.8.0-71-generic
% 0.15/0.42  % CPULimit : 300
% 0.15/0.42  % WCLimit  : 300
% 0.15/0.42  % DateTime : Sat Sep 26 20:51:44 UTC 2026
% 0.15/0.43  % CPUTime  : 
% 0.15/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.43  % Process 1521479 was started by sandbox on n011,
% 0.15/0.43  % Sat Sep 26 20:51:44 2026
% 0.15/0.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.48  
% 0.15/0.48  % From the command line: assign(max_seconds, 300).
% 0.15/0.48  
% 0.15/0.48  % SInE: 539 to sos, 383 to usable, of 922 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.24/0.56  
% 0.24/0.56  % SZS status Theorem for theBenchmark
% 0.24/0.56  
% 0.24/0.56  % Proof 1 at 0.05 (+ 0.02) seconds.
% 0.24/0.56  % Length of proof is 8.
% 0.24/0.56  % Level of proof is 2.
% 0.24/0.56  % Maximum clause weight is 119.000.
% 0.24/0.56  % Given clauses 63.
% 0.24/0.56  
% 0.24/0.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------