↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET253-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 05:00:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ subclass(restrict(x,y,z),cross_product(y,z)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restriction_property4_1)]) ).

cnf(g1,plain,
    sPE(cross_product(y,z),cross_product(y,z)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    ( ~ sPE(intersection(x,cross_product(y,z)),restrict(x,y,z))
    | ~ sPE(cross_product(y,z),cross_product(y,z))
    | ~ subclass(intersection(x,cross_product(y,z)),cross_product(y,z))
    | subclass(restrict(x,y,z),cross_product(y,z)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(intersection(x,cross_product(y,z)),restrict(x,y,z)),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',restriction1)]) ).

cnf(g4,plain,
    ( subclass(intersection(x,cross_product(y,z)),cross_product(y,z))
    | member(not_subclass_element(intersection(x,cross_product(y,z)),cross_product(y,z)),intersection(x,cross_product(y,z))) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',not_subclass_members1)]) ).

cnf(g5,plain,
    ( ~ member(not_subclass_element(intersection(x,cross_product(y,z)),cross_product(y,z)),cross_product(y,z))
    | subclass(intersection(x,cross_product(y,z)),cross_product(y,z)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',not_subclass_members2)]) ).

cnf(g6,plain,
    ( ~ member(not_subclass_element(intersection(x,cross_product(y,z)),cross_product(y,z)),intersection(x,cross_product(y,z)))
    | member(not_subclass_element(intersection(x,cross_product(y,z)),cross_product(y,z)),cross_product(y,z)) ),
    inference(ground_cnf,[],[file('Axioms/SET004-0.ax',intersection2)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET253-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.14/0.33  % Computer : n025.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Sun Jul 10 16:06:01 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.36  % symbols: 61
% 0.14/0.36  % clauses: 160
% 0.14/0.36  % start clauses: 1
% 0.14/0.36  % iterative deepening steps: 108
% 0.14/0.36  % maximum path limit: 3
% 0.14/0.36  % literal attempts: 9382
% 0.14/0.36  % depth failures: 7024
% 0.14/0.36  % regularity failures: 366
% 0.14/0.36  % tautology failures: 181
% 0.14/0.36  % reductions: 688
% 0.14/0.36  % extensions: 8603
% 0.14/0.36  % SAT variables: 4622
% 0.14/0.36  % SAT clauses: 4475
% 0.14/0.36  % WalkSAT solutions: 4470
% 0.14/0.36  % CDCL solutions: 0
% 0.14/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------