↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN179-1 : TPTP v9.3.1. Released v1.1.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:37:14 AM UTC 2026

% Result   : Unsatisfiable 0.82s 0.54s
% Output   : CNFRefutation 0.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   44 (  21 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   84 (  48   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   65 (  11 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_30,axiom,
    n0(e,e),
    file('theBenchmark.p',axiom_30) ).

cnf(c_4,plain,
    n0(e,e),
    inference(clausify,[status(thm)],[axiom_30]) ).

fof(rule_255,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ n0(VAR_2,VAR_0)
      | ~ q2(VAR_2,VAR_0,VAR_1)
      | q3(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_255) ).

cnf(c_27,plain,
    ( ~ n0(C,A)
    | ~ q2(C,A,B)
    | q3(A,B) ),
    inference(clausify,[status(thm)],[rule_255]) ).

cnf(c_207,plain,
    ( ~ q2(e,e,A)
    | q3(e,A) ),
    inference(resolve,[status(thm)],[c_27,c_4]) ).

fof(prove_this,axiom,
    ! [VAR_0] : ~ q3(d,VAR_0),
    file('theBenchmark.p',prove_this) ).

cnf(c_264,plain,
    ~ q3(d,A),
    inference(clausify,[status(thm)],[prove_this]) ).

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

cnf(c_298,plain,
    ( ~ q3(B,A)
    | ~ p2(B,A,A)
    | q3(A,A) ),
    inference(clausify,[status(thm)],[rule_256]) ).

fof(rule_186,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ l1(VAR_1,VAR_0)
      | q2(VAR_0,VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_186) ).

cnf(c_325,plain,
    ( ~ l1(B,A)
    | q2(A,A,B) ),
    inference(clausify,[status(thm)],[rule_186]) ).

fof(rule_145,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p1(VAR_0,VAR_1,e)
      | ~ r0(e)
      | p2(e,VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_145) ).

cnf(c_360,plain,
    ( ~ p1(A,B,e)
    | ~ r0(e)
    | p2(e,A,B) ),
    inference(clausify,[status(thm)],[rule_145]) ).

fof(rule_085,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p0(VAR_1,VAR_0)
      | p1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_085) ).

cnf(c_406,plain,
    ( ~ p0(B,A)
    | p1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_085]) ).

fof(rule_082,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p1(VAR_2,VAR_0,VAR_3)
      | ~ m0(VAR_2,VAR_0,VAR_3)
      | p1(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',rule_082) ).

cnf(c_409,plain,
    ( ~ p1(C,A,D)
    | ~ m0(C,A,D)
    | p1(A,B,C) ),
    inference(clausify,[status(thm)],[rule_082]) ).

fof(rule_003,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ m0(VAR_1,VAR_0,VAR_2)
      | ~ r0(VAR_3)
      | ~ p0(VAR_2,VAR_0)
      | l1(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_003) ).

cnf(c_469,plain,
    ( ~ m0(B,A,C)
    | ~ r0(D)
    | ~ p0(C,A)
    | l1(A,B) ),
    inference(clausify,[status(thm)],[rule_003]) ).

fof(axiom_19,axiom,
    ! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
    file('theBenchmark.p',axiom_19) ).

cnf(c_485,plain,
    m0(A,d,B),
    inference(clausify,[status(thm)],[axiom_19]) ).

fof(axiom_14,axiom,
    ! [VAR_0] : p0(b,VAR_0),
    file('theBenchmark.p',axiom_14) ).

cnf(c_489,plain,
    p0(b,A),
    inference(clausify,[status(thm)],[axiom_14]) ).

fof(axiom_13,axiom,
    r0(e),
    file('theBenchmark.p',axiom_13) ).

cnf(c_490,plain,
    r0(e),
    inference(clausify,[status(thm)],[axiom_13]) ).

fof(axiom_12,axiom,
    ! [VAR_0] : m0(a,VAR_0,a),
    file('theBenchmark.p',axiom_12) ).

cnf(c_491,plain,
    m0(a,A,a),
    inference(clausify,[status(thm)],[axiom_12]) ).

cnf(c_619,plain,
    ( ~ p1(A,B,e)
    | p2(e,A,B) ),
    inference(resolve,[status(thm)],[c_490,c_360]) ).

cnf(c_672,plain,
    ( ~ q3(A,d)
    | ~ p2(A,d,d) ),
    inference(resolve,[status(thm)],[c_298,c_264]) ).

cnf(c_831,plain,
    p1(A,A,A),
    inference(resolve,[status(thm)],[c_489,c_406]) ).

cnf(c_1057,plain,
    ( ~ m0(B,A,b)
    | ~ r0(C)
    | l1(A,B) ),
    inference(resolve,[status(thm)],[c_469,c_489]) ).

cnf(c_1058,plain,
    ( ~ m0(B,A,b)
    | l1(A,B) ),
    inference(resolve,[status(thm)],[c_1057,c_490]) ).

cnf(c_871,plain,
    l1(d,A),
    inference(resolve,[status(thm)],[c_1058,c_485]) ).

cnf(c_948,plain,
    ( ~ q2(e,e,d)
    | ~ p2(e,d,d) ),
    inference(resolve,[status(thm)],[c_672,c_207]) ).

cnf(c_975,plain,
    q2(A,A,d),
    inference(resolve,[status(thm)],[c_871,c_325]) ).

cnf(c_977,plain,
    ~ p2(e,d,d),
    inference(resolve,[status(thm)],[c_975,c_948]) ).

cnf(c_994,plain,
    ~ p1(d,d,e),
    inference(resolve,[status(thm)],[c_977,c_619]) ).

cnf(c_1059,plain,
    ( ~ p1(e,d,A)
    | ~ m0(e,d,A) ),
    inference(resolve,[status(thm)],[c_994,c_409]) ).

cnf(c_1000,plain,
    ~ p1(e,d,A),
    inference(resolve,[status(thm)],[c_485,c_1059]) ).

cnf(c_1060,plain,
    ( ~ p1(A,e,B)
    | ~ m0(A,e,B) ),
    inference(resolve,[status(thm)],[c_409,c_1000]) ).

cnf(c_1025,plain,
    ~ p1(a,e,a),
    inference(resolve,[status(thm)],[c_1060,c_491]) ).

cnf(c_1061,plain,
    ( ~ p1(a,a,A)
    | ~ m0(a,a,A) ),
    inference(resolve,[status(thm)],[c_409,c_1025]) ).

cnf(c_1062,plain,
    ~ p1(a,a,a),
    inference(resolve,[status(thm)],[c_1061,c_491]) ).

cnf(c_1056,plain,
    $false,
    inference(resolve,[status(thm)],[c_831,c_1062]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN179-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n018.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 17:21:07 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.02/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.36  % Process 977696 was started by sandbox on n018,
% 0.02/0.36  % Sat Sep 26 17:21:07 2026
% 0.02/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.02/0.37  
% 0.02/0.37  % From the command line: assign(max_seconds, 300).
% 0.82/0.54  
% 0.82/0.54  % SZS status Unsatisfiable for theBenchmark
% 0.82/0.54  
% 0.82/0.54  % Proof 1 at 0.12 (+ 0.02) seconds.
% 0.82/0.54  % Length of proof is 25.
% 0.82/0.54  % Level of proof is 7.
% 0.82/0.54  % Maximum clause weight is 17.000.
% 0.82/0.54  % Given clauses 357.
% 0.82/0.54  
% 0.82/0.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------