↑ Up

hopCoP---0.1.UNS-CRf.s

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

% Computer : n007.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:08 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(6,plain,
    ~ is_a_theorem(implies(a,c)),
    inference(cnf,[status(esa)],[prove_transitivity]) ).

cnf(l0,plain,
    ~ is_a_theorem(implies(a,c)),
    inference(instantiation,[status(thm)],[6]) ).

cnf(0,plain,
    ( ~ is_a_theorem(X0)
    | ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(X1) ),
    inference(cnf,[status(esa)],[condensed_detachment]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(a,implies(b,c)))
    | ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(a,c)))
    | is_a_theorem(implies(a,c)) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l3,plain,
    ( ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(a,b)))
    | ~ is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(a,b)),implies(implies(a,implies(b,c)),implies(a,c))))
    | is_a_theorem(implies(implies(a,implies(b,c)),implies(a,c))) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l4,plain,
    ( ~ is_a_theorem(implies(a,b))
    | ~ is_a_theorem(implies(implies(a,b),implies(implies(a,implies(b,c)),implies(a,b))))
    | is_a_theorem(implies(implies(a,implies(b,c)),implies(a,b))) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(1,plain,
    is_a_theorem(implies(X0,implies(X1,X0))),
    inference(cnf,[status(esa)],[cn_18]) ).

cnf(l8,plain,
    is_a_theorem(implies(implies(a,b),implies(implies(a,implies(b,c)),implies(a,b)))),
    inference(instantiation,[status(thm)],[1]) ).

cnf(4,plain,
    is_a_theorem(implies(a,b)),
    inference(cnf,[status(esa)],[a_implies_b]) ).

cnf(l9,plain,
    is_a_theorem(implies(a,b)),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l5,plain,
    ( ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))))
    | ~ is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))),implies(implies(implies(a,implies(b,c)),implies(a,b)),implies(implies(a,implies(b,c)),implies(a,c)))))
    | is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(a,b)),implies(implies(a,implies(b,c)),implies(a,c)))) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(2,plain,
    is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
    inference(cnf,[status(esa)],[cn_35]) ).

cnf(l7,plain,
    is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))),implies(implies(implies(a,implies(b,c)),implies(a,b)),implies(implies(a,implies(b,c)),implies(a,c))))),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l6,plain,
    is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l2,plain,
    ( ~ is_a_theorem(implies(b,c))
    | ~ is_a_theorem(implies(implies(b,c),implies(a,implies(b,c))))
    | is_a_theorem(implies(a,implies(b,c))) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l10,plain,
    is_a_theorem(implies(implies(b,c),implies(a,implies(b,c)))),
    inference(instantiation,[status(thm)],[1]) ).

cnf(5,plain,
    is_a_theorem(implies(b,c)),
    inference(cnf,[status(esa)],[b_implies_c]) ).

cnf(l11,plain,
    is_a_theorem(implies(b,c)),
    inference(instantiation,[status(thm)],[5]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l4,l8,l9,l5,l7,l6,l2,l10,l11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n007.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sun Sep  6 01:02:54 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % launching worker at depth: 1
% 0.08/0.35  % launching worker at depth: 5
% 0.08/0.35  % launching worker at depth: 2
% 0.08/0.35  % launching worker at depth: 3
% 0.08/0.35  % launching worker at depth: 4
% 0.08/0.35  % launching worker at depth: 8
% 0.08/0.35  % launching worker at depth: 6
% 0.08/0.35  % launching worker at depth: 7
% 0.08/0.35  % launching worker at depth: 9
% 0.08/0.35  % launching worker at depth: 10
% 0.08/0.35  % launching worker at depth: 11
% 0.08/0.36  % SZS status Theorem for theBenchmark
% 0.08/0.36  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------