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

View Problem - Process Solution

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

% Computer : n007.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:27 EDT 2022

% Result   : Unsatisfiable 1.17s 1.37s
% Output   : CNFRefutation 1.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  13 unt;   0 nHn;  14 RR)
%            Number of literals    :   39 (   0 equ;  16 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   59 (   0 sgn)

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

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_5305,X_5306)),or(not(or(not(X_5305),X_5304)),or(X_5306,X_5304))))
    | theorem(or(not(or(not(X_5305),X_5304)),or(not(or(X_5305,X_5306)),or(X_5306,X_5304)))) ),
    inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(X_5305,X_5306)))),bind(B,$fot(not(or(not(X_5305),X_5304)))),bind(C,$fot(or(X_5306,X_5304)))]]) ).

cnf(refute_0_3,plain,
    ( ~ axiom(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18))))
    | theorem(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18)))) ),
    inference(subst,[],[rule_1:[bind(X,$fot(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18)))))]]) ).

cnf(refute_0_4,plain,
    axiom(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18)))),
    inference(subst,[],[axiom_1_6:[bind(A,$fot(X_17)),bind(B,$fot(X_18)),bind(C,$fot(X_19))]]) ).

cnf(refute_0_5,plain,
    theorem(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18)))),
    inference(resolve,[$cnf( axiom(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18)))) )],[refute_0_4,refute_0_3]) ).

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

cnf(refute_0_7,plain,
    theorem(or(not(or(X_19,X_17)),or(not(or(not(X_17),X_18)),or(X_19,X_18)))),
    inference(resolve,[$cnf( theorem(or(not(or(not(X_17),X_18)),or(not(or(X_19,X_17)),or(X_19,X_18)))) )],[refute_0_5,refute_0_6]) ).

cnf(refute_0_8,plain,
    theorem(or(not(or(X_3768,X_3767)),or(not(or(not(X_3767),X_18)),or(X_3768,X_18)))),
    inference(subst,[],[refute_0_7:[bind(X_17,$fot(X_3767)),bind(X_19,$fot(X_3768))]]) ).

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

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

cnf(refute_0_11,plain,
    ( ~ theorem(or(not(or(X_3768,X_3767)),or(not(or(not(X_3767),X_18)),or(X_3768,X_18))))
    | theorem(or(not(or(X_3767,X_3768)),or(not(or(not(X_3767),X_18)),or(X_3768,X_18)))) ),
    inference(subst,[],[refute_0_10:[bind(A,$fot(X_3767)),bind(B,$fot(X_3768)),bind(X_672,$fot(or(not(or(not(X_3767),X_18)),or(X_3768,X_18))))]]) ).

cnf(refute_0_12,plain,
    theorem(or(not(or(X_3767,X_3768)),or(not(or(not(X_3767),X_18)),or(X_3768,X_18)))),
    inference(resolve,[$cnf( theorem(or(not(or(X_3768,X_3767)),or(not(or(not(X_3767),X_18)),or(X_3768,X_18)))) )],[refute_0_8,refute_0_11]) ).

cnf(refute_0_13,plain,
    theorem(or(not(or(X_5305,X_5306)),or(not(or(not(X_5305),X_5304)),or(X_5306,X_5304)))),
    inference(subst,[],[refute_0_12:[bind(X_18,$fot(X_5304)),bind(X_3767,$fot(X_5305)),bind(X_3768,$fot(X_5306))]]) ).

cnf(refute_0_14,plain,
    theorem(or(not(or(not(X_5305),X_5304)),or(not(or(X_5305,X_5306)),or(X_5306,X_5304)))),
    inference(resolve,[$cnf( theorem(or(not(or(X_5305,X_5306)),or(not(or(not(X_5305),X_5304)),or(X_5306,X_5304)))) )],[refute_0_13,refute_0_2]) ).

cnf(refute_0_15,plain,
    theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
    inference(subst,[],[refute_0_14:[bind(X_5304,$fot(r)),bind(X_5305,$fot(q)),bind(X_5306,$fot(p))]]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL194-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12  % Command  : metis --show proof --show saturation %s
% 0.13/0.33  % Computer : n007.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul  4 00:49:11 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 1.17/1.37  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.17/1.37  
% 1.17/1.37  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.17/1.38  
%------------------------------------------------------------------------------