TSTP Solution File: LCL200-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : LCL200-1 : TPTP v8.1.0. 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 : 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.47s 0.65s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 30 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 49 ( 0 equ; 20 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 : 49 ( 5 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(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(q))) ).
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_1186),not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186))))))
| theorem(or(not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186)))),not(X_1186))) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(not(X_1186))),bind(B,$fot(not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186))))))]]) ).
cnf(refute_0_3,plain,
axiom(or(not(X_1179),or(B,X_1179))),
inference(subst,[],[axiom_1_3:[bind(A,$fot(X_1179))]]) ).
cnf(refute_0_4,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_5,plain,
theorem(or(not(or(A,A)),A)),
inference(resolve,[$cnf( axiom(or(not(or(A,A)),A)) )],[axiom_1_2,refute_0_4]) ).
cnf(refute_0_6,plain,
theorem(or(not(or(X_34,X_34)),X_34)),
inference(subst,[],[refute_0_5:[bind(A,$fot(X_34))]]) ).
cnf(refute_0_7,plain,
( ~ theorem(or(not(or(X_34,X_34)),X_34))
| theorem(or(X_34,not(or(X_34,X_34)))) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(X_34,X_34)))),bind(B,$fot(X_34))]]) ).
cnf(refute_0_8,plain,
theorem(or(X_34,not(or(X_34,X_34)))),
inference(resolve,[$cnf( theorem(or(not(or(X_34,X_34)),X_34)) )],[refute_0_6,refute_0_7]) ).
cnf(refute_0_9,plain,
theorem(or(not(X_812),not(or(not(X_812),not(X_812))))),
inference(subst,[],[refute_0_8:[bind(X_34,$fot(not(X_812)))]]) ).
cnf(refute_0_10,plain,
( ~ axiom(or(not(X_811),X_812))
| ~ theorem(or(not(X_812),not(or(not(X_812),not(X_812)))))
| theorem(or(not(X_811),not(or(not(X_812),not(X_812))))) ),
inference(subst,[],[rule_3:[bind(X,$fot(X_811)),bind(Y,$fot(X_812)),bind(Z,$fot(not(or(not(X_812),not(X_812)))))]]) ).
cnf(refute_0_11,plain,
( ~ axiom(or(not(X_811),X_812))
| theorem(or(not(X_811),not(or(not(X_812),not(X_812))))) ),
inference(resolve,[$cnf( theorem(or(not(X_812),not(or(not(X_812),not(X_812))))) )],[refute_0_9,refute_0_10]) ).
cnf(refute_0_12,plain,
( ~ axiom(or(not(X_1179),or(B,X_1179)))
| theorem(or(not(X_1179),not(or(not(or(B,X_1179)),not(or(B,X_1179)))))) ),
inference(subst,[],[refute_0_11:[bind(X_811,$fot(X_1179)),bind(X_812,$fot(or(B,X_1179)))]]) ).
cnf(refute_0_13,plain,
theorem(or(not(X_1179),not(or(not(or(B,X_1179)),not(or(B,X_1179)))))),
inference(resolve,[$cnf( axiom(or(not(X_1179),or(B,X_1179))) )],[refute_0_3,refute_0_12]) ).
cnf(refute_0_14,plain,
theorem(or(not(X_1186),not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186)))))),
inference(subst,[],[refute_0_13:[bind(B,$fot(X_1185)),bind(X_1179,$fot(X_1186))]]) ).
cnf(refute_0_15,plain,
theorem(or(not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186)))),not(X_1186))),
inference(resolve,[$cnf( theorem(or(not(X_1186),not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186)))))) )],[refute_0_14,refute_0_2]) ).
cnf(refute_0_16,plain,
axiom(or(not(X_811),or(B,X_811))),
inference(subst,[],[axiom_1_3:[bind(A,$fot(X_811))]]) ).
cnf(refute_0_17,plain,
( ~ axiom(or(not(X_811),or(B,X_811)))
| ~ theorem(or(not(or(B,X_811)),X_813))
| theorem(or(not(X_811),X_813)) ),
inference(subst,[],[rule_3:[bind(X,$fot(X_811)),bind(Y,$fot(or(B,X_811))),bind(Z,$fot(X_813))]]) ).
cnf(refute_0_18,plain,
( ~ theorem(or(not(or(B,X_811)),X_813))
| theorem(or(not(X_811),X_813)) ),
inference(resolve,[$cnf( axiom(or(not(X_811),or(B,X_811))) )],[refute_0_16,refute_0_17]) ).
cnf(refute_0_19,plain,
( ~ theorem(or(not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186)))),not(X_1186)))
| theorem(or(not(not(or(X_1185,X_1186))),not(X_1186))) ),
inference(subst,[],[refute_0_18:[bind(B,$fot(not(or(X_1185,X_1186)))),bind(X_811,$fot(not(or(X_1185,X_1186)))),bind(X_813,$fot(not(X_1186)))]]) ).
cnf(refute_0_20,plain,
theorem(or(not(not(or(X_1185,X_1186))),not(X_1186))),
inference(resolve,[$cnf( theorem(or(not(or(not(or(X_1185,X_1186)),not(or(X_1185,X_1186)))),not(X_1186))) )],[refute_0_15,refute_0_19]) ).
cnf(refute_0_21,plain,
theorem(or(not(not(or(p,q))),not(q))),
inference(subst,[],[refute_0_20:[bind(X_1185,$fot(p)),bind(X_1186,$fot(q))]]) ).
cnf(refute_0_22,plain,
$false,
inference(resolve,[$cnf( theorem(or(not(not(or(p,q))),not(q))) )],[refute_0_21,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL200-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : metis --show proof --show saturation %s
% 0.13/0.33 % Computer : n017.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 2 14:36:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.47/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65
% 0.47/0.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.47/0.65
%------------------------------------------------------------------------------