↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN557-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 : n014.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:49 AM UTC 2026

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

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

cnf(c_1,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_1]) ).

fof(not_p2_3,axiom,
    ~ p2(c6,f3(c8,f5(c9))),
    file('theBenchmark.p',not_p2_3) ).

cnf(c_3,plain,
    ~ p2(c6,f3(c8,f5(c9))),
    inference(clausify,[status(thm)],[not_p2_3]) ).

fof(p2_4,axiom,
    ! [VAR_0,VAR_1] : p2(f3(VAR_0,VAR_1),f3(VAR_1,VAR_0)),
    file('theBenchmark.p',p2_4) ).

cnf(c_4,plain,
    p2(f3(A,B),f3(B,A)),
    inference(clausify,[status(thm)],[p2_4]) ).

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

cnf(c_6,plain,
    ( ~ p2(C,B)
    | ~ p2(C,A)
    | p2(A,B) ),
    inference(clausify,[status(thm)],[p2_6]) ).

fof(p2_8,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p2(f3(VAR_0,VAR_2),f3(VAR_1,VAR_2))
      | p2(VAR_0,VAR_1) ),
    file('theBenchmark.p',p2_8) ).

cnf(c_8,plain,
    ( ~ p2(f3(A,C),f3(B,C))
    | p2(A,B) ),
    inference(clausify,[status(thm)],[p2_8]) ).

fof(p2_10,axiom,
    ! [VAR_0,VAR_1,VAR_2] : p2(f3(VAR_0,f3(VAR_1,VAR_2)),f3(VAR_1,f3(VAR_0,VAR_2))),
    file('theBenchmark.p',p2_10) ).

cnf(c_10,plain,
    p2(f3(A,f3(B,C)),f3(B,f3(A,C))),
    inference(clausify,[status(thm)],[p2_10]) ).

fof(p2_12,axiom,
    p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))),
    file('theBenchmark.p',p2_12) ).

cnf(c_12,plain,
    p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))),
    inference(clausify,[status(thm)],[p2_12]) ).

cnf(c_17,plain,
    ~ p2(f3(c6,A),f3(f3(c8,f5(c9)),A)),
    inference(resolve,[status(thm)],[c_8,c_3]) ).

cnf(c_67,plain,
    ( ~ p2(f3(B,f3(A,C)),D)
    | p2(f3(A,f3(B,C)),D) ),
    inference(resolve,[status(thm)],[c_6,c_10]) ).

cnf(c_20,plain,
    p2(f3(A,f3(B,C)),f3(f3(A,C),B)),
    inference(resolve,[status(thm)],[c_67,c_4]) ).

cnf(c_68,plain,
    ( ~ p2(f3(c6,f5(c7)),A)
    | p2(f3(c8,f3(f5(c7),f5(c9))),A) ),
    inference(resolve,[status(thm)],[c_6,c_12]) ).

cnf(c_26,plain,
    p2(f3(c8,f3(f5(c7),f5(c9))),f3(c6,f5(c7))),
    inference(resolve,[status(thm)],[c_68,c_1]) ).

cnf(c_69,plain,
    ( ~ p2(A,f3(f3(c8,f5(c9)),B))
    | ~ p2(A,f3(c6,B)) ),
    inference(resolve,[status(thm)],[c_6,c_17]) ).

cnf(c_65,plain,
    ~ p2(f3(c8,f3(A,f5(c9))),f3(c6,A)),
    inference(resolve,[status(thm)],[c_69,c_20]) ).

cnf(c_66,plain,
    $false,
    inference(resolve,[status(thm)],[c_65,c_26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN557-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.08/0.36  % Computer : n014.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 18:13:33 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.12/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36  % Process 3805994 was started by sandbox on n014,
% 0.12/0.36  % Sat Sep 26 18:13:33 2026
% 0.12/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.36  
% 0.12/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.37  
% 0.12/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.37  
% 0.12/0.37  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37  % Length of proof is 12.
% 0.12/0.37  % Level of proof is 3.
% 0.12/0.37  % Maximum clause weight is 22.000.
% 0.12/0.37  % Given clauses 25.
% 0.12/0.37  
% 0.12/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------