↑ Up

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

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

% Computer : n018.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 09:38:59 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(p10_1,axiom,
    ! [VAR_0] : p10(VAR_0,VAR_0),
    file('theBenchmark.p',p10_1) ).

cnf(c_1,plain,
    p10(A,A),
    inference(clausify,[status(thm)],[p10_1]) ).

fof(p5_2,axiom,
    ! [VAR_0] : p5(VAR_0,VAR_0),
    file('theBenchmark.p',p5_2) ).

cnf(c_2,plain,
    p5(A,A),
    inference(clausify,[status(thm)],[p5_2]) ).

fof(p10_11,axiom,
    ! [VAR_0] : p10(f16(VAR_0,f14(f15(f7(c25)))),VAR_0),
    file('theBenchmark.p',p10_11) ).

cnf(c_11,plain,
    p10(f16(A,f14(f15(f7(c25)))),A),
    inference(clausify,[status(thm)],[p10_11]) ).

fof(p10_21,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p10(VAR_2,VAR_1)
      | ~ p10(VAR_2,VAR_0)
      | p10(VAR_0,VAR_1) ),
    file('theBenchmark.p',p10_21) ).

cnf(c_21,plain,
    ( ~ p10(C,B)
    | ~ p10(C,A)
    | p10(A,B) ),
    inference(clausify,[status(thm)],[p10_21]) ).

fof(p10_26,axiom,
    ! [VAR_0] : p10(f13(f6(c22),VAR_0),f13(f6(c24),f16(c26,VAR_0))),
    file('theBenchmark.p',p10_26) ).

cnf(c_26,plain,
    p10(f13(f6(c22),A),f13(f6(c24),f16(c26,A))),
    inference(clausify,[status(thm)],[p10_26]) ).

fof(not_p10_28,axiom,
    ~ p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))),
    file('theBenchmark.p',not_p10_28) ).

cnf(c_28,plain,
    ~ p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))),
    inference(clausify,[status(thm)],[not_p10_28]) ).

fof(p10_32,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p5(VAR_0,VAR_2)
      | ~ p10(VAR_1,VAR_3)
      | p10(f13(VAR_0,VAR_1),f13(VAR_2,VAR_3)) ),
    file('theBenchmark.p',p10_32) ).

cnf(c_32,plain,
    ( ~ p5(A,C)
    | ~ p10(B,D)
    | p10(f13(A,B),f13(C,D)) ),
    inference(clausify,[status(thm)],[p10_32]) ).

cnf(c_47,plain,
    ( ~ p10(B,A)
    | p10(A,B) ),
    inference(resolve,[status(thm)],[c_21,c_1]) ).

cnf(c_66,plain,
    ( ~ p10(B,C)
    | p10(f13(A,B),f13(A,C)) ),
    inference(resolve,[status(thm)],[c_32,c_2]) ).

cnf(c_97,plain,
    p10(f13(f6(c24),f16(c26,A)),f13(f6(c22),A)),
    inference(resolve,[status(thm)],[c_47,c_26]) ).

cnf(c_137,plain,
    p10(f13(A,f16(B,f14(f15(f7(c25))))),f13(A,B)),
    inference(resolve,[status(thm)],[c_66,c_11]) ).

cnf(c_266,plain,
    ( ~ p10(A,f13(f6(c22),f14(f15(f7(c25)))))
    | ~ p10(A,f13(f6(c24),c26)) ),
    inference(resolve,[status(thm)],[c_21,c_28]) ).

cnf(c_267,plain,
    ~ p10(f13(f6(c24),f16(c26,f14(f15(f7(c25))))),f13(f6(c24),c26)),
    inference(resolve,[status(thm)],[c_266,c_97]) ).

cnf(c_265,plain,
    $false,
    inference(resolve,[status(thm)],[c_137,c_267]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN624-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.56  % Computer : n018.cluster.edu
% 0.09/0.56  % Model    : x86_64 x86_64
% 0.09/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56  % Memory   : 8046.5625MB
% 0.09/0.56  % OS       : Linux 6.8.0-71-generic
% 0.09/0.56  % CPULimit : 300
% 0.09/0.56  % WCLimit  : 300
% 0.09/0.56  % DateTime : Sat Sep 26 18:19:23 UTC 2026
% 0.09/0.57  % CPUTime  : 
% 0.09/0.57  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.57  % Process 1093605 was started by sandbox on n018,
% 0.09/0.57  % Sat Sep 26 18:19:23 2026
% 0.09/0.57  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.57  
% 0.09/0.57  % From the command line: assign(max_seconds, 300).
% 0.09/0.61  
% 0.09/0.61  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.61  
% 0.09/0.61  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.09/0.61  % Length of proof is 12.
% 0.09/0.61  % Level of proof is 3.
% 0.09/0.61  % Maximum clause weight is 24.000.
% 0.09/0.61  % Given clauses 117.
% 0.09/0.61  
% 0.09/0.61  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------