%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : LCL172-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 12:42:04 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.37s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))) ).
cnf(refute_0_0,plain,
( ~ axiom(or(not(or(X_11,or(X_12,X_13))),or(X_12,or(X_11,X_13))))
| theorem(or(not(or(X_11,or(X_12,X_13))),or(X_12,or(X_11,X_13)))) ),
inference(subst,[],[rule_1:[bind(X,$fot(or(not(or(X_11,or(X_12,X_13))),or(X_12,or(X_11,X_13)))))]]) ).
cnf(refute_0_1,plain,
axiom(or(not(or(X_11,or(X_12,X_13))),or(X_12,or(X_11,X_13)))),
inference(subst,[],[axiom_1_5:[bind(A,$fot(X_11)),bind(B,$fot(X_12)),bind(C,$fot(X_13))]]) ).
cnf(refute_0_2,plain,
theorem(or(not(or(X_11,or(X_12,X_13))),or(X_12,or(X_11,X_13)))),
inference(resolve,[$cnf( axiom(or(not(or(X_11,or(X_12,X_13))),or(X_12,or(X_11,X_13)))) )],[refute_0_1,refute_0_0]) ).
cnf(refute_0_3,plain,
theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
inference(subst,[],[refute_0_2:[bind(X_11,$fot(not(p))),bind(X_12,$fot(not(q))),bind(X_13,$fot(r))]]) ).
cnf(refute_0_4,plain,
$false,
inference(resolve,[$cnf( theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))) )],[refute_0_3,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL172-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : metis --show proof --show saturation %s
% 0.10/0.35 % Computer : n017.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 4 21:59:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.10/0.37
%------------------------------------------------------------------------------