↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n018.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:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(unordered_pair(x,y),null_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_1)]) ).

cnf(g1,plain,
    ~ member(x,universal_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_2)]) ).

cnf(g2,plain,
    ~ member(y,universal_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_3)]) ).

cnf(g3,plain,
    ( ~ member(unordered_pair(x,y),universal_class)
    | sPE(unordered_pair(x,y),null_class)
    | member(apply(choice,unordered_pair(x,y)),unordered_pair(x,y)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',choice2)]) ).

cnf(g4,plain,
    member(unordered_pair(x,y),universal_class),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',unordered_pairs_in_universal)]) ).

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

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

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

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

cnf(g9,plain,
    sPE(universal_class,universal_class),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    subclass(unordered_pair(x,y),universal_class),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',class_elements_are_sets)]) ).

cnf(g11,plain,
    ( ~ sPE(x,x)
    | ~ sPE(y,y)
    | sPE(unordered_pair(x,y),unordered_pair(x,y)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g13,plain,
    ( ~ sPE(apply(choice,unordered_pair(x,y)),y)
    | ~ sPE(unordered_pair(x,y),unordered_pair(x,y))
    | ~ member(apply(choice,unordered_pair(x,y)),unordered_pair(x,y))
    | member(y,unordered_pair(x,y)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(apply(choice,unordered_pair(x,y)),x)
    | ~ sPE(universal_class,universal_class)
    | ~ member(apply(choice,unordered_pair(x,y)),universal_class)
    | member(x,universal_class) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET071-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 10:28:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 4.22/0.97  % symbols: 51
% 4.22/0.97  % clauses: 136
% 4.22/0.97  % start clauses: 3
% 4.22/0.97  % iterative deepening steps: 549
% 4.22/0.97  % maximum path limit: 4
% 4.22/0.97  % literal attempts: 1887329
% 4.22/0.97  % depth failures: 1684962
% 4.22/0.97  % regularity failures: 65053
% 4.22/0.97  % tautology failures: 19019
% 4.22/0.97  % reductions: 27197
% 4.22/0.97  % extensions: 1858957
% 4.22/0.97  % SAT variables: 89648
% 4.22/0.97  % SAT clauses: 96872
% 4.22/0.97  % WalkSAT solutions: 96872
% 4.22/0.97  % CDCL solutions: 0
% 4.22/0.97  % SZS status Unsatisfiable for theBenchmark
% 4.22/0.97  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------