↑ Up

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

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

% Computer : n002.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:57:32 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(fond_bird_exists,axiom,
    response(a,b) = b,
    file('theBenchmark.p',fond_bird_exists) ).

cnf(c_1,plain,
    response(a,b) = b,
    inference(clausify,[status(thm)],[fond_bird_exists]) ).

fof(prove_happiness,axiom,
    ! [VAR_0,VAR_1] :
      ( response(a,VAR_1) != VAR_0
      | response(a,VAR_0) != VAR_1 ),
    file('theBenchmark.p',prove_happiness) ).

cnf(c_2,plain,
    ( response(a,B) != A
    | response(a,A) != B ),
    inference(clausify,[status(thm)],[prove_happiness]) ).

cnf(c_3,plain,
    response(a,A) != A,
    inference(factor,[status(thm)],[c_2]) ).

cnf(c_4,plain,
    $false,
    inference(resolve,[status(thm)],[c_3,c_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL055-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/5.57  % Computer : n002.cluster.edu
% 0.08/5.57  % Model    : x86_64 x86_64
% 0.08/5.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.57  % Memory   : 8046.5625MB
% 0.08/5.57  % OS       : Linux 6.8.0-71-generic
% 0.08/5.57  % CPULimit : 300
% 0.08/5.57  % WCLimit  : 300
% 0.08/5.57  % DateTime : Sat Sep 26 23:11:58 UTC 2026
% 0.08/5.57  % CPUTime  : 
% 0.08/5.57  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/5.57  % Process 2919803 was started by sandbox on n002,
% 0.08/5.57  % Sat Sep 26 23:11:58 2026
% 0.08/5.57  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/5.57  
% 0.08/5.57  % From the command line: assign(max_seconds, 300).
% 0.08/5.58  
% 0.08/5.58  % SZS status Unsatisfiable for theBenchmark
% 0.08/5.58  
% 0.08/5.58  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/5.58  % Length of proof is 4.
% 0.08/5.58  % Level of proof is 2.
% 0.08/5.58  % Maximum clause weight is 20.000.
% 0.08/5.58  % Given clauses 0.
% 0.08/5.58  
% 0.08/5.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------