TSTP Solution File: PUZ012-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n016.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 13:11:42 EDT 2023

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

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

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

tff(decl_24,type,
    label: ( $i * $i ) > $o ).

tff(decl_25,type,
    contains: ( $i * $i ) > $o ).

tff(decl_26,type,
    boxa: $i ).

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

tff(decl_28,type,
    boxc: $i ).

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

tff(decl_30,type,
    bananas: $i ).

tff(decl_31,type,
    oranges: $i ).

cnf(label_is_wrong,axiom,
    ( ~ label(X1,X2)
    | ~ contains(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_is_wrong) ).

cnf(boxb_labelled_oranges,hypothesis,
    label(boxb,oranges),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxb_labelled_oranges) ).

cnf(prove_boxa_contains_bananas_and_boxc_oranges,negated_conjecture,
    ( ~ contains(boxa,bananas)
    | ~ contains(boxc,oranges) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_boxa_contains_bananas_and_boxc_oranges) ).

cnf(each_thing_is_in_a_box,axiom,
    ( contains(boxa,X1)
    | contains(boxb,X1)
    | contains(boxc,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',each_thing_is_in_a_box) ).

cnf(boxa_labelled_apples,hypothesis,
    label(boxa,apples),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxa_labelled_apples) ).

cnf(each_box_contains_something,axiom,
    ( contains(X1,apples)
    | contains(X1,bananas)
    | contains(X1,oranges) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',each_box_contains_something) ).

cnf(contains_is_well_defined1,axiom,
    ( equal_fruits(X2,X3)
    | ~ contains(X1,X2)
    | ~ contains(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contains_is_well_defined1) ).

cnf(boxc_labelled_bananas,hypothesis,
    label(boxc,bananas),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxc_labelled_bananas) ).

cnf(bananas_not_oranges,axiom,
    ~ equal_fruits(bananas,oranges),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bananas_not_oranges) ).

cnf(apples_not_bananas,axiom,
    ~ equal_fruits(apples,bananas),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apples_not_bananas) ).

cnf(boxb_contains_apples,hypothesis,
    contains(boxb,apples),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxb_contains_apples) ).

cnf(c_0_11,axiom,
    ( ~ label(X1,X2)
    | ~ contains(X1,X2) ),
    label_is_wrong ).

cnf(c_0_12,hypothesis,
    label(boxb,oranges),
    boxb_labelled_oranges ).

cnf(c_0_13,negated_conjecture,
    ( ~ contains(boxa,bananas)
    | ~ contains(boxc,oranges) ),
    prove_boxa_contains_bananas_and_boxc_oranges ).

cnf(c_0_14,axiom,
    ( contains(boxa,X1)
    | contains(boxb,X1)
    | contains(boxc,X1) ),
    each_thing_is_in_a_box ).

cnf(c_0_15,hypothesis,
    ~ contains(boxb,oranges),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    label(boxa,apples),
    boxa_labelled_apples ).

cnf(c_0_17,negated_conjecture,
    ( contains(boxa,oranges)
    | ~ contains(boxa,bananas) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_18,axiom,
    ( contains(X1,apples)
    | contains(X1,bananas)
    | contains(X1,oranges) ),
    each_box_contains_something ).

cnf(c_0_19,hypothesis,
    ~ contains(boxa,apples),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_20,axiom,
    ( equal_fruits(X2,X3)
    | ~ contains(X1,X2)
    | ~ contains(X1,X3) ),
    contains_is_well_defined1 ).

cnf(c_0_21,negated_conjecture,
    contains(boxa,oranges),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_22,hypothesis,
    label(boxc,bananas),
    boxc_labelled_bananas ).

cnf(c_0_23,axiom,
    ~ equal_fruits(bananas,oranges),
    bananas_not_oranges ).

cnf(c_0_24,negated_conjecture,
    ( equal_fruits(X1,oranges)
    | ~ contains(boxa,X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,hypothesis,
    ~ contains(boxc,bananas),
    inference(spm,[status(thm)],[c_0_11,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ~ contains(boxa,bananas),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,hypothesis,
    contains(boxb,bananas),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_26]) ).

cnf(c_0_28,axiom,
    ~ equal_fruits(apples,bananas),
    apples_not_bananas ).

cnf(c_0_29,hypothesis,
    ( equal_fruits(X1,bananas)
    | ~ contains(boxb,X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_27]) ).

cnf(c_0_30,hypothesis,
    contains(boxb,apples),
    boxb_contains_apples ).

cnf(c_0_31,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 23:23:43 EDT 2023
% 0.13/0.35  % 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.005000 s
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time : 0.008000 s
%------------------------------------------------------------------------------