↑ Up

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

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

% Computer : n005.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:40 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_happiness_2,axiom,
    ! [VAR_0,VAR_1] : response(a,VAR_0) != VAR_1,
    file('theBenchmark.p',prove_happiness_2) ).

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

cnf(c_3,plain,
    $false,
    inference(copy,[status(thm)],[c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : COL086-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40  % Computer : n005.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sat Sep 26 23:12:47 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.17/0.40  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.40  % Process 3344543 was started by sandbox2 on n005,
% 0.17/0.40  % Sat Sep 26 23:12:47 2026
% 0.17/0.40  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.41  
% 0.17/0.41  % From the command line: assign(max_seconds, 300).
% 0.17/0.42  
% 0.17/0.42  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.42  
% 0.17/0.42  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.42  % Length of proof is 2.
% 0.17/0.42  % Level of proof is 1.
% 0.17/0.42  % Maximum clause weight is 0.000.
% 0.17/0.42  % Given clauses 0.
% 0.17/0.42  
% 0.17/0.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------