↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n009.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:19 PM UTC 2026

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

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

cnf(g1,plain,
    ( ~ sPE(or(not(p),or(p,q)),implies(p,or(p,q)))
    | ~ theorem(or(not(p),or(p,q)))
    | theorem(implies(p,or(p,q))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    ( ~ sPE(implies(p,or(p,q)),or(not(p),or(p,q)))
    | sPE(or(not(p),or(p,q)),implies(p,or(p,q))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(implies(p,or(p,q)),or(not(p),or(p,q))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

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

cnf(g5,plain,
    axiom(implies(or(q,p),or(p,q))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).

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

cnf(g7,plain,
    ( ~ sPE(implies(p,or(q,p)),or(not(p),or(q,p)))
    | ~ theorem(implies(p,or(q,p)))
    | theorem(or(not(p),or(q,p))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ axiom(implies(p,or(q,p)))
    | theorem(implies(p,or(q,p))) ),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).

cnf(g9,plain,
    axiom(implies(p,or(q,p))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_3)]) ).

cnf(g10,plain,
    sPE(implies(p,or(q,p)),or(not(p),or(q,p))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL185-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.11/0.37  % Computer : n009.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sat Sep  5 17:07:21 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.39  % symbols: 9
% 0.11/0.39  % clauses: 17
% 0.11/0.39  % start clauses: 1
% 0.11/0.39  % iterative deepening steps: 206
% 0.11/0.39  % maximum path limit: 5
% 0.11/0.39  % literal attempts: 9958
% 0.11/0.39  % depth failures: 5208
% 0.11/0.39  % regularity failures: 332
% 0.11/0.39  % tautology failures: 669
% 0.11/0.39  % reductions: 0
% 0.11/0.39  % extensions: 9806
% 0.11/0.39  % SAT variables: 3107
% 0.11/0.39  % SAT clauses: 4674
% 0.11/0.39  % WalkSAT solutions: 4671
% 0.11/0.39  % CDCL solutions: 0
% 0.11/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.39  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------