↑ Up

hopCoP---0.1.UNS-CRf.s

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

% Computer : n004.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:02 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
    inference(cnf,[status(esa)],[prove_um]) ).

cnf(l0,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
    inference(instantiation,[status(thm)],[2]) ).

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

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

cnf(1,plain,
    is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
    inference(cnf,[status(esa)],[xgf]) ).

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

% launching worker at depth: 10
cnf(l3,plain,
    ( ~ is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))))
    | ~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))))
    | is_a_theorem(equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))) ),
    inference(instantiation,[status(thm)],[0]) ).

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

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

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5]) ).

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