↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET073-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% 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  : 600s
% DateTime : Tue Jul 19 04:58:32 EDT 2022

% Result   : Unsatisfiable 55.32s 7.32s
% Output   : Proof 55.32s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    member(x,universal_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom1_1)]) ).

cnf(g1,plain,
    sPE(unordered_pair(x,y),null_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom1_2)]) ).

cnf(g2,plain,
    ( ~ sPE(unordered_pair(x,y),null_class)
    | subclass(unordered_pair(x,y),null_class) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',equal_implies_subclass1)]) ).

cnf(g3,plain,
    ( ~ sPE(x,null_class)
    | sPE(null_class,x) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ subclass(unordered_pair(x,y),null_class)
    | ~ member(x,unordered_pair(x,y))
    | member(x,null_class) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',subclass_members)]) ).

cnf(g5,plain,
    ( ~ member(x,universal_class)
    | member(x,unordered_pair(x,y)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',unordered_pair2)]) ).

cnf(g6,plain,
    ( ~ member(x,x)
    | ~ member(x,complement(x)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',complement1)]) ).

cnf(g7,plain,
    sPE(x,x),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(x,x)
    | ~ sPE(null_class,x)
    | ~ member(x,null_class)
    | member(x,x) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( sPE(x,null_class)
    | sPE(intersection(x,regular(x)),null_class) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',regularity2)]) ).

cnf(g10,plain,
    ( ~ sPE(unordered_pair(x,y),null_class)
    | ~ sPE(null_class,intersection(x,regular(x)))
    | sPE(unordered_pair(x,y),intersection(x,regular(x))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(intersection(x,regular(x)),null_class)
    | sPE(null_class,intersection(x,regular(x))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(x,x)
    | ~ sPE(unordered_pair(x,y),intersection(x,regular(x)))
    | ~ member(x,unordered_pair(x,y))
    | member(x,intersection(x,regular(x))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ member(x,intersection(x,regular(x)))
    | member(x,x) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',intersection1)]) ).

cnf(g14,plain,
    ( sPE(complement(x),null_class)
    | sPE(intersection(complement(x),regular(complement(x))),null_class) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',regularity2)]) ).

cnf(g15,plain,
    ( ~ subclass(null_class,complement(x))
    | ~ member(x,null_class)
    | member(x,complement(x)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',subclass_members)]) ).

cnf(g16,plain,
    ( ~ sPE(complement(x),null_class)
    | subclass(null_class,complement(x)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',equal_implies_subclass2)]) ).

cnf(g17,plain,
    ( ~ member(x,intersection(complement(x),regular(complement(x))))
    | member(x,complement(x)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',intersection1)]) ).

cnf(g18,plain,
    ( ~ sPE(x,x)
    | ~ sPE(null_class,intersection(complement(x),regular(complement(x))))
    | ~ member(x,null_class)
    | member(x,intersection(complement(x),regular(complement(x)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    ( ~ sPE(intersection(complement(x),regular(complement(x))),null_class)
    | sPE(null_class,intersection(complement(x),regular(complement(x)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET073-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 11:07:46 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 55.32/7.32  % symbols: 51
% 55.32/7.32  % clauses: 135
% 55.32/7.32  % start clauses: 2
% 55.32/7.32  % iterative deepening steps: 3793
% 55.32/7.32  % maximum path limit: 4
% 55.32/7.32  % literal attempts: 9534913
% 55.32/7.32  % depth failures: 8781679
% 55.32/7.32  % regularity failures: 112713
% 55.32/7.32  % tautology failures: 61611
% 55.32/7.32  % reductions: 274137
% 55.32/7.32  % extensions: 9260429
% 55.32/7.32  % SAT variables: 2939171
% 55.32/7.32  % SAT clauses: 2553972
% 55.32/7.32  % WalkSAT solutions: 2553886
% 55.32/7.32  % CDCL solutions: 79
% 55.32/7.32  % SZS status Unsatisfiable for theBenchmark
% 55.32/7.32  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------