↑ Up

Metis---2.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : LCL170-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n016.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:42:03 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.38s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   5 RR)
%            Number of literals    :   10 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
    axiom(or(not(A),or(B,A))) ).

cnf(rule_1,axiom,
    ( theorem(X)
    | ~ axiom(X) ) ).

cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(q),or(not(p),q))) ).

cnf(refute_0_0,plain,
    ( ~ axiom(or(not(X_3),or(X_4,X_3)))
    | theorem(or(not(X_3),or(X_4,X_3))) ),
    inference(subst,[],[rule_1:[bind(X,$fot(or(not(X_3),or(X_4,X_3))))]]) ).

cnf(refute_0_1,plain,
    axiom(or(not(X_3),or(X_4,X_3))),
    inference(subst,[],[axiom_1_3:[bind(A,$fot(X_3)),bind(B,$fot(X_4))]]) ).

cnf(refute_0_2,plain,
    theorem(or(not(X_3),or(X_4,X_3))),
    inference(resolve,[$cnf( axiom(or(not(X_3),or(X_4,X_3))) )],[refute_0_1,refute_0_0]) ).

cnf(refute_0_3,plain,
    theorem(or(not(q),or(not(p),q))),
    inference(subst,[],[refute_0_2:[bind(X_3,$fot(q)),bind(X_4,$fot(not(p)))]]) ).

cnf(refute_0_4,plain,
    $false,
    inference(resolve,[$cnf( theorem(or(not(q),or(not(p),q))) )],[refute_0_3,prove_this]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL170-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : metis --show proof --show saturation %s
% 0.11/0.37  % Computer : n016.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep  6 00:33:15 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.11/0.38  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38  
% 0.11/0.38  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.11/0.38  
%------------------------------------------------------------------------------