TSTP Solution File: LCL188-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : LCL188-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n009.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:23 EDT 2022
% Result : Unsatisfiable 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 15 unt; 0 nHn; 13 RR)
% Number of literals : 38 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 39 ( 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_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(prove_this,negated_conjecture,
~ theorem(or(p,or(not(or(p,q)),q))) ).
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(or(B,C)),or(B,C)))
| theorem(or(B,or(not(or(B,C)),C))) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(not(or(B,C))))]]) ).
cnf(refute_0_3,plain,
axiom(or(not(or(X_23,X_23)),X_23)),
inference(subst,[],[axiom_1_2:[bind(A,$fot(X_23))]]) ).
cnf(refute_0_4,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_5,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_3,refute_0_4]) ).
cnf(refute_0_6,plain,
( ~ theorem(or(or(not(X_131),X_131),or(not(X_131),X_131)))
| theorem(or(not(X_131),X_131)) ),
inference(subst,[],[refute_0_5:[bind(X_23,$fot(or(not(X_131),X_131)))]]) ).
cnf(refute_0_7,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_8,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_9,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_8,refute_0_7]) ).
cnf(refute_0_10,plain,
theorem(or(not(X_123),or(X_122,X_123))),
inference(subst,[],[refute_0_9:[bind(X_3,$fot(X_123)),bind(X_4,$fot(X_122))]]) ).
cnf(refute_0_11,plain,
( ~ theorem(or(not(X_123),or(X_122,X_123)))
| theorem(or(X_122,or(not(X_123),X_123))) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(not(X_123))),bind(B,$fot(X_122)),bind(C,$fot(X_123))]]) ).
cnf(refute_0_12,plain,
theorem(or(X_122,or(not(X_123),X_123))),
inference(resolve,[$cnf( theorem(or(not(X_123),or(X_122,X_123))) )],[refute_0_10,refute_0_11]) ).
cnf(refute_0_13,plain,
theorem(or(or(not(X_131),X_131),or(not(X_131),X_131))),
inference(subst,[],[refute_0_12:[bind(X_122,$fot(or(not(X_131),X_131))),bind(X_123,$fot(X_131))]]) ).
cnf(refute_0_14,plain,
theorem(or(not(X_131),X_131)),
inference(resolve,[$cnf( theorem(or(or(not(X_131),X_131),or(not(X_131),X_131))) )],[refute_0_13,refute_0_6]) ).
cnf(refute_0_15,plain,
theorem(or(not(or(B,C)),or(B,C))),
inference(subst,[],[refute_0_14:[bind(X_131,$fot(or(B,C)))]]) ).
cnf(refute_0_16,plain,
theorem(or(B,or(not(or(B,C)),C))),
inference(resolve,[$cnf( theorem(or(not(or(B,C)),or(B,C))) )],[refute_0_15,refute_0_2]) ).
cnf(refute_0_17,plain,
theorem(or(p,or(not(or(p,q)),q))),
inference(subst,[],[refute_0_16:[bind(B,$fot(p)),bind(C,$fot(q))]]) ).
cnf(refute_0_18,plain,
$false,
inference(resolve,[$cnf( theorem(or(p,or(not(or(p,q)),q))) )],[refute_0_17,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL188-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.12 % Command : metis --show proof --show saturation %s
% 0.12/0.33 % Computer : n009.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 : Mon Jul 4 18:01:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.19/0.36 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.36
% 0.19/0.36 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.19/0.37
%------------------------------------------------------------------------------