↑ Up

CSE_E---1.7.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN337-10 : TPTP v9.2.1. Released v7.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 : 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 05:36:50 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
    a2 != b2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(clause3,negated_conjecture,
    f(z(X1),X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    ifeq(f(b,X1),true,a2,b2) = b2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

cnf(clause2,negated_conjecture,
    f(z(X1),a) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

cnf(clause1,negated_conjecture,
    f(a,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

cnf(c_0_6,negated_conjecture,
    a2 != b2,
    goal,
    [final] ).

cnf(c_0_7,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom,
    [final] ).

cnf(c_0_8,negated_conjecture,
    f(z(X1),X1) = true,
    clause3,
    [final] ).

cnf(c_0_9,negated_conjecture,
    ifeq(f(b,X1),true,a2,b2) = b2,
    clause4,
    [final] ).

cnf(c_0_10,negated_conjecture,
    f(z(X1),a) = true,
    clause2,
    [final] ).

cnf(c_0_11,negated_conjecture,
    f(a,X1) = true,
    clause1,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN337-10 : TPTP v9.2.1. Released v7.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 : n028.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 08:29:01 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Satisfiable for theBenchmark.p
% 1.25/1.71  % SZS output start Saturation
% See solution above
% 1.25/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------