↑ Up

PyRes---1.5.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SET085-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n017.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 : Thu May  9 17:39:09 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_singleton_in_unordered_pair3_4,negated_conjecture,
    x != z,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).

cnf(prove_singleton_in_unordered_pair3_3,negated_conjecture,
    x != y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).

cnf(unordered_pair_member,axiom,
    ( ~ member(X40,unordered_pair(X38,X39))
    | X40 = X38
    | X40 = X39 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).

cnf(equal_implies_subclass2,axiom,
    ( X14 != X15
    | subclass(X15,X14) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass2) ).

cnf(prove_singleton_in_unordered_pair3_1,negated_conjecture,
    unordered_pair(y,z) = singleton(x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).

cnf(c594,plain,
    subclass(singleton(x),unordered_pair(y,z)),
    inference(resolution,[status(thm)],[prove_singleton_in_unordered_pair3_1,equal_implies_subclass2]) ).

cnf(subclass_members,axiom,
    ( ~ subclass(X4,X5)
    | ~ member(X6,X4)
    | member(X6,X5) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(equal_implies_subclass1,axiom,
    ( X11 != X12
    | subclass(X11,X12) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass1) ).

cnf(singleton_set,axiom,
    unordered_pair(X44,X44) = singleton(X44),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).

cnf(c55,plain,
    subclass(unordered_pair(X45,X45),singleton(X45)),
    inference(resolution,[status(thm)],[singleton_set,equal_implies_subclass1]) ).

cnf(prove_singleton_in_unordered_pair3_2,negated_conjecture,
    member(x,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).

cnf(unordered_pair2,axiom,
    ( ~ member(X46,universal_class)
    | member(X46,unordered_pair(X46,X47)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).

cnf(c61,plain,
    member(x,unordered_pair(x,X51)),
    inference(resolution,[status(thm)],[unordered_pair2,prove_singleton_in_unordered_pair3_2]) ).

cnf(c70,plain,
    ( ~ subclass(unordered_pair(x,X372),X371)
    | member(x,X371) ),
    inference(resolution,[status(thm)],[c61,subclass_members]) ).

cnf(c1933,plain,
    member(x,singleton(x)),
    inference(resolution,[status(thm)],[c70,c55]) ).

cnf(c1939,plain,
    ( ~ subclass(singleton(x),X378)
    | member(x,X378) ),
    inference(resolution,[status(thm)],[c1933,subclass_members]) ).

cnf(c1975,plain,
    member(x,unordered_pair(y,z)),
    inference(resolution,[status(thm)],[c1939,c594]) ).

cnf(c2011,plain,
    ( x = y
    | x = z ),
    inference(resolution,[status(thm)],[c1975,unordered_pair_member]) ).

cnf(c2029,plain,
    x = z,
    inference(resolution,[status(thm)],[c2011,prove_singleton_in_unordered_pair3_3]) ).

cnf(c2088,plain,
    $false,
    inference(resolution,[status(thm)],[c2029,prove_singleton_in_unordered_pair3_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SET085-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed May  8 18:53:08 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 1.01/1.18  % Version:  1.5
% 1.01/1.18  % SZS status Unsatisfiable
% 1.01/1.18  % SZS output start CNFRefutation
% See solution above
% 1.01/1.18  
% 1.01/1.18  % Initial clauses    : 137
% 1.01/1.18  % Processed clauses  : 272
% 1.01/1.18  % Factors computed   : 10
% 1.01/1.18  % Resolvents computed: 2053
% 1.01/1.18  % Tautologies deleted: 10
% 1.01/1.18  % Forward subsumed   : 105
% 1.01/1.18  % Backward subsumed  : 2
% 1.01/1.18  % -------- CPU Time ---------
% 1.01/1.18  % User time          : 0.809 s
% 1.01/1.18  % System time        : 0.017 s
% 1.01/1.18  % Total time         : 0.826 s
%------------------------------------------------------------------------------