TSTP Solution File: LCL185-3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL185-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n007.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 : Sun Jul 17 14:13:26 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ theorem(implies(p,or(p,q))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/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.03/0.12  % Problem  : LCL185-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n007.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 : Sun Jul  3 20:05:26 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.38  % symbols: 9
% 0.18/0.38  % clauses: 17
% 0.18/0.38  % start clauses: 1
% 0.18/0.38  % iterative deepening steps: 326
% 0.18/0.38  % maximum path limit: 6
% 0.18/0.38  % literal attempts: 23147
% 0.18/0.38  % depth failures: 11576
% 0.18/0.38  % regularity failures: 956
% 0.18/0.38  % tautology failures: 1939
% 0.18/0.38  % reductions: 0
% 0.18/0.38  % extensions: 22985
% 0.18/0.38  % SAT variables: 7885
% 0.18/0.38  % SAT clauses: 12438
% 0.18/0.38  % WalkSAT solutions: 12434
% 0.18/0.38  % CDCL solutions: 0
% 0.18/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------