%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n027.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:11 PM UTC 2026
% Result : Unsatisfiable 0.91s 1.15s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 17 unt; 0 nHn; 15 RR)
% Number of literals : 45 ( 0 equ; 17 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 : 66 ( 9 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(not(or(not(p),q))),or(not(q),p))) ).
cnf(refute_0_0,plain,
axiom(or(not(X_425),or(B,X_425))),
inference(subst,[],[axiom_1_3:[bind(A,$fot(X_425))]]) ).
cnf(refute_0_1,plain,
( ~ axiom(or(not(X_425),or(B,X_425)))
| ~ theorem(or(not(or(B,X_425)),X_427))
| theorem(or(not(X_425),X_427)) ),
inference(subst,[],[rule_3:[bind(X,$fot(X_425)),bind(Y,$fot(or(B,X_425))),bind(Z,$fot(X_427))]]) ).
cnf(refute_0_2,plain,
( ~ theorem(or(not(or(B,X_425)),X_427))
| theorem(or(not(X_425),X_427)) ),
inference(resolve,[$cnf( axiom(or(not(X_425),or(B,X_425))) )],[refute_0_0,refute_0_1]) ).
cnf(refute_0_3,plain,
( ~ theorem(or(not(or(X_1987,not(or(X_1988,X_1989)))),or(not(X_1989),X_1987)))
| theorem(or(not(not(or(X_1988,X_1989))),or(not(X_1989),X_1987))) ),
inference(subst,[],[refute_0_2:[bind(B,$fot(X_1987)),bind(X_425,$fot(not(or(X_1988,X_1989)))),bind(X_427,$fot(or(not(X_1989),X_1987)))]]) ).
cnf(refute_0_4,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_5,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_4]) ).
cnf(refute_0_6,plain,
( ~ theorem(or(not(X_1703),or(not(or(X_1701,not(or(X_1702,X_1703)))),X_1701)))
| theorem(or(not(or(X_1701,not(or(X_1702,X_1703)))),or(not(X_1703),X_1701))) ),
inference(subst,[],[refute_0_5:[bind(A,$fot(not(X_1703))),bind(B,$fot(not(or(X_1701,not(or(X_1702,X_1703)))))),bind(C,$fot(X_1701))]]) ).
cnf(refute_0_7,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_8,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_9,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_8,refute_0_7]) ).
cnf(refute_0_10,plain,
theorem(or(not(or(X_131,X_130)),or(X_130,X_131))),
inference(subst,[],[refute_0_9:[bind(X_7,$fot(X_131)),bind(X_8,$fot(X_130))]]) ).
cnf(refute_0_11,plain,
( ~ theorem(or(not(or(X_131,X_130)),or(X_130,X_131)))
| theorem(or(X_130,or(not(or(X_131,X_130)),X_131))) ),
inference(subst,[],[refute_0_5:[bind(A,$fot(not(or(X_131,X_130)))),bind(B,$fot(X_130)),bind(C,$fot(X_131))]]) ).
cnf(refute_0_12,plain,
theorem(or(X_130,or(not(or(X_131,X_130)),X_131))),
inference(resolve,[$cnf( theorem(or(not(or(X_131,X_130)),or(X_130,X_131))) )],[refute_0_10,refute_0_11]) ).
cnf(refute_0_13,plain,
theorem(or(not(or(X_1481,X_1482)),or(not(or(X_131,not(or(X_1481,X_1482)))),X_131))),
inference(subst,[],[refute_0_12:[bind(X_130,$fot(not(or(X_1481,X_1482))))]]) ).
cnf(refute_0_14,plain,
( ~ theorem(or(not(or(X_1481,X_1482)),or(not(or(X_131,not(or(X_1481,X_1482)))),X_131)))
| theorem(or(not(X_1482),or(not(or(X_131,not(or(X_1481,X_1482)))),X_131))) ),
inference(subst,[],[refute_0_2:[bind(B,$fot(X_1481)),bind(X_425,$fot(X_1482)),bind(X_427,$fot(or(not(or(X_131,not(or(X_1481,X_1482)))),X_131)))]]) ).
cnf(refute_0_15,plain,
theorem(or(not(X_1482),or(not(or(X_131,not(or(X_1481,X_1482)))),X_131))),
inference(resolve,[$cnf( theorem(or(not(or(X_1481,X_1482)),or(not(or(X_131,not(or(X_1481,X_1482)))),X_131))) )],[refute_0_13,refute_0_14]) ).
cnf(refute_0_16,plain,
theorem(or(not(X_1703),or(not(or(X_1701,not(or(X_1702,X_1703)))),X_1701))),
inference(subst,[],[refute_0_15:[bind(X_131,$fot(X_1701)),bind(X_1481,$fot(X_1702)),bind(X_1482,$fot(X_1703))]]) ).
cnf(refute_0_17,plain,
theorem(or(not(or(X_1701,not(or(X_1702,X_1703)))),or(not(X_1703),X_1701))),
inference(resolve,[$cnf( theorem(or(not(X_1703),or(not(or(X_1701,not(or(X_1702,X_1703)))),X_1701))) )],[refute_0_16,refute_0_6]) ).
cnf(refute_0_18,plain,
theorem(or(not(or(X_1987,not(or(X_1988,X_1989)))),or(not(X_1989),X_1987))),
inference(subst,[],[refute_0_17:[bind(X_1701,$fot(X_1987)),bind(X_1702,$fot(X_1988)),bind(X_1703,$fot(X_1989))]]) ).
cnf(refute_0_19,plain,
theorem(or(not(not(or(X_1988,X_1989))),or(not(X_1989),X_1987))),
inference(resolve,[$cnf( theorem(or(not(or(X_1987,not(or(X_1988,X_1989)))),or(not(X_1989),X_1987))) )],[refute_0_18,refute_0_3]) ).
cnf(refute_0_20,plain,
theorem(or(not(not(or(not(p),q))),or(not(q),p))),
inference(subst,[],[refute_0_19:[bind(X_1987,$fot(p)),bind(X_1988,$fot(not(p))),bind(X_1989,$fot(q))]]) ).
cnf(refute_0_21,plain,
$false,
inference(resolve,[$cnf( theorem(or(not(not(or(not(p),q))),or(not(q),p))) )],[refute_0_20,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : metis --show proof --show saturation %s
% 0.07/0.34 % Computer : n027.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 16:48:58 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.91/1.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.15
% 0.91/1.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.91/1.16
%------------------------------------------------------------------------------