TSTP Solution File: NUM071-1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM071-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n010.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 : Mon Jul 18 13:58:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    well_ordering(xr,y),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_well_ordering_is_irreflexive_1)]) ).

cnf(g1,plain,
    member(ordered_pair(u,u),xr),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_well_ordering_is_irreflexive_2)]) ).

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

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

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

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

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

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

cnf(g8,plain,
    sPE(u,u),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ subclass(unordered_pair(u,u),y)
    | ~ member(u,unordered_pair(u,u))
    | ~ well_ordering(xr,y)
    | member(least(xr,unordered_pair(u,u)),unordered_pair(u,u)) ),
    inference(ground_cnf,[],[file('Axioms/NUM004-0.ax',well_ordering3)]) ).

cnf(g10,plain,
    ( subclass(unordered_pair(u,u),y)
    | member(not_subclass_element(unordered_pair(u,u),y),unordered_pair(u,u)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',not_subclass_members1)]) ).

cnf(g11,plain,
    ( ~ member(not_subclass_element(unordered_pair(u,u),y),y)
    | subclass(unordered_pair(u,u),y) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',not_subclass_members2)]) ).

cnf(g12,plain,
    ( ~ member(not_subclass_element(unordered_pair(u,u),y),unordered_pair(u,u))
    | sPE(not_subclass_element(unordered_pair(u,u),y),u)
    | sPE(not_subclass_element(unordered_pair(u,u),y),u) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',unordered_pair_member)]) ).

cnf(g13,plain,
    ( ~ subclass(unordered_pair(u,u),y)
    | ~ member(u,unordered_pair(u,u))
    | ~ member(ordered_pair(u,least(xr,unordered_pair(u,u))),xr)
    | ~ well_ordering(xr,y) ),
    inference(ground_cnf,[],[file('Axioms/NUM004-0.ax',well_ordering5)]) ).

cnf(g14,plain,
    ( ~ sPE(ordered_pair(u,u),ordered_pair(u,least(xr,unordered_pair(u,u))))
    | ~ sPE(xr,xr)
    | ~ member(ordered_pair(u,u),xr)
    | member(ordered_pair(u,least(xr,unordered_pair(u,u))),xr) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(ordered_pair(u,least(xr,unordered_pair(u,u))),ordered_pair(u,u))
    | sPE(ordered_pair(u,u),ordered_pair(u,least(xr,unordered_pair(u,u)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ member(least(xr,unordered_pair(u,u)),unordered_pair(u,u))
    | sPE(least(xr,unordered_pair(u,u)),u)
    | sPE(least(xr,unordered_pair(u,u)),u) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',unordered_pair_member)]) ).

cnf(g17,plain,
    ( ~ sPE(not_subclass_element(unordered_pair(u,u),y),u)
    | sPE(u,not_subclass_element(unordered_pair(u,u),y)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    ( ~ sPE(u,not_subclass_element(unordered_pair(u,u),y))
    | ~ sPE(y,y)
    | ~ member(u,y)
    | member(not_subclass_element(unordered_pair(u,u),y),y) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    ( ~ sPE(u,u)
    | ~ sPE(least(xr,unordered_pair(u,u)),u)
    | sPE(ordered_pair(u,least(xr,unordered_pair(u,u))),ordered_pair(u,u)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : NUM071-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.09/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jul  6 10:31:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 26.86/3.69  % symbols: 83
% 26.86/3.69  % clauses: 224
% 26.86/3.69  % start clauses: 3
% 26.86/3.69  % iterative deepening steps: 2000
% 26.86/3.69  % maximum path limit: 4
% 26.86/3.69  % literal attempts: 7749811
% 26.86/3.69  % depth failures: 6983678
% 26.86/3.69  % regularity failures: 129754
% 26.86/3.69  % tautology failures: 68217
% 26.86/3.69  % reductions: 261567
% 26.86/3.69  % extensions: 7487478
% 26.86/3.69  % SAT variables: 1278881
% 26.86/3.69  % SAT clauses: 1252131
% 26.86/3.69  % WalkSAT solutions: 1252121
% 26.86/3.69  % CDCL solutions: 9
% 26.86/3.69  % SZS status Unsatisfiable for theBenchmark
% 26.86/3.69  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------