↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET025-9 : 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 : n021.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:56 PM UTC 2026

% Result   : Unsatisfiable 1.17s 1.87s
% Output   : CNFRefutation 1.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   16 (  12 unt;   0 nHn;   9 RR)
%            Number of literals    :   20 (   8 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   16 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
    ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).

cnf(singleton_set,axiom,
    singleton_set(X1) = non_ordered_pair(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',singleton_set) ).

cnf(ordered_pair_predicate3,axiom,
    ( X1 = ordered_pair(f2(X1),f3(X1))
    | ~ ordered_pair_predicate(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).

cnf(non_ordered_pair4,axiom,
    little_set(non_ordered_pair(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).

cnf(an_ordered_pair_predicate,hypothesis,
    ordered_pair_predicate(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).

cnf(prove_predicate_is_small,negated_conjecture,
    ~ little_set(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_predicate_is_small) ).

cnf(c_0_6,axiom,
    ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
    ordered_pair ).

cnf(c_0_7,axiom,
    singleton_set(X1) = non_ordered_pair(X1,X1),
    singleton_set ).

cnf(c_0_8,axiom,
    ( X1 = ordered_pair(f2(X1),f3(X1))
    | ~ ordered_pair_predicate(X1) ),
    ordered_pair_predicate3 ).

cnf(c_0_9,plain,
    ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    little_set(non_ordered_pair(X1,X2)),
    non_ordered_pair4 ).

cnf(c_0_11,plain,
    ( X1 = non_ordered_pair(non_ordered_pair(f2(X1),f2(X1)),non_ordered_pair(f2(X1),f3(X1)))
    | ~ ordered_pair_predicate(X1) ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    ( little_set(X1)
    | ~ ordered_pair_predicate(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,hypothesis,
    ordered_pair_predicate(a),
    an_ordered_pair_predicate ).

cnf(c_0_14,negated_conjecture,
    ~ little_set(a),
    prove_predicate_is_small ).

cnf(c_0_15,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.22  % Problem    : SET025-9 : TPTP v9.2.1. Released v1.0.0.
% 0.02/0.22  % 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.11/0.45  % Computer : n021.cluster.edu
% 0.11/0.45  % Model    : x86_64 x86_64
% 0.11/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.45  % Memory   : 8042.1875MB
% 0.11/0.45  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.45  % CPULimit   : 300
% 0.11/0.45  % WCLimit    : 300
% 0.11/0.45  % DateTime   : Tue May  5 02:05:55 EDT 2026
% 0.11/0.45  % CPUTime    : 
% 0.11/0.46  % start to proof: theBenchmark
% 1.17/1.87  % Version  : CSE_E---1.7
% 1.17/1.87  % Problem  : theBenchmark.p
% 1.17/1.87  % SZS status Unsatisfiable for theBenchmark.p
% 1.17/1.87  % SZS output start CNFRefutation
% See solution above
% 1.17/1.87  % Total time : 1.382s
%------------------------------------------------------------------------------