TSTP Solution File: LCL238-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : LCL238-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n026.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:51:00 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of clauses : 37 ( 20 unt; 0 nHn; 20 RR)
% Number of literals : 60 ( 0 equ; 24 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 : 60 ( 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(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),not(q)))),not(or(not(q),not(p))))) ).
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(or(X_499,X_500)),not(not(or(X_500,X_499)))))
| theorem(or(not(not(or(X_500,X_499))),not(or(X_499,X_500)))) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(X_499,X_500)))),bind(B,$fot(not(not(or(X_500,X_499)))))]]) ).
cnf(refute_0_3,plain,
( ~ theorem(or(not(X_123),X_123))
| theorem(or(X_123,not(X_123))) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(not(X_123))),bind(B,$fot(X_123))]]) ).
cnf(refute_0_4,plain,
axiom(or(not(or(X_23,X_23)),X_23)),
inference(subst,[],[axiom_1_2:[bind(A,$fot(X_23))]]) ).
cnf(refute_0_5,plain,
( ~ axiom(or(not(or(X_23,X_23)),X_23))
| ~ theorem(or(X_23,X_23))
| theorem(X_23) ),
inference(subst,[],[rule_2:[bind(X,$fot(X_23)),bind(Y,$fot(or(X_23,X_23)))]]) ).
cnf(refute_0_6,plain,
( ~ theorem(or(X_23,X_23))
| theorem(X_23) ),
inference(resolve,[$cnf( axiom(or(not(or(X_23,X_23)),X_23)) )],[refute_0_4,refute_0_5]) ).
cnf(refute_0_7,plain,
( ~ theorem(or(or(not(X_122),X_122),or(not(X_122),X_122)))
| theorem(or(not(X_122),X_122)) ),
inference(subst,[],[refute_0_6:[bind(X_23,$fot(or(not(X_122),X_122)))]]) ).
cnf(refute_0_8,plain,
( ~ axiom(or(not(X_3),or(X_4,X_3)))
| theorem(or(not(X_3),or(X_4,X_3))) ),
inference(subst,[],[rule_1:[bind(X,$fot(or(not(X_3),or(X_4,X_3))))]]) ).
cnf(refute_0_9,plain,
axiom(or(not(X_3),or(X_4,X_3))),
inference(subst,[],[axiom_1_3:[bind(A,$fot(X_3)),bind(B,$fot(X_4))]]) ).
cnf(refute_0_10,plain,
theorem(or(not(X_3),or(X_4,X_3))),
inference(resolve,[$cnf( axiom(or(not(X_3),or(X_4,X_3))) )],[refute_0_9,refute_0_8]) ).
cnf(refute_0_11,plain,
theorem(or(not(X_120),or(X_119,X_120))),
inference(subst,[],[refute_0_10:[bind(X_3,$fot(X_120)),bind(X_4,$fot(X_119))]]) ).
cnf(refute_0_12,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_13,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_12]) ).
cnf(refute_0_14,plain,
( ~ theorem(or(not(X_120),or(X_119,X_120)))
| theorem(or(X_119,or(not(X_120),X_120))) ),
inference(subst,[],[refute_0_13:[bind(A,$fot(not(X_120))),bind(B,$fot(X_119)),bind(C,$fot(X_120))]]) ).
cnf(refute_0_15,plain,
theorem(or(X_119,or(not(X_120),X_120))),
inference(resolve,[$cnf( theorem(or(not(X_120),or(X_119,X_120))) )],[refute_0_11,refute_0_14]) ).
cnf(refute_0_16,plain,
theorem(or(or(not(X_122),X_122),or(not(X_122),X_122))),
inference(subst,[],[refute_0_15:[bind(X_119,$fot(or(not(X_122),X_122))),bind(X_120,$fot(X_122))]]) ).
cnf(refute_0_17,plain,
theorem(or(not(X_122),X_122)),
inference(resolve,[$cnf( theorem(or(or(not(X_122),X_122),or(not(X_122),X_122))) )],[refute_0_16,refute_0_7]) ).
cnf(refute_0_18,plain,
theorem(or(not(X_123),X_123)),
inference(subst,[],[refute_0_17:[bind(X_122,$fot(X_123))]]) ).
cnf(refute_0_19,plain,
theorem(or(X_123,not(X_123))),
inference(resolve,[$cnf( theorem(or(not(X_123),X_123)) )],[refute_0_18,refute_0_3]) ).
cnf(refute_0_20,plain,
theorem(or(not(X_314),not(not(X_314)))),
inference(subst,[],[refute_0_19:[bind(X_123,$fot(not(X_314)))]]) ).
cnf(refute_0_21,plain,
( ~ axiom(or(not(X_313),X_314))
| ~ theorem(or(not(X_314),not(not(X_314))))
| theorem(or(not(X_313),not(not(X_314)))) ),
inference(subst,[],[rule_3:[bind(X,$fot(X_313)),bind(Y,$fot(X_314)),bind(Z,$fot(not(not(X_314))))]]) ).
cnf(refute_0_22,plain,
( ~ axiom(or(not(X_313),X_314))
| theorem(or(not(X_313),not(not(X_314)))) ),
inference(resolve,[$cnf( theorem(or(not(X_314),not(not(X_314)))) )],[refute_0_20,refute_0_21]) ).
cnf(refute_0_23,plain,
( ~ axiom(or(not(or(A,B)),or(B,A)))
| theorem(or(not(or(A,B)),not(not(or(B,A))))) ),
inference(subst,[],[refute_0_22:[bind(X_313,$fot(or(A,B))),bind(X_314,$fot(or(B,A)))]]) ).
cnf(refute_0_24,plain,
theorem(or(not(or(A,B)),not(not(or(B,A))))),
inference(resolve,[$cnf( axiom(or(not(or(A,B)),or(B,A))) )],[axiom_1_4,refute_0_23]) ).
cnf(refute_0_25,plain,
theorem(or(not(or(X_499,X_500)),not(not(or(X_500,X_499))))),
inference(subst,[],[refute_0_24:[bind(A,$fot(X_499)),bind(B,$fot(X_500))]]) ).
cnf(refute_0_26,plain,
theorem(or(not(not(or(X_500,X_499))),not(or(X_499,X_500)))),
inference(resolve,[$cnf( theorem(or(not(or(X_499,X_500)),not(not(or(X_500,X_499))))) )],[refute_0_25,refute_0_2]) ).
cnf(refute_0_27,plain,
theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),
inference(subst,[],[refute_0_26:[bind(X_499,$fot(not(q))),bind(X_500,$fot(not(p)))]]) ).
cnf(refute_0_28,plain,
$false,
inference(resolve,[$cnf( theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))) )],[refute_0_27,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL238-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.11/0.12 % Command : metis --show proof --show saturation %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 00:29:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.19/0.44 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44
% 0.19/0.44 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.19/0.44
%------------------------------------------------------------------------------