↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n029.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:21 PM UTC 2026

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL192-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.08/0.35  % Computer : n029.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep  5 03:36:25 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % symbols: 9
% 0.08/0.36  % clauses: 9
% 0.08/0.36  % start clauses: 1
% 0.08/0.36  % iterative deepening steps: 205
% 0.08/0.36  % maximum path limit: 6
% 0.08/0.36  % literal attempts: 3573
% 0.08/0.36  % depth failures: 1127
% 0.08/0.36  % regularity failures: 36
% 0.08/0.36  % tautology failures: 8
% 0.08/0.36  % reductions: 0
% 0.08/0.36  % extensions: 3378
% 0.08/0.36  % SAT variables: 1439
% 0.08/0.36  % SAT clauses: 1575
% 0.08/0.36  % WalkSAT solutions: 1572
% 0.08/0.36  % CDCL solutions: 0
% 0.08/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------