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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : LCL218-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:47 EDT 2022

% Result   : Unsatisfiable 1.68s 1.88s
% Output   : CNFRefutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   36 (  19 unt;   0 nHn;  20 RR)
%            Number of literals    :   59 (   0 equ;  24 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   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   :   84 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
    axiom(or(not(A),or(B,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(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(or(p,q)),q)),or(not(p),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(X_7058),or(not(or(not(or(X_7058,X_7057)),X_7056)),X_7056)))
    | theorem(or(not(or(not(or(X_7058,X_7057)),X_7056)),or(not(X_7058),X_7056))) ),
    inference(subst,[],[refute_0_1:[bind(A,$fot(not(X_7058))),bind(B,$fot(not(or(not(or(X_7058,X_7057)),X_7056)))),bind(C,$fot(X_7056))]]) ).

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

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

cnf(refute_0_5,plain,
    ( ~ theorem(or(not(or(B,X_258)),X_260))
    | theorem(or(not(X_258),X_260)) ),
    inference(resolve,[$cnf( axiom(or(not(X_258),or(B,X_258))) )],[refute_0_3,refute_0_4]) ).

cnf(refute_0_6,plain,
    ( ~ theorem(or(not(or(X_6909,X_6910)),or(not(or(not(or(X_6910,X_6909)),X_6908)),X_6908)))
    | theorem(or(not(X_6910),or(not(or(not(or(X_6910,X_6909)),X_6908)),X_6908))) ),
    inference(subst,[],[refute_0_5:[bind(B,$fot(X_6909)),bind(X_258,$fot(X_6910)),bind(X_260,$fot(or(not(or(not(or(X_6910,X_6909)),X_6908)),X_6908)))]]) ).

cnf(refute_0_7,plain,
    axiom(or(not(or(X_310,X_309)),or(X_309,X_310))),
    inference(subst,[],[axiom_1_4:[bind(A,$fot(X_310)),bind(B,$fot(X_309))]]) ).

cnf(refute_0_8,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_9,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_10,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_9,refute_0_8]) ).

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

cnf(refute_0_12,plain,
    ( ~ axiom(or(not(X_258),or(X_7,X_8)))
    | theorem(or(not(X_258),or(X_8,X_7))) ),
    inference(resolve,[$cnf( theorem(or(not(or(X_7,X_8)),or(X_8,X_7))) )],[refute_0_10,refute_0_11]) ).

cnf(refute_0_13,plain,
    ( ~ axiom(or(not(or(X_310,X_309)),or(X_309,X_310)))
    | theorem(or(not(or(X_310,X_309)),or(X_310,X_309))) ),
    inference(subst,[],[refute_0_12:[bind(X_258,$fot(or(X_310,X_309))),bind(X_7,$fot(X_309)),bind(X_8,$fot(X_310))]]) ).

cnf(refute_0_14,plain,
    theorem(or(not(or(X_310,X_309)),or(X_310,X_309))),
    inference(resolve,[$cnf( axiom(or(not(or(X_310,X_309)),or(X_309,X_310))) )],[refute_0_7,refute_0_13]) ).

cnf(refute_0_15,plain,
    theorem(or(not(or(X_1056,X_1057)),or(X_1056,X_1057))),
    inference(subst,[],[refute_0_14:[bind(X_309,$fot(X_1057)),bind(X_310,$fot(X_1056))]]) ).

cnf(refute_0_16,plain,
    ( ~ theorem(or(not(or(X_1056,X_1057)),or(X_1056,X_1057)))
    | theorem(or(X_1056,or(not(or(X_1056,X_1057)),X_1057))) ),
    inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(X_1056,X_1057)))),bind(B,$fot(X_1056)),bind(C,$fot(X_1057))]]) ).

cnf(refute_0_17,plain,
    theorem(or(X_1056,or(not(or(X_1056,X_1057)),X_1057))),
    inference(resolve,[$cnf( theorem(or(not(or(X_1056,X_1057)),or(X_1056,X_1057))) )],[refute_0_15,refute_0_16]) ).

cnf(refute_0_18,plain,
    theorem(or(not(or(X_6616,X_6615)),or(not(or(not(or(X_6616,X_6615)),X_1057)),X_1057))),
    inference(subst,[],[refute_0_17:[bind(X_1056,$fot(not(or(X_6616,X_6615))))]]) ).

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

cnf(refute_0_20,plain,
    ( ~ theorem(or(not(or(B,A)),X_260))
    | theorem(or(not(or(A,B)),X_260)) ),
    inference(resolve,[$cnf( axiom(or(not(or(A,B)),or(B,A))) )],[axiom_1_4,refute_0_19]) ).

cnf(refute_0_21,plain,
    ( ~ theorem(or(not(or(X_6616,X_6615)),or(not(or(not(or(X_6616,X_6615)),X_1057)),X_1057)))
    | theorem(or(not(or(X_6615,X_6616)),or(not(or(not(or(X_6616,X_6615)),X_1057)),X_1057))) ),
    inference(subst,[],[refute_0_20:[bind(A,$fot(X_6615)),bind(B,$fot(X_6616)),bind(X_260,$fot(or(not(or(not(or(X_6616,X_6615)),X_1057)),X_1057)))]]) ).

cnf(refute_0_22,plain,
    theorem(or(not(or(X_6615,X_6616)),or(not(or(not(or(X_6616,X_6615)),X_1057)),X_1057))),
    inference(resolve,[$cnf( theorem(or(not(or(X_6616,X_6615)),or(not(or(not(or(X_6616,X_6615)),X_1057)),X_1057))) )],[refute_0_18,refute_0_21]) ).

cnf(refute_0_23,plain,
    theorem(or(not(or(X_6909,X_6910)),or(not(or(not(or(X_6910,X_6909)),X_6908)),X_6908))),
    inference(subst,[],[refute_0_22:[bind(X_1057,$fot(X_6908)),bind(X_6615,$fot(X_6909)),bind(X_6616,$fot(X_6910))]]) ).

cnf(refute_0_24,plain,
    theorem(or(not(X_6910),or(not(or(not(or(X_6910,X_6909)),X_6908)),X_6908))),
    inference(resolve,[$cnf( theorem(or(not(or(X_6909,X_6910)),or(not(or(not(or(X_6910,X_6909)),X_6908)),X_6908))) )],[refute_0_23,refute_0_6]) ).

cnf(refute_0_25,plain,
    theorem(or(not(X_7058),or(not(or(not(or(X_7058,X_7057)),X_7056)),X_7056))),
    inference(subst,[],[refute_0_24:[bind(X_6908,$fot(X_7056)),bind(X_6909,$fot(X_7057)),bind(X_6910,$fot(X_7058))]]) ).

cnf(refute_0_26,plain,
    theorem(or(not(or(not(or(X_7058,X_7057)),X_7056)),or(not(X_7058),X_7056))),
    inference(resolve,[$cnf( theorem(or(not(X_7058),or(not(or(not(or(X_7058,X_7057)),X_7056)),X_7056))) )],[refute_0_25,refute_0_2]) ).

cnf(refute_0_27,plain,
    theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
    inference(subst,[],[refute_0_26:[bind(X_7056,$fot(q)),bind(X_7057,$fot(q)),bind(X_7058,$fot(p))]]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL218-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/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 02:49:08 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 1.68/1.88  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.68/1.88  
% 1.68/1.88  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.68/1.89  
%------------------------------------------------------------------------------