↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL172-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 : n028.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:17 PM UTC 2026

% Result   : Unsatisfiable 126.19s 16.36s
% Output   : CNFRefutation 126.19s
% 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(implies(p,implies(q,r)),implies(q,implies(p,r)))),
    inference(cnf,[status(esa)],[prove_this]) ).

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

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

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

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

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

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

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

cnf(l10,plain,
    axiom(implies(or(not(p),or(not(q),r)),or(not(q),or(not(p),r)))),
    inference(instantiation,[status(thm)],[3]) ).

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

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

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l5,l18,l23,l10,l16,l20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL172-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38  % Computer : n028.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sat Sep  5 13:29:29 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  % launching worker at depth: 2
% 0.10/0.38  % launching worker at depth: 1
% 0.10/0.38  % launching worker at depth: 6
% 0.10/0.38  % launching worker at depth: 3
% 0.10/0.38  % launching worker at depth: 4
% 0.10/0.38  % launching worker at depth: 5
% 0.10/0.38  % launching worker at depth: 7
% 0.10/0.38  % launching worker at depth: 8
% 0.10/0.39  % launching worker at depth: 9
% 0.10/0.39  % launching worker at depth: 10
% 0.10/0.39  % launching worker at depth: 11
% 0.10/0.45  % launching worker at depth: 12
% 126.19/16.36  % SZS status Theorem for theBenchmark
% 126.19/16.36  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------