↑ Up

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

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(co1_8,axiom,
    ~ totalorderP(sk4),
    file('theBenchmark.p',co1_8) ).

cnf(c_41,plain,
    ~ totalorderP(sk4),
    inference(clausify,[status(thm)],[co1_8]) ).

fof(co1_7,axiom,
    totalorderP(sk2),
    file('theBenchmark.p',co1_7) ).

cnf(c_42,plain,
    totalorderP(sk2),
    inference(clausify,[status(thm)],[co1_7]) ).

fof(co1_5,axiom,
    sk2 = sk4,
    file('theBenchmark.p',co1_5) ).

cnf(c_45,plain,
    sk2 = sk4,
    inference(clausify,[status(thm)],[co1_5]) ).

cnf(c_46,plain,
    sk4 = sk2,
    inference(copy,[status(thm)],[c_45]) ).

cnf(c_275,plain,
    ~ totalorderP(sk2),
    inference(paramod,[status(thm)],[c_46,c_41]) ).

cnf(c_274,plain,
    $false,
    inference(resolve,[status(thm)],[c_42,c_275]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWC151-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.65  % Computer : n008.cluster.edu
% 0.15/0.65  % Model    : x86_64 x86_64
% 0.15/0.65  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.65  % Memory   : 8046.5625MB
% 0.15/0.65  % OS       : Linux 6.8.0-71-generic
% 0.15/0.65  % CPULimit : 300
% 0.15/0.65  % WCLimit  : 300
% 0.15/0.65  % DateTime : Sat Sep 26 12:21:54 UTC 2026
% 0.21/0.65  % CPUTime  : 
% 0.21/0.66  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.21/0.66  % Process 3645151 was started by sandbox on n008,
% 0.21/0.66  % Sat Sep 26 12:21:54 2026
% 0.21/0.66  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.21/0.67  
% 0.21/0.67  % From the command line: assign(max_seconds, 300).
% 0.22/0.73  
% 0.22/0.73  % SZS status Unsatisfiable for theBenchmark
% 0.22/0.73  
% 0.22/0.73  % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.22/0.73  % Length of proof is 5.
% 0.22/0.73  % Level of proof is 2.
% 0.22/0.73  % Maximum clause weight is 3.000.
% 0.22/0.73  % Given clauses 0.
% 0.22/0.73  
% 0.22/0.73  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------