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

View Problem - Process Solution

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

% Computer : n011.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:31 EDT 2022

% Result   : Unsatisfiable 0.63s 0.81s
% Output   : CNFRefutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   43 (  23 unt;   0 nHn;  23 RR)
%            Number of literals    :   70 (   0 equ;  28 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   74 (  10 sgn)

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

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

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

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

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

cnf(refute_0_3,plain,
    ( ~ theorem(or(not(X_151),X_151))
    | theorem(or(X_151,not(X_151))) ),
    inference(subst,[],[refute_0_1:[bind(A,$fot(not(X_151))),bind(B,$fot(X_151))]]) ).

cnf(refute_0_4,plain,
    axiom(or(not(or(X_23,X_23)),X_23)),
    inference(subst,[],[axiom_1_2:[bind(A,$fot(X_23))]]) ).

cnf(refute_0_5,plain,
    ( ~ axiom(or(not(or(X_23,X_23)),X_23))
    | ~ theorem(or(X_23,X_23))
    | theorem(X_23) ),
    inference(subst,[],[rule_2:[bind(X,$fot(X_23)),bind(Y,$fot(or(X_23,X_23)))]]) ).

cnf(refute_0_6,plain,
    ( ~ theorem(or(X_23,X_23))
    | theorem(X_23) ),
    inference(resolve,[$cnf( axiom(or(not(or(X_23,X_23)),X_23)) )],[refute_0_4,refute_0_5]) ).

cnf(refute_0_7,plain,
    ( ~ theorem(or(or(not(X_150),X_150),or(not(X_150),X_150)))
    | theorem(or(not(X_150),X_150)) ),
    inference(subst,[],[refute_0_6:[bind(X_23,$fot(or(not(X_150),X_150)))]]) ).

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

cnf(refute_0_11,plain,
    theorem(or(not(X_148),or(X_147,X_148))),
    inference(subst,[],[refute_0_10:[bind(X_3,$fot(X_148)),bind(X_4,$fot(X_147))]]) ).

cnf(refute_0_12,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_13,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_12]) ).

cnf(refute_0_14,plain,
    ( ~ theorem(or(not(X_148),or(X_147,X_148)))
    | theorem(or(X_147,or(not(X_148),X_148))) ),
    inference(subst,[],[refute_0_13:[bind(A,$fot(not(X_148))),bind(B,$fot(X_147)),bind(C,$fot(X_148))]]) ).

cnf(refute_0_15,plain,
    theorem(or(X_147,or(not(X_148),X_148))),
    inference(resolve,[$cnf( theorem(or(not(X_148),or(X_147,X_148))) )],[refute_0_11,refute_0_14]) ).

cnf(refute_0_16,plain,
    theorem(or(or(not(X_150),X_150),or(not(X_150),X_150))),
    inference(subst,[],[refute_0_15:[bind(X_147,$fot(or(not(X_150),X_150))),bind(X_148,$fot(X_150))]]) ).

cnf(refute_0_17,plain,
    theorem(or(not(X_150),X_150)),
    inference(resolve,[$cnf( theorem(or(or(not(X_150),X_150),or(not(X_150),X_150))) )],[refute_0_16,refute_0_7]) ).

cnf(refute_0_18,plain,
    theorem(or(not(X_151),X_151)),
    inference(subst,[],[refute_0_17:[bind(X_150,$fot(X_151))]]) ).

cnf(refute_0_19,plain,
    theorem(or(X_151,not(X_151))),
    inference(resolve,[$cnf( theorem(or(not(X_151),X_151)) )],[refute_0_18,refute_0_3]) ).

cnf(refute_0_20,plain,
    theorem(or(not(X_493),not(not(X_493)))),
    inference(subst,[],[refute_0_19:[bind(X_151,$fot(not(X_493)))]]) ).

cnf(refute_0_21,plain,
    ( ~ axiom(or(not(X_492),X_493))
    | ~ theorem(or(not(X_493),not(not(X_493))))
    | theorem(or(not(X_492),not(not(X_493)))) ),
    inference(subst,[],[rule_3:[bind(X,$fot(X_492)),bind(Y,$fot(X_493)),bind(Z,$fot(not(not(X_493))))]]) ).

cnf(refute_0_22,plain,
    ( ~ axiom(or(not(X_492),X_493))
    | theorem(or(not(X_492),not(not(X_493)))) ),
    inference(resolve,[$cnf( theorem(or(not(X_493),not(not(X_493)))) )],[refute_0_20,refute_0_21]) ).

cnf(refute_0_23,plain,
    ( ~ axiom(or(not(or(A,B)),or(B,A)))
    | theorem(or(not(or(A,B)),not(not(or(B,A))))) ),
    inference(subst,[],[refute_0_22:[bind(X_492,$fot(or(A,B))),bind(X_493,$fot(or(B,A)))]]) ).

cnf(refute_0_24,plain,
    theorem(or(not(or(A,B)),not(not(or(B,A))))),
    inference(resolve,[$cnf( axiom(or(not(or(A,B)),or(B,A))) )],[axiom_1_4,refute_0_23]) ).

cnf(refute_0_25,plain,
    theorem(or(not(or(X_2672,X_2673)),not(not(or(X_2673,X_2672))))),
    inference(subst,[],[refute_0_24:[bind(A,$fot(X_2672)),bind(B,$fot(X_2673))]]) ).

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

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

cnf(refute_0_28,plain,
    ( ~ theorem(or(not(or(B,X_492)),X_494))
    | theorem(or(not(X_492),X_494)) ),
    inference(resolve,[$cnf( axiom(or(not(X_492),or(B,X_492))) )],[refute_0_26,refute_0_27]) ).

cnf(refute_0_29,plain,
    ( ~ theorem(or(not(or(X_2672,X_2673)),not(not(or(X_2673,X_2672)))))
    | theorem(or(not(X_2673),not(not(or(X_2673,X_2672))))) ),
    inference(subst,[],[refute_0_28:[bind(B,$fot(X_2672)),bind(X_492,$fot(X_2673)),bind(X_494,$fot(not(not(or(X_2673,X_2672)))))]]) ).

cnf(refute_0_30,plain,
    theorem(or(not(X_2673),not(not(or(X_2673,X_2672))))),
    inference(resolve,[$cnf( theorem(or(not(or(X_2672,X_2673)),not(not(or(X_2673,X_2672))))) )],[refute_0_25,refute_0_29]) ).

cnf(refute_0_31,plain,
    theorem(or(not(X_2680),not(not(or(X_2680,X_2679))))),
    inference(subst,[],[refute_0_30:[bind(X_2672,$fot(X_2679)),bind(X_2673,$fot(X_2680))]]) ).

cnf(refute_0_32,plain,
    theorem(or(not(not(or(X_2680,X_2679))),not(X_2680))),
    inference(resolve,[$cnf( theorem(or(not(X_2680),not(not(or(X_2680,X_2679))))) )],[refute_0_31,refute_0_2]) ).

cnf(refute_0_33,plain,
    theorem(or(not(not(or(p,q))),not(p))),
    inference(subst,[],[refute_0_32:[bind(X_2679,$fot(q)),bind(X_2680,$fot(p))]]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : LCL199-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13  % Command  : metis --show proof --show saturation %s
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  2 21:51:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.63/0.81  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.63/0.81  
% 0.63/0.81  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.63/0.81  
%------------------------------------------------------------------------------