↑ Up

CSE_E---1.7.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL663+1.001 : TPTP v9.2.1. Released v4.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 : n025.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:44:05 PM UTC 2026

% Result   : CounterSatisfiable 0.26s 1.63s
% Output   : Saturation 0.26s
% Verified : 
% SZS Type : Derivation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   4 unt;   0 def)
%            Number of atoms       :    4 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    7 (   7   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    1 (   1 usr;   0 prp; 1-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    2 (   0 sgn   0   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(main,conjecture,
    ~ ? [X1] : ~ p1(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(c_0_1,negated_conjecture,
    ~ ~ ? [X1] : ~ p1(X1),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).

fof(c_0_2,negated_conjecture,
    ~ p1(esk1_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ p1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : LCL663+1.001 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.13  % 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.34  % Computer : n025.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Mon May  4 22:52:28 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 0.26/1.63  % Version  : CSE_E---1.7
% 0.26/1.63  % Problem  : theBenchmark.p
% 0.26/1.63  % SZS status CounterSatisfiable for theBenchmark.p
% 0.26/1.63  % SZS output start Saturation
% See solution above
% 0.26/1.63  % Total time : 1.271s
%------------------------------------------------------------------------------