↑ Up

CSE_E---1.7.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KRS014-1 : TPTP v9.2.1. Released v2.0.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 : n013.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:36:09 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_2,axiom,
    ( s(X1,X2)
    | ~ e(X1)
    | ~ r(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_9,axiom,
    ( r(X1,u1r2(X1))
    | ~ r1exact(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_5,axiom,
    ( r1exact(X1)
    | ~ e(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_12,axiom,
    ( equalish(X1,u2r3(X2))
    | equalish(X1,u2r2(X2))
    | ~ s2exact(X2)
    | ~ s(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).

cnf(clause_4,axiom,
    ( s2exact(X1)
    | ~ e(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_14,axiom,
    ( s(X1,u2r2(X1))
    | ~ s2exact(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).

cnf(clause_1,negated_conjecture,
    e(exists),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_3,axiom,
    ( r(X1,X2)
    | ~ e(X1)
    | ~ s(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_15,axiom,
    ( s(X1,u2r3(X1))
    | ~ s2exact(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).

cnf(clause_17,axiom,
    ( s2exact(X1)
    | equalish(X2,X3)
    | ~ s(X1,X2)
    | ~ s(X1,X3)
    | ~ equalish(u2r1(X2,X3,X1),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).

cnf(clause_8,axiom,
    ( equalish(X1,u1r2(X2))
    | ~ r1exact(X2)
    | ~ r(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_16,axiom,
    ( s2exact(X1)
    | equalish(X2,X3)
    | ~ s(X1,X2)
    | ~ s(X1,X3)
    | ~ equalish(u2r1(X2,X3,X1),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).

cnf(clause_13,axiom,
    ( ~ s2exact(X1)
    | ~ equalish(u2r3(X1),u2r2(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).

cnf(clause_10,axiom,
    ( r1exact(X1)
    | ~ r(X1,X2)
    | ~ equalish(u1r1(X2,X1),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

cnf(clause_18,axiom,
    ( s2exact(X1)
    | equalish(X2,X3)
    | s(X1,u2r1(X2,X3,X1))
    | ~ s(X1,X2)
    | ~ s(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).

cnf(clause_6,axiom,
    ( e(X1)
    | s(X1,u0r1(X1))
    | r(X1,u0r1(X1))
    | ~ r1exact(X1)
    | ~ s2exact(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_11,axiom,
    ( r1exact(X1)
    | r(X1,u1r1(X2,X1))
    | ~ r(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

cnf(clause_7,axiom,
    ( e(X1)
    | ~ r1exact(X1)
    | ~ s2exact(X1)
    | ~ r(X1,u0r1(X1))
    | ~ s(X1,u0r1(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(c_0_18,axiom,
    ( s(X1,X2)
    | ~ e(X1)
    | ~ r(X1,X2) ),
    clause_2,
    [final] ).

cnf(c_0_19,axiom,
    ( r(X1,u1r2(X1))
    | ~ r1exact(X1) ),
    clause_9,
    [final] ).

cnf(c_0_20,axiom,
    ( r1exact(X1)
    | ~ e(X1) ),
    clause_5,
    [final] ).

cnf(c_0_21,axiom,
    ( equalish(X1,u2r3(X2))
    | equalish(X1,u2r2(X2))
    | ~ s2exact(X2)
    | ~ s(X2,X1) ),
    clause_12,
    [final] ).

cnf(c_0_22,plain,
    ( s(X1,u1r2(X1))
    | ~ e(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
    [final] ).

cnf(c_0_23,axiom,
    ( s2exact(X1)
    | ~ e(X1) ),
    clause_4,
    [final] ).

cnf(c_0_24,axiom,
    ( s(X1,u2r2(X1))
    | ~ s2exact(X1) ),
    clause_14,
    [final] ).

cnf(c_0_25,negated_conjecture,
    e(exists),
    clause_1,
    [final] ).

cnf(c_0_26,axiom,
    ( r(X1,X2)
    | ~ e(X1)
    | ~ s(X1,X2) ),
    clause_3,
    [final] ).

cnf(c_0_27,axiom,
    ( s(X1,u2r3(X1))
    | ~ s2exact(X1) ),
    clause_15,
    [final] ).

cnf(c_0_28,axiom,
    ( s2exact(X1)
    | equalish(X2,X3)
    | ~ s(X1,X2)
    | ~ s(X1,X3)
    | ~ equalish(u2r1(X2,X3,X1),X2) ),
    clause_17,
    [final] ).

cnf(c_0_29,axiom,
    ( equalish(X1,u1r2(X2))
    | ~ r1exact(X2)
    | ~ r(X2,X1) ),
    clause_8,
    [final] ).

cnf(c_0_30,axiom,
    ( s2exact(X1)
    | equalish(X2,X3)
    | ~ s(X1,X2)
    | ~ s(X1,X3)
    | ~ equalish(u2r1(X2,X3,X1),X3) ),
    clause_16,
    [final] ).

cnf(c_0_31,plain,
    ( equalish(u1r2(X1),u2r2(X1))
    | equalish(u1r2(X1),u2r3(X1))
    | ~ e(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
    [final] ).

cnf(c_0_32,plain,
    ( equalish(u2r2(X1),u2r2(X1))
    | equalish(u2r2(X1),u2r3(X1))
    | ~ s2exact(X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_24]),
    [final] ).

cnf(c_0_33,negated_conjecture,
    s2exact(exists),
    inference(spm,[status(thm)],[c_0_23,c_0_25]),
    [final] ).

cnf(c_0_34,axiom,
    ( ~ s2exact(X1)
    | ~ equalish(u2r3(X1),u2r2(X1)) ),
    clause_13,
    [final] ).

cnf(c_0_35,axiom,
    ( r1exact(X1)
    | ~ r(X1,X2)
    | ~ equalish(u1r1(X2,X1),X2) ),
    clause_10,
    [final] ).

cnf(c_0_36,plain,
    ( r(X1,u2r3(X1))
    | ~ e(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]),
    [final] ).

cnf(c_0_37,plain,
    ( r(X1,u2r2(X1))
    | ~ e(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_23]),
    [final] ).

cnf(c_0_38,plain,
    ( equalish(u1r2(X1),X2)
    | s2exact(X3)
    | ~ r1exact(X1)
    | ~ r(X1,u2r1(u1r2(X1),X2,X3))
    | ~ s(X3,u1r2(X1))
    | ~ s(X3,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]),
    [final] ).

cnf(c_0_39,plain,
    ( equalish(X1,u1r2(X2))
    | s2exact(X3)
    | ~ r1exact(X2)
    | ~ r(X2,u2r1(X1,u1r2(X2),X3))
    | ~ s(X3,u1r2(X2))
    | ~ s(X3,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_29]),
    [final] ).

cnf(c_0_40,negated_conjecture,
    ( equalish(u1r2(exists),u2r3(exists))
    | equalish(u1r2(exists),u2r2(exists)) ),
    inference(spm,[status(thm)],[c_0_31,c_0_25]),
    [final] ).

cnf(c_0_41,negated_conjecture,
    ( equalish(u2r2(exists),u2r3(exists))
    | equalish(u2r2(exists),u2r2(exists)) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]),
    [final] ).

cnf(c_0_42,plain,
    ( equalish(u2r3(X1),u2r3(X1))
    | ~ s2exact(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_34]),
    [final] ).

cnf(c_0_43,plain,
    ( r1exact(X1)
    | ~ r1exact(X2)
    | ~ r(X2,u1r1(u1r2(X2),X1))
    | ~ r(X1,u1r2(X2)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_29]),
    [final] ).

cnf(c_0_44,plain,
    ( s(X1,u2r3(X1))
    | ~ e(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_36]),
    [final] ).

cnf(c_0_45,axiom,
    ( s2exact(X1)
    | equalish(X2,X3)
    | s(X1,u2r1(X2,X3,X1))
    | ~ s(X1,X2)
    | ~ s(X1,X3) ),
    clause_18,
    [final] ).

cnf(c_0_46,axiom,
    ( e(X1)
    | s(X1,u0r1(X1))
    | r(X1,u0r1(X1))
    | ~ r1exact(X1)
    | ~ s2exact(X1) ),
    clause_6,
    [final] ).

cnf(c_0_47,plain,
    ( s(X1,u2r2(X1))
    | ~ e(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_37]),
    [final] ).

cnf(c_0_48,plain,
    ( r(X1,u1r2(X1))
    | ~ e(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_22]),
    [final] ).

cnf(c_0_49,axiom,
    ( r1exact(X1)
    | r(X1,u1r1(X2,X1))
    | ~ r(X1,X2) ),
    clause_11,
    [final] ).

cnf(c_0_50,axiom,
    ( e(X1)
    | ~ r1exact(X1)
    | ~ s2exact(X1)
    | ~ r(X1,u0r1(X1))
    | ~ s(X1,u0r1(X1)) ),
    clause_7,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS014-1 : TPTP v9.2.1. Released v2.0.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 : n013.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   : Mon May  4 20:34:56 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.25/1.72  % Version  : CSE_E---1.7
% 1.25/1.72  % Problem  : theBenchmark.p
% 1.25/1.72  % SZS status Satisfiable for theBenchmark.p
% 1.25/1.72  % SZS output start Saturation
% See solution above
% 1.25/1.72  % Total time : 1.373s
%------------------------------------------------------------------------------