↑ Up

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

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

% Computer : n003.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:48 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(query_15,conjecture,
    ? [X,Y] : ~ accept_city(X,Y),
    file('theBenchmark.p',query_15) ).

fof(query_15_neg,negated_conjecture,
    ~ ? [X,Y] : ~ accept_city(X,Y),
    inference(assume_negation,[status(cth)],[query_15]) ).

fof(deduced_366,axiom,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    file('theBenchmark.p',deduced_366) ).

cnf(c_983,plain,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(clausify,[status(thm)],[deduced_366]) ).

cnf(c_992,negated_conjecture,
    accept_city(A,B),
    inference(clausify,[status(thm)],[query_15_neg]) ).

cnf(c_993,plain,
    $false,
    inference(resolve,[status(thm)],[c_992,c_983]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : AGT015+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.61  % Computer : n003.cluster.edu
% 0.12/0.61  % Model    : x86_64 x86_64
% 0.12/0.61  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.61  % Memory   : 8046.5625MB
% 0.12/0.61  % OS       : Linux 6.8.0-71-generic
% 0.12/0.62  % CPULimit : 300
% 0.12/0.62  % WCLimit  : 300
% 0.12/0.62  % DateTime : Sat Sep 26 20:55:40 UTC 2026
% 0.12/0.62  % CPUTime  : 
% 0.12/0.62  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.62  % Process 3746079 was started by sandbox2 on n003,
% 0.12/0.62  % Sat Sep 26 20:55:40 2026
% 0.12/0.62  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.67  
% 0.17/0.67  % From the command line: assign(max_seconds, 300).
% 0.17/0.67  
% 0.17/0.67  % SInE: 539 to sos, 383 to usable, of 922 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.17/0.72  
% 0.17/0.72  % SZS status Theorem for theBenchmark
% 0.17/0.72  
% 0.17/0.72  % Proof 1 at 0.02 (+ 0.02) seconds.
% 0.17/0.72  % Length of proof is 4.
% 0.17/0.72  % Level of proof is 2.
% 0.17/0.72  % Maximum clause weight is 3.000.
% 0.17/0.72  % Given clauses 0.
% 0.17/0.72  
% 0.17/0.72  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------