↑ Up

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

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

% Computer : n019.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:20:21 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.38s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (  13 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   32 (  18   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 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   :   17 (   3 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pickup_1,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ differ(VAR_0,table)
      | ~ holds(clear(VAR_0),VAR_1)
      | ~ holds(empty,VAR_1)
      | holds(holding(VAR_0),do(pickup(VAR_0),VAR_1)) ),
    file('theBenchmark.p',pickup_1) ).

cnf(c_2,plain,
    ( ~ differ(A,table)
    | ~ holds(clear(A),B)
    | ~ holds(empty,B)
    | holds(holding(A),do(pickup(A),B)) ),
    inference(clausify,[status(thm)],[pickup_1]) ).

fof(putdown_2,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ holds(clear(VAR_1),VAR_2)
      | ~ holds(holding(VAR_0),VAR_2)
      | holds(on(VAR_0,VAR_1),do(putdown(VAR_0,VAR_1),VAR_2)) ),
    file('theBenchmark.p',putdown_2) ).

cnf(c_7,plain,
    ( ~ holds(clear(B),C)
    | ~ holds(holding(A),C)
    | holds(on(A,B),do(putdown(A,B),C)) ),
    inference(clausify,[status(thm)],[putdown_2]) ).

fof(differ_c_table,axiom,
    differ(c,table),
    file('theBenchmark.p',differ_c_table) ).

cnf(c_20,plain,
    differ(c,table),
    inference(clausify,[status(thm)],[differ_c_table]) ).

fof(initial_state7,axiom,
    holds(clear(c),s0),
    file('theBenchmark.p',initial_state7) ).

cnf(c_28,plain,
    holds(clear(c),s0),
    inference(clausify,[status(thm)],[initial_state7]) ).

fof(initial_state8,axiom,
    holds(empty,s0),
    file('theBenchmark.p',initial_state8) ).

cnf(c_29,plain,
    holds(empty,s0),
    inference(clausify,[status(thm)],[initial_state8]) ).

fof(clear_table,axiom,
    ! [VAR_0] : holds(clear(table),VAR_0),
    file('theBenchmark.p',clear_table) ).

cnf(c_30,plain,
    holds(clear(table),A),
    inference(clausify,[status(thm)],[clear_table]) ).

fof(prove_CTable,axiom,
    ! [VAR_0] : ~ holds(on(c,table),VAR_0),
    file('theBenchmark.p',prove_CTable) ).

cnf(c_31,plain,
    ~ holds(on(c,table),A),
    inference(clausify,[status(thm)],[prove_CTable]) ).

cnf(c_162,plain,
    ( ~ differ(A,table)
    | ~ holds(clear(A),s0)
    | holds(holding(A),do(pickup(A),s0)) ),
    inference(resolve,[status(thm)],[c_2,c_29]) ).

cnf(c_163,plain,
    ( ~ differ(c,table)
    | holds(holding(c),do(pickup(c),s0)) ),
    inference(resolve,[status(thm)],[c_162,c_28]) ).

cnf(c_124,plain,
    holds(holding(c),do(pickup(c),s0)),
    inference(resolve,[status(thm)],[c_163,c_20]) ).

cnf(c_164,plain,
    ( ~ holds(clear(table),A)
    | ~ holds(holding(c),A) ),
    inference(resolve,[status(thm)],[c_7,c_31]) ).

cnf(c_160,plain,
    ~ holds(holding(c),A),
    inference(resolve,[status(thm)],[c_164,c_30]) ).

cnf(c_161,plain,
    $false,
    inference(resolve,[status(thm)],[c_160,c_124]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PLA006-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n019.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 04:42:49 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35  % Process 423449 was started by sandbox2 on n019,
% 0.08/0.35  % Sat Sep 26 04:42:49 2026
% 0.08/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36  
% 0.08/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.38  
% 0.12/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.38  
% 0.12/0.38  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.12/0.38  % Length of proof is 10.
% 0.12/0.38  % Level of proof is 2.
% 0.12/0.38  % Maximum clause weight is 17.000.
% 0.12/0.38  % Given clauses 31.
% 0.12/0.38  
% 0.12/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------