↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL190-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 : n010.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 0.10s 0.38s
% Output   : CNFRefutation 0.10s
% 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(or(p,or(q,r)),or(p,or(r,q)))),
    inference(cnf,[status(esa)],[prove_this]) ).

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

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

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

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

cnf(l3,plain,
    ( ~ axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
    | theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,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(l6,plain,
    axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))),
    inference(instantiation,[status(thm)],[4]) ).

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

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

cnf(l7,plain,
    axiom(implies(or(q,r),or(r,q))),
    inference(instantiation,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL190-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.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep  4 20:36:23 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % launching worker at depth: 1
% 0.10/0.37  % launching worker at depth: 6
% 0.10/0.37  % launching worker at depth: 7
% 0.10/0.37  % launching worker at depth: 4
% 0.10/0.37  % launching worker at depth: 5
% 0.10/0.37  % launching worker at depth: 2
% 0.10/0.37  % launching worker at depth: 8
% 0.10/0.37  % launching worker at depth: 3
% 0.10/0.37  % launching worker at depth: 9
% 0.10/0.37  % launching worker at depth: 10
% 0.10/0.38  % SZS status Theorem for theBenchmark
% 0.10/0.38  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------