%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : LCL193-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 12:50:26 EDT 2022

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

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

cnf(axiom_1_6,axiom,
    axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) ).

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

cnf(rule_2,axiom,
    ( theorem(X)
    | ~ axiom(or(not(Y),X))
    | ~ theorem(Y) ) ).

cnf(rule_3,axiom,
    ( theorem(or(not(X),Z))
    | ~ axiom(or(not(X),Y))
    | ~ theorem(or(not(Y),Z)) ) ).

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

cnf(refute_0_0,plain,
    axiom(or(not(or(not(A),X_70432)),or(not(or(X_70431,A)),or(X_70431,X_70432)))),
    inference(subst,[],[axiom_1_6:[bind(B,$fot(X_70432)),bind(C,$fot(X_70431))]]) ).

cnf(refute_0_1,plain,
    ( ~ axiom(or(not(or(X_7,X_8)),or(X_8,X_7)))
    | theorem(or(not(or(X_7,X_8)),or(X_8,X_7))) ),
    inference(subst,[],[rule_1:[bind(X,$fot(or(not(or(X_7,X_8)),or(X_8,X_7))))]]) ).

cnf(refute_0_2,plain,
    axiom(or(not(or(X_7,X_8)),or(X_8,X_7))),
    inference(subst,[],[axiom_1_4:[bind(A,$fot(X_7)),bind(B,$fot(X_8))]]) ).

cnf(refute_0_3,plain,
    theorem(or(not(or(X_7,X_8)),or(X_8,X_7))),
    inference(resolve,[$cnf( axiom(or(not(or(X_7,X_8)),or(X_8,X_7))) )],[refute_0_2,refute_0_1]) ).

cnf(refute_0_4,plain,
    ( ~ axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))
    | ~ theorem(or(not(A),B))
    | theorem(or(not(or(C,A)),or(C,B))) ),
    inference(subst,[],[rule_2:[bind(X,$fot(or(not(or(C,A)),or(C,B)))),bind(Y,$fot(or(not(A),B)))]]) ).

cnf(refute_0_5,plain,
    ( ~ theorem(or(not(A),B))
    | theorem(or(not(or(C,A)),or(C,B))) ),
    inference(resolve,[$cnf( axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) )],[axiom_1_6,refute_0_4]) ).

cnf(refute_0_6,plain,
    ( ~ theorem(or(not(or(X_7,X_8)),or(X_8,X_7)))
    | theorem(or(not(or(X_285,or(X_7,X_8))),or(X_285,or(X_8,X_7)))) ),
    inference(subst,[],[refute_0_5:[bind(A,$fot(or(X_7,X_8))),bind(B,$fot(or(X_8,X_7))),bind(C,$fot(X_285))]]) ).

cnf(refute_0_7,plain,
    theorem(or(not(or(X_285,or(X_7,X_8))),or(X_285,or(X_8,X_7)))),
    inference(resolve,[$cnf( theorem(or(not(or(X_7,X_8)),or(X_8,X_7))) )],[refute_0_3,refute_0_6]) ).

cnf(refute_0_8,plain,
    ( ~ axiom(or(not(X_440),or(X_285,or(X_7,X_8))))
    | ~ theorem(or(not(or(X_285,or(X_7,X_8))),or(X_285,or(X_8,X_7))))
    | theorem(or(not(X_440),or(X_285,or(X_8,X_7)))) ),
    inference(subst,[],[rule_3:[bind(X,$fot(X_440)),bind(Y,$fot(or(X_285,or(X_7,X_8)))),bind(Z,$fot(or(X_285,or(X_8,X_7))))]]) ).

cnf(refute_0_9,plain,
    ( ~ axiom(or(not(X_440),or(X_285,or(X_7,X_8))))
    | theorem(or(not(X_440),or(X_285,or(X_8,X_7)))) ),
    inference(resolve,[$cnf( theorem(or(not(or(X_285,or(X_7,X_8))),or(X_285,or(X_8,X_7)))) )],[refute_0_7,refute_0_8]) ).

cnf(refute_0_10,plain,
    ( ~ axiom(or(not(or(not(A),X_70432)),or(not(or(X_70431,A)),or(X_70431,X_70432))))
    | theorem(or(not(or(not(A),X_70432)),or(not(or(X_70431,A)),or(X_70432,X_70431)))) ),
    inference(subst,[],[refute_0_9:[bind(X_285,$fot(not(or(X_70431,A)))),bind(X_440,$fot(or(not(A),X_70432))),bind(X_7,$fot(X_70431)),bind(X_8,$fot(X_70432))]]) ).

cnf(refute_0_11,plain,
    theorem(or(not(or(not(A),X_70432)),or(not(or(X_70431,A)),or(X_70432,X_70431)))),
    inference(resolve,[$cnf( axiom(or(not(or(not(A),X_70432)),or(not(or(X_70431,A)),or(X_70431,X_70432)))) )],[refute_0_0,refute_0_10]) ).

cnf(refute_0_12,plain,
    theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
    inference(subst,[],[refute_0_11:[bind(A,$fot(q)),bind(X_70431,$fot(p)),bind(X_70432,$fot(r))]]) ).

cnf(refute_0_13,plain,
    $false,
    inference(resolve,[$cnf( theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))) )],[refute_0_12,prove_this]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL193-1 : TPTP v8.1.0. Released v1.1.0.
% 0.00/0.12  % Command  : metis --show proof --show saturation %s
% 0.13/0.33  % Computer : n019.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul  4 10:53:08 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.33  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 35.18/35.36  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.18/35.36  
% 35.18/35.36  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 35.18/35.37  
%------------------------------------------------------------------------------