↑ Up

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

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

% Computer : n020.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:18:11 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof('def(cond(conseq(axiom(3)), 17), 1)',axiom,
    ! [Vd249,Vd250] :
      ( leq(Vd250,Vd249)
    <=> ( Vd250 = Vd249
        | less(Vd250,Vd249) ) ),
    file('theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).

fof('ass(cond(goal(130), 0), 0)',axiom,
    ! [Vd203,Vd204] :
      ( less(Vd203,Vd204)
      | greater(Vd203,Vd204)
      | Vd203 = Vd204 ),
    file('theBenchmark.p','ass(cond(goal(130), 0), 0)') ).

fof('holds(244, 394, 0)',conjecture,
    greater(vd390,vd391),
    file('theBenchmark.p','holds(244, 394, 0)') ).

fof('holds(244, 394, 0)_neg',negated_conjecture,
    ~ greater(vd390,vd391),
    inference(assume_negation,[status(cth)],['holds(244, 394, 0)']) ).

fof('holds(conjunct2(243), 393, 0)',axiom,
    ~ leq(vd390,vd391),
    file('theBenchmark.p','holds(conjunct2(243), 393, 0)') ).

cnf(c_45,plain,
    ~ leq(vd390,vd391),
    inference(clausify,[status(thm)],['holds(conjunct2(243), 393, 0)']) ).

cnf(c_67,plain,
    ( ~ less(A,B)
    | leq(A,B) ),
    inference(clausify,[status(thm)],['def(cond(conseq(axiom(3)), 17), 1)']) ).

cnf(c_68,plain,
    ( B != A
    | leq(A,B) ),
    inference(clausify,[status(thm)],['def(cond(conseq(axiom(3)), 17), 1)']) ).

cnf(c_74,plain,
    ( less(B,A)
    | greater(B,A)
    | A = B ),
    inference(clausify,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).

cnf(c_102,negated_conjecture,
    ~ greater(vd390,vd391),
    inference(clausify,[status(thm)],['holds(244, 394, 0)_neg']) ).

cnf(c_117,plain,
    ~ less(vd390,vd391),
    inference(resolve,[status(thm)],[c_67,c_45]) ).

cnf(c_119,plain,
    vd391 != vd390,
    inference(resolve,[status(thm)],[c_68,c_45]) ).

cnf(c_242,plain,
    ( greater(vd390,vd391)
    | vd391 = vd390 ),
    inference(resolve,[status(thm)],[c_117,c_74]) ).

cnf(c_243,plain,
    greater(vd390,vd391),
    inference(resolve,[status(thm)],[c_119,c_242]) ).

cnf(c_241,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_102,c_243]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM843+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n020.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sat Sep 26 04:13:04 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36  % Process 574428 was started by sandbox2 on n020,
% 0.10/0.36  % Sat Sep 26 04:13:04 2026
% 0.10/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.37  
% 0.10/0.37  % From the command line: assign(max_seconds, 300).
% 0.13/0.41  
% 0.13/0.41  % SZS status Theorem for theBenchmark
% 0.13/0.41  
% 0.13/0.41  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.13/0.41  % Length of proof is 11.
% 0.13/0.41  % Level of proof is 3.
% 0.13/0.41  % Maximum clause weight is 9.000.
% 0.13/0.41  % Given clauses 54.
% 0.13/0.41  
% 0.13/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------