↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n020.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:24 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).

cnf(g1,plain,
    ( ~ axiom(or(not(or(not(or(p,q)),or(not(not(p)),q))),or(not(not(p)),or(not(or(p,q)),q))))
    | ~ theorem(or(not(or(p,q)),or(not(not(p)),q)))
    | theorem(or(not(not(p)),or(not(or(p,q)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).

cnf(g2,plain,
    axiom(or(not(or(not(or(p,q)),or(not(not(p)),q))),or(not(not(p)),or(not(or(p,q)),q)))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).

cnf(g3,plain,
    axiom(or(not(or(p,q)),or(q,p))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).

cnf(g4,plain,
    ( ~ axiom(or(not(or(q,q)),q))
    | theorem(or(not(or(q,q)),q)) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_1)]) ).

cnf(g5,plain,
    axiom(or(not(or(q,q)),q)),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_2)]) ).

cnf(g6,plain,
    ( ~ axiom(or(not(or(p,q)),or(q,p)))
    | ~ theorem(or(not(or(q,p)),or(not(not(p)),q)))
    | theorem(or(not(or(p,q)),or(not(not(p)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).

cnf(g7,plain,
    axiom(or(not(not(p)),or(q,not(p)))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_3)]) ).

cnf(g8,plain,
    axiom(or(not(or(q,not(p))),or(not(p),q))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_4)]) ).

cnf(g9,plain,
    ( ~ axiom(or(not(or(not(not(p)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(not(p)),q))))
    | ~ theorem(or(not(not(p)),or(not(or(q,p)),q)))
    | theorem(or(not(or(q,p)),or(not(not(p)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).

cnf(g10,plain,
    axiom(or(not(or(not(not(p)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(not(p)),q)))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_5)]) ).

cnf(g11,plain,
    ( ~ axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q))))
    | ~ theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))
    | theorem(or(not(or(not(p),q)),or(not(or(q,p)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).

cnf(g12,plain,
    axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q)))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).

cnf(g13,plain,
    ( ~ axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))))
    | ~ theorem(or(not(or(q,q)),q))
    | theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_2)]) ).

cnf(g14,plain,
    axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',axiom_1_6)]) ).

cnf(g15,plain,
    ( ~ axiom(or(not(or(q,not(p))),or(not(p),q)))
    | ~ theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
    | theorem(or(not(or(q,not(p))),or(not(or(q,p)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).

cnf(g16,plain,
    ( ~ axiom(or(not(not(p)),or(q,not(p))))
    | ~ theorem(or(not(or(q,not(p))),or(not(or(q,p)),q)))
    | theorem(or(not(not(p)),or(not(or(q,p)),q))) ),
    inference(ground_cnf,[],[file('Axioms/LCL003-0.ax',rule_3)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL210-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.11/0.40  % Computer : n020.cluster.edu
% 0.11/0.40  % Model    : x86_64 x86_64
% 0.11/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40  % Memory   : 8046.5625MB
% 0.11/0.40  % OS       : Linux 6.8.0-71-generic
% 0.11/0.40  % CPULimit : 300
% 0.11/0.40  % WCLimit  : 300
% 0.11/0.40  % DateTime : Fri Sep  4 12:55:12 UTC 2026
% 0.11/0.40  % CPUTime  : 
% 4.71/1.06  % symbols: 8
% 4.71/1.06  % clauses: 9
% 4.71/1.06  % start clauses: 1
% 4.71/1.06  % iterative deepening steps: 15152
% 4.71/1.06  % maximum path limit: 1445
% 4.71/1.06  % literal attempts: 502354
% 4.71/1.06  % depth failures: 4002
% 4.71/1.06  % regularity failures: 8000
% 4.71/1.06  % tautology failures: 5784
% 4.71/1.06  % reductions: 0
% 4.71/1.06  % extensions: 493078
% 4.71/1.06  % SAT variables: 126851
% 4.71/1.06  % SAT clauses: 147263
% 4.71/1.06  % WalkSAT solutions: 147253
% 4.71/1.06  % CDCL solutions: 0
% 4.71/1.06  % SZS status Unsatisfiable for theBenchmark
% 4.71/1.06  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------