↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET031-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 : n014.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:06:58 PM UTC 2026

% Result   : Unsatisfiable 49.28s 29.51s
% Output   : CNFRefutation 49.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (   4 unt;   2 nHn;  15 RR)
%            Number of literals    :   37 (   4 equ;  19 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   35 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair_predicate4,axiom,
    ( ordered_pair_predicate(X1)
    | ~ little_set(X2)
    | ~ little_set(X3)
    | X1 != ordered_pair(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate4) ).

cnf(compose4,axiom,
    ( X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3))
    | ~ member(X1,compose(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose4) ).

cnf(compose1,axiom,
    ( little_set(f29(X1,X2,X3))
    | ~ member(X1,compose(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose1) ).

cnf(compose2,axiom,
    ( little_set(f30(X1,X2,X3))
    | ~ member(X1,compose(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose2) ).

cnf(relation2,axiom,
    ( relation(X1)
    | member(f18(X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',relation2) ).

cnf(relation3,axiom,
    ( relation(X1)
    | ~ ordered_pair_predicate(f18(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',relation3) ).

cnf(prove_composition_is_a_relation,negated_conjecture,
    ~ relation(compose(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_composition_is_a_relation) ).

cnf(c_0_7,axiom,
    ( ordered_pair_predicate(X1)
    | ~ little_set(X2)
    | ~ little_set(X3)
    | X1 != ordered_pair(X2,X3) ),
    ordered_pair_predicate4 ).

cnf(c_0_8,plain,
    ( ordered_pair_predicate(ordered_pair(X1,X2))
    | ~ little_set(X2)
    | ~ little_set(X1) ),
    inference(er,[status(thm)],[c_0_7]) ).

cnf(c_0_9,axiom,
    ( X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3))
    | ~ member(X1,compose(X2,X3)) ),
    compose4 ).

cnf(c_0_10,axiom,
    ( little_set(f29(X1,X2,X3))
    | ~ member(X1,compose(X2,X3)) ),
    compose1 ).

cnf(c_0_11,axiom,
    ( little_set(f30(X1,X2,X3))
    | ~ member(X1,compose(X2,X3)) ),
    compose2 ).

cnf(c_0_12,plain,
    ( ordered_pair_predicate(X1)
    | ~ member(X1,compose(X2,X3)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).

cnf(c_0_13,axiom,
    ( relation(X1)
    | member(f18(X1),X1) ),
    relation2 ).

cnf(c_0_14,axiom,
    ( relation(X1)
    | ~ ordered_pair_predicate(f18(X1)) ),
    relation3 ).

cnf(c_0_15,negated_conjecture,
    ~ relation(compose(a,b)),
    prove_composition_is_a_relation ).

cnf(c_0_16,plain,
    relation(compose(X1,X2)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SET031-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11  % 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 : n014.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 02:05:51 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 49.28/29.51  % Version  : CSE_E---1.7
% 49.28/29.51  % Problem  : theBenchmark.p
% 49.28/29.51  % SZS status Unsatisfiable for theBenchmark.p
% 49.28/29.51  % SZS output start CNFRefutation
% See solution above
% 49.47/29.71  % Total time : 21.430s
%------------------------------------------------------------------------------