↑ Up

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

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

% Computer : n016.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:37:31 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(clause1,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( p(VAR_2,VAR_1,VAR_0)
      | ~ p(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',clause1) ).

cnf(c_1,plain,
    ( p(C,B,A)
    | ~ p(A,B,C) ),
    inference(clausify,[status(thm)],[clause1]) ).

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

cnf(c_2,plain,
    ( p(B,A,C)
    | ~ p(A,B,C) ),
    inference(clausify,[status(thm)],[clause2]) ).

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

cnf(c_3,plain,
    ( p(A,B,C)
    | ~ p(A,B,g(C)) ),
    inference(clausify,[status(thm)],[clause3]) ).

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

cnf(c_4,plain,
    ( p(A,B,C)
    | ~ p(f(A),B,C) ),
    inference(clausify,[status(thm)],[clause4]) ).

fof(clause5,axiom,
    ~ p(a,b,c),
    file('theBenchmark.p',clause5) ).

cnf(c_5,plain,
    ~ p(a,b,c),
    inference(clausify,[status(thm)],[clause5]) ).

fof(clause6,axiom,
    p(f(g(a)),f(g(b)),f(g(c))),
    file('theBenchmark.p',clause6) ).

cnf(c_6,plain,
    p(f(g(a)),f(g(b)),f(g(c))),
    inference(clausify,[status(thm)],[clause6]) ).

cnf(c_7,plain,
    p(g(a),f(g(b)),f(g(c))),
    inference(resolve,[status(thm)],[c_4,c_6]) ).

cnf(c_10,plain,
    p(f(g(b)),g(a),f(g(c))),
    inference(resolve,[status(thm)],[c_2,c_7]) ).

cnf(c_12,plain,
    p(g(b),g(a),f(g(c))),
    inference(resolve,[status(thm)],[c_4,c_10]) ).

cnf(c_15,plain,
    p(f(g(c)),g(a),g(b)),
    inference(resolve,[status(thm)],[c_1,c_12]) ).

cnf(c_17,plain,
    p(g(c),g(a),g(b)),
    inference(resolve,[status(thm)],[c_4,c_15]) ).

cnf(c_22,plain,
    p(g(c),g(a),b),
    inference(resolve,[status(thm)],[c_3,c_17]) ).

cnf(c_26,plain,
    p(b,g(a),g(c)),
    inference(resolve,[status(thm)],[c_1,c_22]) ).

cnf(c_28,plain,
    p(b,g(a),c),
    inference(resolve,[status(thm)],[c_3,c_26]) ).

cnf(c_32,plain,
    p(g(a),b,c),
    inference(resolve,[status(thm)],[c_2,c_28]) ).

cnf(c_34,plain,
    p(c,b,g(a)),
    inference(resolve,[status(thm)],[c_1,c_32]) ).

cnf(c_36,plain,
    p(c,b,a),
    inference(resolve,[status(thm)],[c_3,c_34]) ).

cnf(c_42,plain,
    p(a,b,c),
    inference(resolve,[status(thm)],[c_1,c_36]) ).

cnf(c_43,plain,
    $false,
    inference(resolve,[status(thm)],[c_42,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN310-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 17:37:00 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36  % Process 1389484 was started by sandbox2 on n016,
% 0.09/0.36  % Sat Sep 26 17:37:00 2026
% 0.09/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/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 19.
% 0.12/0.37  % Level of proof is 13.
% 0.12/0.37  % Maximum clause weight is 10.000.
% 0.12/0.37  % Given clauses 23.
% 0.12/0.37  
% 0.12/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------