TSTP Solution File: KRS002-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n029.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 03:18:23 EDT 2022
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 11 unt; 0 nHn; 34 RR)
% Number of literals : 66 ( 0 equ; 35 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
e(exist) ).
cnf(clause_2,axiom,
( s2least(X1)
| ~ c(X1) ) ).
cnf(clause_4,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ) ).
cnf(clause_5,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ) ).
cnf(clause_6,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ) ).
cnf(clause_8,axiom,
( s1most(X1)
| ~ d(X1) ) ).
cnf(clause_10,axiom,
( equalish(X3,X2)
| ~ s1most(X1)
| ~ s(X1,X3)
| ~ s(X1,X2) ) ).
cnf(clause_14,axiom,
( r(X1,u4r2(X1))
| ~ e(X1) ) ).
cnf(clause_15,axiom,
( d(X2)
| ~ e(X1)
| ~ r(X1,X2) ) ).
cnf(clause_16,axiom,
( c(X2)
| ~ e(X1)
| ~ r(X1,X2) ) ).
cnf(refute_0_0,plain,
( ~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist)))
| ~ s2least(u4r2(exist)) ),
inference(subst,[],[clause_4:[bind(X1,$fot(u4r2(exist)))]]) ).
cnf(refute_0_1,plain,
( ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r2(u4r2(exist))) ),
inference(subst,[],[clause_6:[bind(X1,$fot(u4r2(exist)))]]) ).
cnf(refute_0_2,plain,
( ~ c(u4r2(exist))
| s2least(u4r2(exist)) ),
inference(subst,[],[clause_2:[bind(X1,$fot(u4r2(exist)))]]) ).
cnf(refute_0_3,plain,
( ~ e(exist)
| r(exist,u4r2(exist)) ),
inference(subst,[],[clause_14:[bind(X1,$fot(exist))]]) ).
cnf(refute_0_4,plain,
r(exist,u4r2(exist)),
inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_3]) ).
cnf(refute_0_5,plain,
( ~ e(exist)
| ~ r(exist,u4r2(exist))
| c(u4r2(exist)) ),
inference(subst,[],[clause_16:[bind(X1,$fot(exist)),bind(X2,$fot(u4r2(exist)))]]) ).
cnf(refute_0_6,plain,
( ~ e(exist)
| c(u4r2(exist)) ),
inference(resolve,[$cnf( r(exist,u4r2(exist)) )],[refute_0_4,refute_0_5]) ).
cnf(refute_0_7,plain,
c(u4r2(exist)),
inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_6]) ).
cnf(refute_0_8,plain,
s2least(u4r2(exist)),
inference(resolve,[$cnf( c(u4r2(exist)) )],[refute_0_7,refute_0_2]) ).
cnf(refute_0_9,plain,
s(u4r2(exist),u1r2(u4r2(exist))),
inference(resolve,[$cnf( s2least(u4r2(exist)) )],[refute_0_8,refute_0_1]) ).
cnf(refute_0_10,plain,
( ~ s2least(u4r2(exist))
| s(u4r2(exist),u1r1(u4r2(exist))) ),
inference(subst,[],[clause_5:[bind(X1,$fot(u4r2(exist)))]]) ).
cnf(refute_0_11,plain,
s(u4r2(exist),u1r1(u4r2(exist))),
inference(resolve,[$cnf( s2least(u4r2(exist)) )],[refute_0_8,refute_0_10]) ).
cnf(refute_0_12,plain,
( ~ s(u4r2(exist),X_30)
| ~ s(u4r2(exist),u1r1(u4r2(exist)))
| ~ s1most(u4r2(exist))
| equalish(X_30,u1r1(u4r2(exist))) ),
inference(subst,[],[clause_10:[bind(X1,$fot(u4r2(exist))),bind(X2,$fot(u1r1(u4r2(exist)))),bind(X3,$fot(X_30))]]) ).
cnf(refute_0_13,plain,
( ~ s(u4r2(exist),X_30)
| ~ s1most(u4r2(exist))
| equalish(X_30,u1r1(u4r2(exist))) ),
inference(resolve,[$cnf( s(u4r2(exist),u1r1(u4r2(exist))) )],[refute_0_11,refute_0_12]) ).
cnf(refute_0_14,plain,
( ~ d(u4r2(exist))
| s1most(u4r2(exist)) ),
inference(subst,[],[clause_8:[bind(X1,$fot(u4r2(exist)))]]) ).
cnf(refute_0_15,plain,
( ~ e(exist)
| ~ r(exist,u4r2(exist))
| d(u4r2(exist)) ),
inference(subst,[],[clause_15:[bind(X1,$fot(exist)),bind(X2,$fot(u4r2(exist)))]]) ).
cnf(refute_0_16,plain,
( ~ e(exist)
| d(u4r2(exist)) ),
inference(resolve,[$cnf( r(exist,u4r2(exist)) )],[refute_0_4,refute_0_15]) ).
cnf(refute_0_17,plain,
d(u4r2(exist)),
inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_16]) ).
cnf(refute_0_18,plain,
s1most(u4r2(exist)),
inference(resolve,[$cnf( d(u4r2(exist)) )],[refute_0_17,refute_0_14]) ).
cnf(refute_0_19,plain,
( ~ s(u4r2(exist),X_30)
| equalish(X_30,u1r1(u4r2(exist))) ),
inference(resolve,[$cnf( s1most(u4r2(exist)) )],[refute_0_18,refute_0_13]) ).
cnf(refute_0_20,plain,
( ~ s(u4r2(exist),u1r2(u4r2(exist)))
| equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
inference(subst,[],[refute_0_19:[bind(X_30,$fot(u1r2(u4r2(exist))))]]) ).
cnf(refute_0_21,plain,
equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))),
inference(resolve,[$cnf( s(u4r2(exist),u1r2(u4r2(exist))) )],[refute_0_9,refute_0_20]) ).
cnf(refute_0_22,plain,
~ s2least(u4r2(exist)),
inference(resolve,[$cnf( equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) )],[refute_0_21,refute_0_0]) ).
cnf(refute_0_23,plain,
$false,
inference(resolve,[$cnf( s2least(u4r2(exist)) )],[refute_0_8,refute_0_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : metis --show proof --show saturation %s
% 0.12/0.33 % Computer : n029.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 Jun 7 08:00:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.35 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35
% 0.12/0.35 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.12/0.35
%------------------------------------------------------------------------------