↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : PLA002-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 : n023.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:01:18 PM UTC 2026

% Result   : Unsatisfiable 1.24s 1.72s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (   9 unt;   2 nHn;  20 RR)
%            Number of literals    :   47 (   0 equ;  26 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   28 (  16 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(walk_b_to_a,hypothesis,
    ( at(a,walk(a,X1))
    | ~ at(b,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_b_to_a) ).

cnf(prove_you_can_get_to_a,negated_conjecture,
    ~ at(a,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a) ).

cnf(cross_river_c_to_b,hypothesis,
    ( at(b,skate(b,X1))
    | ~ cold(X1)
    | ~ at(c,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).

cnf(warm_or_cold,hypothesis,
    ( warm(X1)
    | cold(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).

cnf(go_d_to_c,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(d,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).

cnf(go_f_to_d,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(f,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).

cnf(climb_mountain_d_to_b,hypothesis,
    ( at(b,climb(b,X1))
    | ~ warm(X1)
    | ~ at(d,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).

cnf(initial,hypothesis,
    at(f,s0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).

cnf(c_0_8,hypothesis,
    ( at(a,walk(a,X1))
    | ~ at(b,X1) ),
    walk_b_to_a ).

cnf(c_0_9,negated_conjecture,
    ~ at(a,X1),
    prove_you_can_get_to_a ).

cnf(c_0_10,hypothesis,
    ( at(b,skate(b,X1))
    | ~ cold(X1)
    | ~ at(c,X1) ),
    cross_river_c_to_b ).

cnf(c_0_11,hypothesis,
    ~ at(b,X1),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,hypothesis,
    ( ~ at(c,X1)
    | ~ cold(X1) ),
    inference(sr,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,hypothesis,
    ( warm(X1)
    | cold(X2) ),
    warm_or_cold ).

cnf(c_0_14,hypothesis,
    ( warm(X1)
    | ~ at(c,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(d,X1) ),
    go_d_to_c ).

cnf(c_0_16,hypothesis,
    ( warm(X1)
    | ~ at(d,X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(f,X1) ),
    go_f_to_d ).

cnf(c_0_18,hypothesis,
    ( at(b,climb(b,X1))
    | ~ warm(X1)
    | ~ at(d,X1) ),
    climb_mountain_d_to_b ).

cnf(c_0_19,hypothesis,
    ( warm(X1)
    | ~ at(f,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,hypothesis,
    at(f,s0),
    initial ).

cnf(c_0_21,hypothesis,
    ( ~ at(d,X1)
    | ~ warm(X1) ),
    inference(sr,[status(thm)],[c_0_18,c_0_11]) ).

cnf(c_0_22,hypothesis,
    warm(X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,hypothesis,
    ~ at(d,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_24,hypothesis,
    ~ at(f,X1),
    inference(spm,[status(thm)],[c_0_23,c_0_17]) ).

cnf(c_0_25,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_20,c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PLA002-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.15/0.33  % Computer : n023.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   : Tue May  5 01:26:39 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.24/1.72  % Version  : CSE_E---1.7
% 1.24/1.72  % Problem  : theBenchmark.p
% 1.24/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.72  % SZS output start CNFRefutation
% See solution above
% 1.24/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------