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

View Problem - Process Solution

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

% Computer : n004.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:19 EDT 2022

% Result   : Unsatisfiable 0.77s 0.97s
% Output   : CNFRefutation 0.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   39 (  20 unt;   0 nHn;  20 RR)
%            Number of literals    :   65 (   0 equ;  27 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   :   82 (   3 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(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(not(q)),not(p)))) ).

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

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

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

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

cnf(refute_0_6,plain,
    ( ~ theorem(or(not(or(X_2655,not(X_2654))),or(not(or(X_2655,X_2654)),X_2655)))
    | theorem(or(not(not(X_2654)),or(not(or(X_2655,X_2654)),X_2655))) ),
    inference(subst,[],[refute_0_5:[bind(B,$fot(X_2655)),bind(X_385,$fot(not(X_2654))),bind(X_387,$fot(or(not(or(X_2655,X_2654)),X_2655)))]]) ).

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

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

cnf(refute_0_9,plain,
    ( ~ theorem(or(not(or(not(X_2634),X_2635)),or(not(or(X_2635,X_2634)),X_2635)))
    | theorem(or(not(or(X_2635,not(X_2634))),or(not(or(X_2635,X_2634)),X_2635))) ),
    inference(subst,[],[refute_0_8:[bind(A,$fot(X_2635)),bind(B,$fot(not(X_2634))),bind(X_387,$fot(or(not(or(X_2635,X_2634)),X_2635)))]]) ).

cnf(refute_0_10,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_11,plain,
    theorem(or(not(or(A,A)),A)),
    inference(resolve,[$cnf( axiom(or(not(or(A,A)),A)) )],[axiom_1_2,refute_0_10]) ).

cnf(refute_0_12,plain,
    theorem(or(not(or(X_638,X_638)),X_638)),
    inference(subst,[],[refute_0_11:[bind(A,$fot(X_638))]]) ).

cnf(refute_0_13,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_14,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_13]) ).

cnf(refute_0_15,plain,
    ( ~ theorem(or(not(or(X_638,X_638)),X_638))
    | theorem(or(not(or(X_639,or(X_638,X_638))),or(X_639,X_638))) ),
    inference(subst,[],[refute_0_14:[bind(A,$fot(or(X_638,X_638))),bind(B,$fot(X_638)),bind(C,$fot(X_639))]]) ).

cnf(refute_0_16,plain,
    theorem(or(not(or(X_639,or(X_638,X_638))),or(X_639,X_638))),
    inference(resolve,[$cnf( theorem(or(not(or(X_638,X_638)),X_638)) )],[refute_0_12,refute_0_15]) ).

cnf(refute_0_17,plain,
    theorem(or(not(or(not(or(X_2631,X_2630)),or(X_2631,X_2631))),or(not(or(X_2631,X_2630)),X_2631))),
    inference(subst,[],[refute_0_16:[bind(X_638,$fot(X_2631)),bind(X_639,$fot(not(or(X_2631,X_2630))))]]) ).

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

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

cnf(refute_0_20,plain,
    ( ~ theorem(or(not(or(not(or(X_2631,X_2630)),or(X_2631,X_2631))),or(not(or(X_2631,X_2630)),X_2631)))
    | theorem(or(not(or(not(X_2630),X_2631)),or(not(or(X_2631,X_2630)),X_2631))) ),
    inference(subst,[],[refute_0_19:[bind(A,$fot(X_2630)),bind(B,$fot(X_2631)),bind(C,$fot(X_2631)),bind(X_387,$fot(or(not(or(X_2631,X_2630)),X_2631)))]]) ).

cnf(refute_0_21,plain,
    theorem(or(not(or(not(X_2630),X_2631)),or(not(or(X_2631,X_2630)),X_2631))),
    inference(resolve,[$cnf( theorem(or(not(or(not(or(X_2631,X_2630)),or(X_2631,X_2631))),or(not(or(X_2631,X_2630)),X_2631))) )],[refute_0_17,refute_0_20]) ).

cnf(refute_0_22,plain,
    theorem(or(not(or(not(X_2634),X_2635)),or(not(or(X_2635,X_2634)),X_2635))),
    inference(subst,[],[refute_0_21:[bind(X_2630,$fot(X_2634)),bind(X_2631,$fot(X_2635))]]) ).

cnf(refute_0_23,plain,
    theorem(or(not(or(X_2635,not(X_2634))),or(not(or(X_2635,X_2634)),X_2635))),
    inference(resolve,[$cnf( theorem(or(not(or(not(X_2634),X_2635)),or(not(or(X_2635,X_2634)),X_2635))) )],[refute_0_22,refute_0_9]) ).

cnf(refute_0_24,plain,
    theorem(or(not(or(X_2655,not(X_2654))),or(not(or(X_2655,X_2654)),X_2655))),
    inference(subst,[],[refute_0_23:[bind(X_2634,$fot(X_2654)),bind(X_2635,$fot(X_2655))]]) ).

cnf(refute_0_25,plain,
    theorem(or(not(not(X_2654)),or(not(or(X_2655,X_2654)),X_2655))),
    inference(resolve,[$cnf( theorem(or(not(or(X_2655,not(X_2654))),or(not(or(X_2655,X_2654)),X_2655))) )],[refute_0_24,refute_0_6]) ).

cnf(refute_0_26,plain,
    theorem(or(not(not(X_2658)),or(not(or(X_2659,X_2658)),X_2659))),
    inference(subst,[],[refute_0_25:[bind(X_2654,$fot(X_2658)),bind(X_2655,$fot(X_2659))]]) ).

cnf(refute_0_27,plain,
    theorem(or(not(or(X_2659,X_2658)),or(not(not(X_2658)),X_2659))),
    inference(resolve,[$cnf( theorem(or(not(not(X_2658)),or(not(or(X_2659,X_2658)),X_2659))) )],[refute_0_26,refute_0_2]) ).

cnf(refute_0_28,plain,
    theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
    inference(subst,[],[refute_0_27:[bind(X_2658,$fot(q)),bind(X_2659,$fot(not(p)))]]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL182-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : metis --show proof --show saturation %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 17:28:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.77/0.97  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.77/0.97  
% 0.77/0.97  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.77/0.97  
%------------------------------------------------------------------------------