↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL186-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n012.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 12:13:20 PM UTC 2026

% Result   : Unsatisfiable 7.90s 1.31s
% Output   : CNFRefutation 7.90s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named prove_thisERROR: Could not build tree for root finalERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(8,plain,
    ~ theorem(implies(not(p),implies(p,q))),
    inference(cnf,[status(esa)],[prove_this]) ).

cnf(l0,plain,
    ~ theorem(implies(not(p),implies(p,q))),
    inference(instantiation,[status(thm)],[8]) ).

cnf(5,plain,
    implies(X0,X1) = or(not(X0),X1),
    inference(cnf,[status(esa)],[implies_definition]) ).

cnf(l6,plain,
    implies(not(p),implies(p,q)) = or(not(not(p)),implies(p,q)),
    inference(instantiation,[status(thm)],[5]) ).

cnf(7,plain,
    ( ~ theorem(X0)
    | ~ theorem(implies(X0,X1))
    | theorem(X1) ),
    inference(cnf,[status(esa)],[rule_2]) ).

cnf(l3,plain,
    ( ~ theorem(or(not(not(p)),or(q,not(p))))
    | ~ theorem(implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))
    | theorem(or(not(not(p)),or(not(p),q))) ),
    inference(instantiation,[status(thm)],[7]) ).

cnf(6,plain,
    ( ~ axiom(X0)
    | theorem(X0) ),
    inference(cnf,[status(esa)],[rule_1]) ).

cnf(l8,plain,
    ( ~ axiom(or(not(not(p)),or(q,not(p))))
    | theorem(or(not(not(p)),or(q,not(p)))) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l23,plain,
    implies(p,q) = or(not(p),q),
    inference(instantiation,[status(thm)],[5]) ).

cnf(l5,plain,
    ( ~ theorem(implies(or(q,not(p)),or(not(p),q)))
    | ~ theorem(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))))
    | theorem(implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))) ),
    inference(instantiation,[status(thm)],[7]) ).

cnf(l10,plain,
    ( ~ axiom(implies(or(q,not(p)),or(not(p),q)))
    | theorem(implies(or(q,not(p)),or(not(p),q))) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l13,plain,
    ( ~ axiom(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q)))))
    | theorem(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(4,plain,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(cnf,[status(esa)],[axiom_1_6]) ).

cnf(l15,plain,
    axiom(implies(implies(or(q,not(p)),or(not(p),q)),implies(or(not(not(p)),or(q,not(p))),or(not(not(p)),or(not(p),q))))),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l20,plain,
    implies(not(p),or(q,not(p))) = or(not(not(p)),or(q,not(p))),
    inference(instantiation,[status(thm)],[5]) ).

cnf(1,plain,
    axiom(implies(X0,or(X1,X0))),
    inference(cnf,[status(esa)],[axiom_1_3]) ).

cnf(l16,plain,
    axiom(implies(not(p),or(q,not(p)))),
    inference(instantiation,[status(thm)],[1]) ).

cnf(2,plain,
    axiom(implies(or(X0,X1),or(X1,X0))),
    inference(cnf,[status(esa)],[axiom_1_4]) ).

cnf(l19,plain,
    axiom(implies(or(q,not(p)),or(not(p),q))),
    inference(instantiation,[status(thm)],[2]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l6,l3,l8,l23,l5,l10,l13,l15,l20,l16,l19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL186-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.02  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Fri Sep  4 19:10:42 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.03/0.30  % launching worker at depth: 1
% 0.03/0.30  % launching worker at depth: 4
% 0.03/0.30  % launching worker at depth: 6
% 0.03/0.30  % launching worker at depth: 2
% 0.03/0.30  % launching worker at depth: 5
% 0.03/0.30  % launching worker at depth: 7
% 0.03/0.30  % launching worker at depth: 8
% 0.03/0.30  % launching worker at depth: 3
% 0.03/0.30  % launching worker at depth: 9
% 0.03/0.30  % launching worker at depth: 10
% 0.03/0.30  % launching worker at depth: 11
% 0.03/0.32  % launching worker at depth: 12
% 7.90/1.31  % SZS status Theorem for theBenchmark
% 7.90/1.31  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------