%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PLA006-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 12:59:14 EDT 2023

% Result   : Unsatisfiable 0.19s 0.58s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   33 (  12 unt;  16 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   26 (  15   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   9   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :   16 (   5 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    and: ( $i * $i ) > $i ).

tff(decl_23,type,
    holds: ( $i * $i ) > $o ).

tff(decl_24,type,
    holding: $i > $i ).

tff(decl_25,type,
    pickup: $i > $i ).

tff(decl_26,type,
    do: ( $i * $i ) > $i ).

tff(decl_27,type,
    empty: $i ).

tff(decl_28,type,
    clear: $i > $i ).

tff(decl_29,type,
    table: $i ).

tff(decl_30,type,
    differ: ( $i * $i ) > $o ).

tff(decl_31,type,
    on: ( $i * $i ) > $i ).

tff(decl_32,type,
    putdown: ( $i * $i ) > $i ).

tff(decl_33,type,
    a: $i ).

tff(decl_34,type,
    b: $i ).

tff(decl_35,type,
    c: $i ).

tff(decl_36,type,
    d: $i ).

tff(decl_37,type,
    s0: $i ).

cnf(prove_CTable,negated_conjecture,
    ~ holds(on(c,table),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_CTable) ).

cnf(putdown_2,axiom,
    ( holds(on(X1,X2),do(putdown(X1,X2),X3))
    | ~ holds(holding(X1),X3)
    | ~ holds(clear(X2),X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',putdown_2) ).

cnf(clear_table,axiom,
    holds(clear(table),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',clear_table) ).

cnf(pickup_1,axiom,
    ( holds(holding(X1),do(pickup(X1),X2))
    | ~ holds(empty,X2)
    | ~ holds(clear(X1),X2)
    | ~ differ(X1,table) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_1) ).

cnf(differ_c_table,axiom,
    differ(c,table),
    file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_c_table) ).

cnf(initial_state7,axiom,
    holds(clear(c),s0),
    file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state7) ).

cnf(initial_state8,axiom,
    holds(empty,s0),
    file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state8) ).

cnf(c_0_7,negated_conjecture,
    ~ holds(on(c,table),X1),
    prove_CTable ).

cnf(c_0_8,axiom,
    ( holds(on(X1,X2),do(putdown(X1,X2),X3))
    | ~ holds(holding(X1),X3)
    | ~ holds(clear(X2),X3) ),
    putdown_2 ).

cnf(c_0_9,axiom,
    holds(clear(table),X1),
    clear_table ).

cnf(c_0_10,negated_conjecture,
    ~ holds(holding(c),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

cnf(c_0_11,axiom,
    ( holds(holding(X1),do(pickup(X1),X2))
    | ~ holds(empty,X2)
    | ~ holds(clear(X1),X2)
    | ~ differ(X1,table) ),
    pickup_1 ).

cnf(c_0_12,axiom,
    differ(c,table),
    differ_c_table ).

cnf(c_0_13,negated_conjecture,
    ( ~ holds(clear(c),X1)
    | ~ holds(empty,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_14,axiom,
    holds(clear(c),s0),
    initial_state7 ).

cnf(c_0_15,axiom,
    holds(empty,s0),
    initial_state8 ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PLA006-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun Aug 27 06:36:05 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.58  % Version  : CSE_E---1.5
% 0.19/0.58  % Problem  : theBenchmark.p
% 0.19/0.58  % Proof found
% 0.19/0.58  % SZS status Theorem for theBenchmark.p
% 0.19/0.58  % SZS output start Proof
% See solution above
% 0.19/0.58  % Total time : 0.006000 s
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time : 0.008000 s
%------------------------------------------------------------------------------