↑ Up

CSE_E---1.7.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWX205+1 : TPTP v9.3.0. Released v9.3.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 : n007.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:34:43 PM UTC 2026

% Result   : CounterSatisfiable 1.24s 1.72s
% Output   : Saturation 1.24s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(goal_003,conjecture,
    ? [X1] : s(X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_003) ).

fof(axiom_002,axiom,
    ! [X1] : z != s(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).

fof(axiom_001,axiom,
    ! [X1] : proj1S(s(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] : s(X1) = X1,
    inference(assume_negation,[status(cth)],[goal_003]) ).

fof(c_0_4,negated_conjecture,
    ! [X7] : s(X7) != X7,
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

fof(c_0_5,plain,
    ! [X6] : z != s(X6),
    inference(variable_rename,[status(thm)],[axiom_002]) ).

fof(c_0_6,plain,
    ! [X5] : proj1S(s(X5)) = X5,
    inference(variable_rename,[status(thm)],[axiom_001]) ).

cnf(c_0_7,negated_conjecture,
    s(X1) != X1,
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_8,plain,
    z != s(X1),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_9,plain,
    proj1S(s(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWX205+1 : TPTP v9.3.0. Released v9.3.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 : n007.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 07:55: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 CounterSatisfiable for theBenchmark.p
% 1.24/1.72  % SZS output start Saturation
% See solution above
% 1.24/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------