↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MSC003-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n026.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 : Tue May  5 04:48:44 PM UTC 2026

% Result   : Unsatisfiable 1.24s 1.71s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (   6 unt;   4 nHn;  15 RR)
%            Number of literals    :   36 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-5 aty)
%            Number of variables   :   31 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(humans_have_two_arms,hypothesis,
    ( has_parts(X1,n2,arm)
    | ~ in(X1,human) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',humans_have_two_arms) ).

cnf(in_boy_in_human,hypothesis,
    ( in(X1,human)
    | ~ in(X1,boy) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_boy_in_human) ).

cnf(john_is_a_boy,hypothesis,
    in(john,boy),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',john_is_a_boy) ).

cnf(not_part_inheritance,axiom,
    ( in(object_in(X1,X2,X3,X4,X5),X2)
    | has_parts(X1,times(X4,X5),X3)
    | ~ has_parts(X1,X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_part_inheritance) ).

cnf(arms_have_one_hand,hypothesis,
    ( has_parts(X1,n1,hand)
    | ~ in(X1,arm) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arms_have_one_hand) ).

cnf(part_inheritance,axiom,
    ( has_parts(X1,times(X2,X3),X4)
    | ~ has_parts(X1,X2,X5)
    | ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_inheritance) ).

cnf(prove_john_has_2_hands,negated_conjecture,
    ~ has_parts(john,times(n2,n1),hand),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_john_has_2_hands) ).

cnf(c_0_7,hypothesis,
    ( has_parts(X1,n2,arm)
    | ~ in(X1,human) ),
    humans_have_two_arms ).

cnf(c_0_8,hypothesis,
    ( in(X1,human)
    | ~ in(X1,boy) ),
    in_boy_in_human ).

cnf(c_0_9,hypothesis,
    ( has_parts(X1,n2,arm)
    | ~ in(X1,boy) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,hypothesis,
    in(john,boy),
    john_is_a_boy ).

cnf(c_0_11,axiom,
    ( in(object_in(X1,X2,X3,X4,X5),X2)
    | has_parts(X1,times(X4,X5),X3)
    | ~ has_parts(X1,X4,X2) ),
    not_part_inheritance ).

cnf(c_0_12,hypothesis,
    has_parts(john,n2,arm),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,hypothesis,
    ( has_parts(X1,n1,hand)
    | ~ in(X1,arm) ),
    arms_have_one_hand ).

cnf(c_0_14,hypothesis,
    ( has_parts(john,times(n2,X1),X2)
    | in(object_in(john,arm,X2,n2,X1),arm) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,axiom,
    ( has_parts(X1,times(X2,X3),X4)
    | ~ has_parts(X1,X2,X5)
    | ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4) ),
    part_inheritance ).

cnf(c_0_16,hypothesis,
    ( has_parts(object_in(john,arm,X1,n2,X2),n1,hand)
    | has_parts(john,times(n2,X2),X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ~ has_parts(john,times(n2,n1),hand),
    prove_john_has_2_hands ).

cnf(c_0_18,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MSC003-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n026.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 23:34:38 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.24/1.71  % Version  : CSE_E---1.7
% 1.24/1.71  % Problem  : theBenchmark.p
% 1.24/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71  % SZS output start CNFRefutation
% See solution above
% 1.24/1.71  % Total time : 1.372s
%------------------------------------------------------------------------------