↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n018.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 05:02:04 PM UTC 2026

% Result   : Unsatisfiable 1.23s 1.72s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (  14 unt;   0 nHn;  21 RR)
%            Number of literals    :   35 (   0 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(one_shaved_then_all_shaved,axiom,
    ( shaved(members,X1)
    | ~ member(X1)
    | ~ member(X2)
    | ~ shaved(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_shaved_then_all_shaved) ).

cnf(guido_has_shaved_cesare,hypothesis,
    shaved(guido,cesare),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',guido_has_shaved_cesare) ).

cnf(cesare,hypothesis,
    member(cesare),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cesare) ).

cnf(guido,hypothesis,
    member(guido),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',guido) ).

cnf(all_shaved_then_one_shaved,axiom,
    ( shaved(X2,X1)
    | ~ shaved(members,X1)
    | ~ member(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_shaved_then_one_shaved) ).

cnf(prove_petruchio_has_shaved_lorenzo,negated_conjecture,
    ~ shaved(petruchio,lorenzo),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_petruchio_has_shaved_lorenzo) ).

cnf(petruchio,hypothesis,
    member(petruchio),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',petruchio) ).

cnf(lorenzo,hypothesis,
    member(lorenzo),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lorenzo) ).

cnf(c_0_8,axiom,
    ( shaved(members,X1)
    | ~ member(X1)
    | ~ member(X2)
    | ~ shaved(X1,X2) ),
    one_shaved_then_all_shaved ).

cnf(c_0_9,hypothesis,
    shaved(guido,cesare),
    guido_has_shaved_cesare ).

cnf(c_0_10,hypothesis,
    member(cesare),
    cesare ).

cnf(c_0_11,hypothesis,
    member(guido),
    guido ).

cnf(c_0_12,axiom,
    ( shaved(X2,X1)
    | ~ shaved(members,X1)
    | ~ member(X2) ),
    all_shaved_then_one_shaved ).

cnf(c_0_13,hypothesis,
    shaved(members,guido),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).

cnf(c_0_14,hypothesis,
    ( shaved(X1,guido)
    | ~ member(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,hypothesis,
    ( shaved(members,X1)
    | ~ member(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_14]),c_0_11])]) ).

cnf(c_0_16,negated_conjecture,
    ~ shaved(petruchio,lorenzo),
    prove_petruchio_has_shaved_lorenzo ).

cnf(c_0_17,hypothesis,
    ( shaved(X1,X2)
    | ~ member(X1)
    | ~ member(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_18,hypothesis,
    member(petruchio),
    petruchio ).

cnf(c_0_19,hypothesis,
    member(lorenzo),
    lorenzo ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PUZ003-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n018.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 01:32:47 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.23/1.72  % Version  : CSE_E---1.7
% 1.23/1.72  % Problem  : theBenchmark.p
% 1.23/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.72  % SZS output start CNFRefutation
% See solution above
% 1.23/1.72  % Total time : 1.370s
%------------------------------------------------------------------------------