↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : REL003-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n021.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 19:57:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( sPE(join(converse(sk1),converse(sk2)),converse(sk2))
    | sPE(join(sk1,sk2),sk2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14)]) ).

cnf(g1,plain,
    ( ~ sPE(join(converse(sk1),converse(sk2)),converse(sk2))
    | ~ sPE(join(sk1,sk2),sk2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17)]) ).

cnf(g2,plain,
    ( ~ sPE(sk2,join(sk1,sk2))
    | sPE(join(sk1,sk2),sk2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    ( ~ sPE(converse(sk2),join(converse(sk1),converse(sk2)))
    | sPE(join(converse(sk1),converse(sk2)),converse(sk2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    ( ~ sPE(join(sk1,sk2),sk2)
    | sPE(sk2,join(sk1,sk2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ sPE(sk2,join(sk1,sk2))
    | sPE(converse(sk2),converse(join(sk1,sk2))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    sPE(converse(converse(sk2)),sk2),
    inference(ground_cnf,[],[file('Axioms/REL001-0.ax',converse_idempotence_8)]) ).

cnf(g7,plain,
    ( ~ sPE(converse(join(sk1,sk2)),join(converse(sk1),converse(sk2)))
    | ~ sPE(join(converse(sk1),converse(sk2)),converse(sk2))
    | sPE(converse(join(sk1,sk2)),converse(sk2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    sPE(converse(join(sk1,sk2)),join(converse(sk1),converse(sk2))),
    inference(ground_cnf,[],[file('Axioms/REL001-0.ax',converse_additivity_9)]) ).

cnf(g9,plain,
    ( ~ sPE(converse(join(sk1,sk2)),converse(sk2))
    | sPE(converse(converse(join(sk1,sk2))),converse(converse(sk2))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(converse(sk2),converse(join(sk1,sk2)))
    | ~ sPE(converse(join(sk1,sk2)),join(converse(sk1),converse(sk2)))
    | sPE(converse(sk2),join(converse(sk1),converse(sk2))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(converse(converse(join(sk1,sk2))),converse(converse(sk2)))
    | ~ sPE(converse(converse(sk2)),sk2)
    | sPE(converse(converse(join(sk1,sk2))),sk2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(sk2,converse(converse(join(sk1,sk2))))
    | ~ sPE(converse(converse(join(sk1,sk2))),join(sk1,sk2))
    | sPE(sk2,join(sk1,sk2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    sPE(converse(converse(join(sk1,sk2))),join(sk1,sk2)),
    inference(ground_cnf,[],[file('Axioms/REL001-0.ax',converse_idempotence_8)]) ).

cnf(g14,plain,
    ( ~ sPE(converse(converse(join(sk1,sk2))),sk2)
    | sPE(sk2,converse(converse(join(sk1,sk2)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : REL003-1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n021.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 : Fri Jul  8 09:46:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.36  % symbols: 12
% 0.18/0.36  % clauses: 23
% 0.18/0.36  % start clauses: 2
% 0.18/0.36  % iterative deepening steps: 281
% 0.18/0.36  % maximum path limit: 3
% 0.18/0.36  % literal attempts: 31875
% 0.18/0.36  % depth failures: 19750
% 0.18/0.36  % regularity failures: 752
% 0.18/0.36  % tautology failures: 788
% 0.18/0.36  % reductions: 6721
% 0.18/0.36  % extensions: 24897
% 0.18/0.36  % SAT variables: 6627
% 0.18/0.36  % SAT clauses: 7040
% 0.18/0.36  % WalkSAT solutions: 7034
% 0.18/0.36  % CDCL solutions: 0
% 0.18/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------