↑ Up

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

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

% Computer : n015.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 08:03:06 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(xone_compat,axiom,
    ! [Vm,Vr] :
      ( ( Vr = conflict
        & Vm = compatible
        & is_verdict(Vr)
        & is_verdict(Vm) )
     => xone_verdict(Vm,Vr) = compatible ),
    file('theBenchmark.p',xone_compat) ).

fof(odrl644,conjecture,
    xone_verdict(compatible,conflict) = compatible,
    file('theBenchmark.p',odrl644) ).

fof(odrl644_neg,negated_conjecture,
    xone_verdict(compatible,conflict) != compatible,
    inference(assume_negation,[status(cth)],[odrl644]) ).

cnf(c_49,negated_conjecture,
    xone_verdict(compatible,conflict) != compatible,
    inference(clausify,[status(thm)],[odrl644_neg]) ).

fof(compatible_is_verdict,axiom,
    is_verdict(compatible),
    file('theBenchmark.p',compatible_is_verdict) ).

cnf(c_65,plain,
    is_verdict(compatible),
    inference(clausify,[status(thm)],[compatible_is_verdict]) ).

fof(conflict_is_verdict,axiom,
    is_verdict(conflict),
    file('theBenchmark.p',conflict_is_verdict) ).

cnf(c_66,plain,
    is_verdict(conflict),
    inference(clausify,[status(thm)],[conflict_is_verdict]) ).

cnf(c_80,plain,
    ( xone_verdict(A,B) = compatible
    | B != conflict
    | A != compatible
    | ~ is_verdict(B)
    | ~ is_verdict(A) ),
    inference(clausify,[status(thm)],[xone_compat]) ).

cnf(c_162,plain,
    ( xone_verdict(A,B) = compatible
    | B != conflict
    | compatible != A
    | ~ is_verdict(B)
    | ~ is_verdict(A) ),
    inference(copy,[status(thm)],[c_80]) ).

cnf(c_81,plain,
    ( xone_verdict(A,B) = compatible
    | conflict != B
    | compatible != A
    | ~ is_verdict(B)
    | ~ is_verdict(A) ),
    inference(copy,[status(thm)],[c_162]) ).

cnf(c_163,plain,
    ( xone_verdict(A,conflict) = compatible
    | conflict != conflict
    | compatible != A
    | ~ is_verdict(A) ),
    inference(resolve,[status(thm)],[c_81,c_66]) ).

cnf(c_164,plain,
    ( xone_verdict(compatible,conflict) = compatible
    | conflict != conflict
    | ~ is_verdict(compatible) ),
    inference(xxres,[status(thm)],[c_163]) ).

cnf(c_165,plain,
    ( xone_verdict(compatible,conflict) = compatible
    | ~ is_verdict(compatible) ),
    inference(xxres,[status(thm)],[c_164]) ).

cnf(c_166,negated_conjecture,
    ~ is_verdict(compatible),
    inference(resolve,[status(thm)],[c_165,c_49]) ).

cnf(c_161,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_65,c_166]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n015.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 00:15:42 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 2616941 was started by sandbox on n015,
% 0.08/0.36  % Sat Sep 26 00:15:42 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.38  
% 0.08/0.38  % From the command line: assign(max_seconds, 300).
% 0.08/0.39  
% 0.08/0.39  % SZS status Theorem for theBenchmark
% 0.08/0.39  
% 0.08/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.39  % Length of proof is 8.
% 0.08/0.39  % Level of proof is 3.
% 0.08/0.39  % Maximum clause weight is 25.000.
% 0.08/0.39  % Given clauses 27.
% 0.08/0.39  
% 0.08/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------