TSTP Solution File: LCL215-1 by Metis---2.4

View Problem - Process Solution

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

% Computer : n025.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:42 EDT 2022

% Result   : Unsatisfiable 2.59s 2.79s
% Output   : CNFRefutation 2.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   35 (  18 unt;   0 nHn;  18 RR)
%            Number of literals    :   58 (   0 equ;  24 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   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   :   70 (   0 sgn)

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

cnf(axiom_1_4,axiom,
    axiom(or(not(or(A,B)),or(B,A))) ).

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

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(p),q)),or(not(or(p,q)),q))) ).

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

cnf(refute_0_1,plain,
    ( ~ theorem(or(A,or(B,C)))
    | theorem(or(B,or(A,C))) ),
    inference(resolve,[$cnf( axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) )],[axiom_1_5,refute_0_0]) ).

cnf(refute_0_2,plain,
    ( ~ theorem(or(not(or(X_9270,X_9271)),or(not(or(not(X_9270),X_9271)),X_9271)))
    | theorem(or(not(or(not(X_9270),X_9271)),or(not(or(X_9270,X_9271)),X_9271))) ),
    inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(X_9270,X_9271)))),bind(B,$fot(not(or(not(X_9270),X_9271)))),bind(C,$fot(X_9271))]]) ).

cnf(refute_0_3,plain,
    ( ~ axiom(or(not(or(A,B)),or(B,A)))
    | ~ theorem(or(not(or(B,A)),X_644))
    | theorem(or(not(or(A,B)),X_644)) ),
    inference(subst,[],[rule_3:[bind(X,$fot(or(A,B))),bind(Y,$fot(or(B,A))),bind(Z,$fot(X_644))]]) ).

cnf(refute_0_4,plain,
    ( ~ theorem(or(not(or(B,A)),X_644))
    | theorem(or(not(or(A,B)),X_644)) ),
    inference(resolve,[$cnf( axiom(or(not(or(A,B)),or(B,A))) )],[axiom_1_4,refute_0_3]) ).

cnf(refute_0_5,plain,
    ( ~ theorem(or(not(or(X_9269,X_9268)),or(not(or(not(X_9268),X_9269)),X_9269)))
    | theorem(or(not(or(X_9268,X_9269)),or(not(or(not(X_9268),X_9269)),X_9269))) ),
    inference(subst,[],[refute_0_4:[bind(A,$fot(X_9268)),bind(B,$fot(X_9269)),bind(X_644,$fot(or(not(or(not(X_9268),X_9269)),X_9269)))]]) ).

cnf(refute_0_6,plain,
    ( ~ theorem(or(not(or(not(X_9254),X_9255)),or(not(or(X_9255,X_9254)),X_9255)))
    | theorem(or(not(or(X_9255,X_9254)),or(not(or(not(X_9254),X_9255)),X_9255))) ),
    inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(not(X_9254),X_9255)))),bind(B,$fot(not(or(X_9255,X_9254)))),bind(C,$fot(X_9255))]]) ).

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

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

cnf(refute_0_9,plain,
    theorem(or(not(or(A,A)),A)),
    inference(resolve,[$cnf( axiom(or(not(or(A,A)),A)) )],[axiom_1_2,refute_0_8]) ).

cnf(refute_0_10,plain,
    theorem(or(not(or(X_456,X_456)),X_456)),
    inference(subst,[],[refute_0_9:[bind(A,$fot(X_456))]]) ).

cnf(refute_0_11,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_12,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_11]) ).

cnf(refute_0_13,plain,
    ( ~ theorem(or(not(or(X_456,X_456)),X_456))
    | theorem(or(not(or(X_457,or(X_456,X_456))),or(X_457,X_456))) ),
    inference(subst,[],[refute_0_12:[bind(A,$fot(or(X_456,X_456))),bind(B,$fot(X_456)),bind(C,$fot(X_457))]]) ).

cnf(refute_0_14,plain,
    theorem(or(not(or(X_457,or(X_456,X_456))),or(X_457,X_456))),
    inference(resolve,[$cnf( theorem(or(not(or(X_456,X_456)),X_456)) )],[refute_0_10,refute_0_13]) ).

