↑ Up

CSE_E---1.7.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : HWC004-2 : TPTP v9.2.1. Released v2.5.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 : n028.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:28:41 PM UTC 2026

% Result   : Satisfiable 1.23s 1.71s
% Output   : Saturation 1.23s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(or_definition2,axiom,
    or(X1,n1) = n1,
    file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',or_definition2) ).

cnf(and_definition1,axiom,
    and(X1,n0) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',and_definition1) ).

cnf(or_definition1,axiom,
    or(X1,n0) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',or_definition1) ).

cnf(and_definition2,axiom,
    and(X1,n1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',and_definition2) ).

cnf(not_definition2,axiom,
    not(n1) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',not_definition2) ).

cnf(not_definition1,axiom,
    not(n0) = n1,
    file('/export/starexec/sandbox/benchmark/Axioms/HWC002-0.ax',not_definition1) ).

cnf(c_0_6,axiom,
    or(X1,n1) = n1,
    or_definition2,
    [final] ).

cnf(c_0_7,axiom,
    and(X1,n0) = n0,
    and_definition1,
    [final] ).

cnf(c_0_8,axiom,
    or(X1,n0) = X1,
    or_definition1,
    [final] ).

cnf(c_0_9,axiom,
    and(X1,n1) = X1,
    and_definition2,
    [final] ).

cnf(c_0_10,axiom,
    not(n1) = n0,
    not_definition2,
    [final] ).

cnf(c_0_11,axiom,
    not(n0) = n1,
    not_definition1,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : HWC004-2 : TPTP v9.2.1. Released v2.5.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.14/0.33  % Computer : n028.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 19:10:16 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.23/1.71  % Version  : CSE_E---1.7
% 1.23/1.71  % Problem  : theBenchmark.p
% 1.23/1.71  % SZS status Satisfiable for theBenchmark.p
% 1.23/1.71  % SZS output start Saturation
% See solution above
% 1.23/1.71  % Total time : 1.370s
%------------------------------------------------------------------------------