↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : COL088-1 : TPTP v9.2.1. Released v2.7.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 : 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:12:17 PM UTC 2026

% Result   : Unsatisfiable 24.01s 16.10s
% Output   : CNFRefutation 24.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   28 (  13 unt;   0 nHn;  26 RR)
%            Number of literals    :   57 (   0 equ;  32 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   40 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(reduction_rls_3,axiom,
    ( member(pair(comb_app(X1,X3),X4),rtrancl(contract))
    | ~ member(pair(X1,X2),contract)
    | ~ member(X3,comb)
    | ~ member(pair(comb_app(X2,X3),X4),rtrancl(contract)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reduction_rls_3) ).

cnf(reduction_refl,axiom,
    ( member(pair(X1,X1),rtrancl(contract))
    | ~ member(X1,comb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reduction_refl) ).

cnf(ap_E2,axiom,
    ( member(X2,comb)
    | ~ member(comb_app(X1,X2),comb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_E2) ).

cnf(transD,axiom,
    ( member(pair(X2,X4),X1)
    | ~ trans(X1)
    | ~ member(pair(X2,X3),X1)
    | ~ member(pair(X3,X4),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transD) ).

cnf(trans_rtrancl,axiom,
    trans(rtrancl(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',trans_rtrancl) ).

cnf(ap_reduce1_2h5,hypothesis,
    member(pair(comb_app(p,r),comb_app(y,r)),rtrancl(contract)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce1_2h5) ).

cnf(ap_reduce1_2c1,negated_conjecture,
    ~ member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce1_2c1) ).

cnf(ap_reduce1_2h4,hypothesis,
    member(pair(y,z),contract),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce1_2h4) ).

cnf(contract_combD2,axiom,
    ( member(X2,comb)
    | ~ member(pair(X1,X2),contract) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contract_combD2) ).

cnf(comb_intros3,axiom,
    ( member(comb_app(X1,X2),comb)
    | ~ member(X1,comb)
    | ~ member(X2,comb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',comb_intros3) ).

cnf(ap_reduce1_2h1,hypothesis,
    member(r,comb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_reduce1_2h1) ).

cnf(c_0_11,axiom,
    ( member(pair(comb_app(X1,X3),X4),rtrancl(contract))
    | ~ member(pair(X1,X2),contract)
    | ~ member(X3,comb)
    | ~ member(pair(comb_app(X2,X3),X4),rtrancl(contract)) ),
    reduction_rls_3 ).

cnf(c_0_12,axiom,
    ( member(pair(X1,X1),rtrancl(contract))
    | ~ member(X1,comb) ),
    reduction_refl ).

cnf(c_0_13,axiom,
    ( member(X2,comb)
    | ~ member(comb_app(X1,X2),comb) ),
    ap_E2 ).

cnf(c_0_14,axiom,
    ( member(pair(X2,X4),X1)
    | ~ trans(X1)
    | ~ member(pair(X2,X3),X1)
    | ~ member(pair(X3,X4),X1) ),
    transD ).

cnf(c_0_15,plain,
    ( member(pair(comb_app(X1,X2),comb_app(X3,X2)),rtrancl(contract))
    | ~ member(pair(X1,X3),contract)
    | ~ member(comb_app(X3,X2),comb) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_16,axiom,
    trans(rtrancl(X1)),
    trans_rtrancl ).

cnf(c_0_17,plain,
    ( member(pair(X1,comb_app(X2,X3)),rtrancl(contract))
    | ~ member(pair(X1,comb_app(X4,X3)),rtrancl(contract))
    | ~ member(pair(X4,X2),contract)
    | ~ member(comb_app(X2,X3),comb) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_18,hypothesis,
    member(pair(comb_app(p,r),comb_app(y,r)),rtrancl(contract)),
    ap_reduce1_2h5 ).

cnf(c_0_19,negated_conjecture,
    ~ member(pair(comb_app(p,r),comb_app(z,r)),rtrancl(contract)),
    ap_reduce1_2c1 ).

cnf(c_0_20,hypothesis,
    ( member(pair(comb_app(p,r),comb_app(X1,r)),rtrancl(contract))
    | ~ member(pair(y,X1),contract)
    | ~ member(comb_app(X1,r),comb) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,hypothesis,
    member(pair(y,z),contract),
    ap_reduce1_2h4 ).

cnf(c_0_22,axiom,
    ( member(X2,comb)
    | ~ member(pair(X1,X2),contract) ),
    contract_combD2 ).

cnf(c_0_23,negated_conjecture,
    ~ member(comb_app(z,r),comb),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_24,axiom,
    ( member(comb_app(X1,X2),comb)
    | ~ member(X1,comb)
    | ~ member(X2,comb) ),
    comb_intros3 ).

cnf(c_0_25,hypothesis,
    member(r,comb),
    ap_reduce1_2h1 ).

cnf(c_0_26,hypothesis,
    member(z,comb),
    inference(spm,[status(thm)],[c_0_22,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : COL088-1 : TPTP v9.2.1. Released v2.7.0.
% 0.00/0.10  % 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.12/0.31  % Computer : n025.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit   : 300
% 0.12/0.31  % WCLimit    : 300
% 0.12/0.31  % DateTime   : Mon May  4 16:17:13 EDT 2026
% 0.12/0.31  % CPUTime    : 
% 0.12/0.32  % start to proof: theBenchmark
% 24.01/16.10  % Version  : CSE_E---1.7
% 24.01/16.10  % Problem  : theBenchmark.p
% 24.01/16.10  % SZS status Unsatisfiable for theBenchmark.p
% 24.01/16.10  % SZS output start CNFRefutation
% See solution above
% 24.12/16.16  % Total time : 13.393s
%------------------------------------------------------------------------------