cnf(refute_0_15,plain,
    ( ~ axiom(or(not(X_642),or(X_457,or(X_456,X_456))))
    | ~ theorem(or(not(or(X_457,or(X_456,X_456))),or(X_457,X_456)))
    | theorem(or(not(X_642),or(X_457,X_456))) ),
    inference(subst,[],[rule_3:[bind(X,$fot(X_642)),bind(Y,$fot(or(X_457,or(X_456,X_456)))),bind(Z,$fot(or(X_457,X_456)))]]) ).

cnf(refute_0_16,plain,
    ( ~ axiom(or(not(X_642),or(X_457,or(X_456,X_456))))
    | theorem(or(not(X_642),or(X_457,X_456))) ),
    inference(resolve,[$cnf( theorem(or(not(or(X_457,or(X_456,X_456))),or(X_457,X_456))) )],[refute_0_14,refute_0_15]) ).

cnf(refute_0_17,plain,
    ( ~ axiom(or(not(or(not(A),X_9251)),or(not(or(X_9251,A)),or(X_9251,X_9251))))
    | theorem(or(not(or(not(A),X_9251)),or(not(or(X_9251,A)),X_9251))) ),
    inference(subst,[],[refute_0_16:[bind(X_456,$fot(X_9251)),bind(X_457,$fot(not(or(X_9251,A)))),bind(X_642,$fot(or(not(A),X_9251)))]]) ).

cnf(refute_0_18,plain,
    theorem(or(not(or(not(A),X_9251)),or(not(or(X_9251,A)),X_9251))),
    inference(resolve,[$cnf( axiom(or(not(or(not(A),X_9251)),or(not(or(X_9251,A)),or(X_9251,X_9251)))) )],[refute_0_7,refute_0_17]) ).

cnf(refute_0_19,plain,
    theorem(or(not(or(not(X_9254),X_9255)),or(not(or(X_9255,X_9254)),X_9255))),
    inference(subst,[],[refute_0_18:[bind(A,$fot(X_9254)),bind(X_9251,$fot(X_9255))]]) ).

cnf(refute_0_20,plain,
    theorem(or(not(or(X_9255,X_9254)),or(not(or(not(X_9254),X_9255)),X_9255))),
    inference(resolve,[$cnf( theorem(or(not(or(not(X_9254),X_9255)),or(not(or(X_9255,X_9254)),X_9255))) )],[refute_0_19,refute_0_6]) ).

cnf(refute_0_21,plain,
    theorem(or(not(or(X_9269,X_9268)),or(not(or(not(X_9268),X_9269)),X_9269))),
    inference(subst,[],[refute_0_20:[bind(X_9254,$fot(X_9268)),bind(X_9255,$fot(X_9269))]]) ).

cnf(refute_0_22,plain,
    theorem(or(not(or(X_9268,X_9269)),or(not(or(not(X_9268),X_9269)),X_9269))),
    inference(resolve,[$cnf( theorem(or(not(or(X_9269,X_9268)),or(not(or(not(X_9268),X_9269)),X_9269))) )],[refute_0_21,refute_0_5]) ).

cnf(refute_0_23,plain,
    theorem(or(not(or(X_9270,X_9271)),or(not(or(not(X_9270),X_9271)),X_9271))),
    inference(subst,[],[refute_0_22:[bind(X_9268,$fot(X_9270)),bind(X_9269,$fot(X_9271))]]) ).

cnf(refute_0_24,plain,
    theorem(or(not(or(not(X_9270),X_9271)),or(not(or(X_9270,X_9271)),X_9271))),
    inference(resolve,[$cnf( theorem(or(not(or(X_9270,X_9271)),or(not(or(not(X_9270),X_9271)),X_9271))) )],[refute_0_23,refute_0_2]) ).

cnf(refute_0_25,plain,
    theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))),
    inference(subst,[],[refute_0_24:[bind(X_9270,$fot(p)),bind(X_9271,$fot(q))]]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.11  % Command  : metis --show proof --show saturation %s
% 0.11/0.32  % Computer : n025.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jul  4 18:55:26 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.11/0.33  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 2.59/2.79  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/2.79  
% 2.59/2.79  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.59/2.79  
%------------------------------------------------------------------------------