↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : CAT002-3 : TPTP v9.2.1. Released v1.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 : n008.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:11:37 PM UTC 2026

% Result   : Unsatisfiable 1.28s 1.73s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (   9 unt;   0 nHn;  15 RR)
%            Number of literals    :   29 (  28 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cancellation_for_compose1,hypothesis,
    ( X1 = X3
    | compose(a,X1) != X2
    | compose(a,X3) != X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cancellation_for_compose1) ).

cnf(ab_h_equals_ab_g,hypothesis,
    compose(compose(a,b),h) = compose(compose(a,b),g),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_h_equals_ab_g) ).

cnf(associativity_of_compose,axiom,
    compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',associativity_of_compose) ).

cnf(cancellation_for_compose2,hypothesis,
    ( X1 = X3
    | compose(b,X1) != X2
    | compose(b,X3) != X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cancellation_for_compose2) ).

cnf(prove_g_equals_h,negated_conjecture,
    g != h,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_g_equals_h) ).

cnf(c_0_5,hypothesis,
    ( X1 = X3
    | compose(a,X1) != X2
    | compose(a,X3) != X2 ),
    cancellation_for_compose1 ).

cnf(c_0_6,hypothesis,
    compose(compose(a,b),h) = compose(compose(a,b),g),
    ab_h_equals_ab_g ).

cnf(c_0_7,axiom,
    compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
    associativity_of_compose ).

cnf(c_0_8,hypothesis,
    ( X1 = X2
    | compose(a,X1) != compose(a,X2) ),
    inference(er,[status(thm)],[c_0_5]) ).

cnf(c_0_9,hypothesis,
    compose(a,compose(b,g)) = compose(a,compose(b,h)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).

cnf(c_0_10,hypothesis,
    ( X1 = X3
    | compose(b,X1) != X2
    | compose(b,X3) != X2 ),
    cancellation_for_compose2 ).

cnf(c_0_11,hypothesis,
    ( compose(b,g) = X1
    | compose(a,compose(b,h)) != compose(a,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,hypothesis,
    ( X1 = X2
    | compose(b,X1) != compose(b,X2) ),
    inference(er,[status(thm)],[c_0_10]) ).

cnf(c_0_13,hypothesis,
    compose(b,g) = compose(b,h),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_14,hypothesis,
    ( g = X1
    | compose(b,h) != compose(b,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    g != h,
    prove_g_equals_h ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CAT002-3 : TPTP v9.2.1. Released v1.0.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.16/0.33  % Computer : n008.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 10:47:13 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.28/1.73  % Version  : CSE_E---1.7
% 1.28/1.73  % Problem  : theBenchmark.p
% 1.28/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.73  % SZS output start CNFRefutation
% See solution above
% 1.28/1.73  % Total time : 1.371s
%------------------------------------------------------------------------------