↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL362-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 01:03:39 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_11)]) ).

cnf(g1,plain,
    is_a_theorem(implies(implies(not(y),y),y)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2)]) ).

cnf(g2,plain,
    ( ~ is_a_theorem(implies(implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))
    | ~ is_a_theorem(implies(implies(implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))))
    | is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g3,plain,
    is_a_theorem(implies(implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2)]) ).

cnf(g4,plain,
    ( ~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y))))
    | ~ is_a_theorem(implies(implies(implies(x,implies(implies(not(y),y),y)),implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),implies(implies(implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))))
    | is_a_theorem(implies(implies(implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g5,plain,
    is_a_theorem(implies(implies(implies(x,implies(implies(not(y),y),y)),implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),implies(implies(implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(not(y),y),y)),implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1)]) ).

cnf(g6,plain,
    ( ~ is_a_theorem(implies(not(implies(implies(not(y),y),y)),x))
    | ~ is_a_theorem(implies(implies(not(implies(implies(not(y),y),y)),x),implies(implies(x,implies(implies(not(y),y),y)),implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))))
    | is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g7,plain,
    is_a_theorem(implies(implies(not(implies(implies(not(y),y),y)),x),implies(implies(x,implies(implies(not(y),y),y)),implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1)]) ).

cnf(g8,plain,
    ( ~ is_a_theorem(implies(implies(not(y),y),y))
    | ~ is_a_theorem(implies(implies(implies(not(y),y),y),implies(not(implies(implies(not(y),y),y)),x)))
    | is_a_theorem(implies(not(implies(implies(not(y),y),y)),x)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment)]) ).

cnf(g9,plain,
    is_a_theorem(implies(implies(implies(not(y),y),y),implies(not(implies(implies(not(y),y),y)),x))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL362-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03  % Command  : satcop --statistics %s
% 0.09/0.34  % Computer : n013.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Sat Sep  5 21:51:20 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.36  % symbols: 7
% 0.09/0.36  % clauses: 5
% 0.09/0.36  % start clauses: 1
% 0.09/0.36  % iterative deepening steps: 375
% 0.09/0.36  % maximum path limit: 8
% 0.09/0.36  % literal attempts: 4232
% 0.09/0.36  % depth failures: 611
% 0.09/0.36  % regularity failures: 55
% 0.09/0.36  % tautology failures: 4
% 0.09/0.36  % reductions: 0
% 0.09/0.36  % extensions: 3862
% 0.09/0.36  % SAT variables: 3195
% 0.09/0.36  % SAT clauses: 3370
% 0.09/0.36  % WalkSAT solutions: 3368
% 0.09/0.36  % CDCL solutions: 0
% 0.09/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------