TSTP Solution File: KRS013-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n022.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:26 EDT 2022
% Result : Unsatisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of clauses : 58 ( 11 unt; 24 nHn; 47 RR)
% Number of literals : 135 ( 0 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
e(exist) ).
cnf(clause_2,negated_conjecture,
~ f(exist) ).
cnf(clause_3,axiom,
( t2least(X1)
| ~ c(X1) ) ).
cnf(clause_5,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ) ).
cnf(clause_6,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ) ).
cnf(clause_7,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ) ).
cnf(clause_9,axiom,
( t1most(X1)
| ~ d(X1) ) ).
cnf(clause_11,axiom,
( equalish(X3,X2)
| ~ t1most(X1)
| ~ t(X1,X3)
| ~ t(X1,X2) ) ).
cnf(clause_15,axiom,
( d(X3)
| ~ e(X1)
| ~ r(X1,X3) ) ).
cnf(clause_16,axiom,
( c(X2)
| ~ e(X1)
| ~ r(X1,X2)
| ~ s2least(X2) ) ).
cnf(clause_26,axiom,
( s2least(X1)
| equalish(X3,X2)
| ~ s(X1,X3)
| ~ s(X1,X2) ) ).
cnf(clause_28,axiom,
( f(X1)
| ~ s1most(u6r1(X1)) ) ).
cnf(clause_29,axiom,
( f(X1)
| r(X1,u6r1(X1)) ) ).
cnf(clause_31,axiom,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ) ).
cnf(clause_32,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ) ).
cnf(clause_33,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ) ).
cnf(refute_0_0,plain,
( ~ equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist)))
| ~ t2least(u6r1(exist)) ),
inference(subst,[],[clause_5:[bind(X1,$fot(u6r1(exist)))]]) ).
cnf(refute_0_1,plain,
( ~ t2least(u6r1(exist))
| t(u6r1(exist),u1r2(u6r1(exist))) ),
inference(subst,[],[clause_7:[bind(X1,$fot(u6r1(exist)))]]) ).
cnf(refute_0_2,plain,
( ~ c(u6r1(exist))
| t2least(u6r1(exist)) ),
inference(subst,[],[clause_3:[bind(X1,$fot(u6r1(exist)))]]) ).
cnf(refute_0_3,plain,
( ~ s1most(u6r1(exist))
| f(exist) ),
inference(subst,[],[clause_28:[bind(X1,$fot(exist))]]) ).
cnf(refute_0_4,plain,
( f(X_43)
| r(X_43,u6r1(X_43)) ),
inference(subst,[],[clause_29:[bind(X1,$fot(X_43))]]) ).
cnf(refute_0_5,plain,
( ~ e(X_43)
| ~ r(X_43,u6r1(X_43))
| ~ s2least(u6r1(X_43))
| c(u6r1(X_43)) ),
inference(subst,[],[clause_16:[bind(X1,$fot(X_43)),bind(X2,$fot(u6r1(X_43)))]]) ).
cnf(refute_0_6,plain,
( ~ e(X_43)
| ~ s2least(u6r1(X_43))
| c(u6r1(X_43))
| f(X_43) ),
inference(resolve,[$cnf( r(X_43,u6r1(X_43)) )],[refute_0_4,refute_0_5]) ).
cnf(refute_0_7,plain,
( ~ equalish(u7r2(X_74),u7r1(X_74))
| s1most(X_74) ),
inference(subst,[],[clause_31:[bind(X1,$fot(X_74))]]) ).
cnf(refute_0_8,plain,
( s(X_72,u7r2(X_72))
| s1most(X_72) ),
inference(subst,[],[clause_33:[bind(X1,$fot(X_72))]]) ).
cnf(refute_0_9,plain,
( s(X_52,u7r1(X_52))
| s1most(X_52) ),
inference(subst,[],[clause_32:[bind(X1,$fot(X_52))]]) ).
cnf(refute_0_10,plain,
( ~ s(X_52,X_54)
| ~ s(X_52,u7r1(X_52))
| equalish(X_54,u7r1(X_52))
| s2least(X_52) ),
inference(subst,[],[clause_26:[bind(X1,$fot(X_52)),bind(X2,$fot(u7r1(X_52))),bind(X3,$fot(X_54))]]) ).
cnf(refute_0_11,plain,
( ~ s(X_52,X_54)
| equalish(X_54,u7r1(X_52))
| s1most(X_52)
| s2least(X_52) ),
inference(resolve,[$cnf( s(X_52,u7r1(X_52)) )],[refute_0_9,refute_0_10]) ).
cnf(refute_0_12,plain,
( ~ s(X_72,u7r2(X_72))
| equalish(u7r2(X_72),u7r1(X_72))
| s1most(X_72)
| s2least(X_72) ),
inference(subst,[],[refute_0_11:[bind(X_52,$fot(X_72)),bind(X_54,$fot(u7r2(X_72)))]]) ).
cnf(refute_0_13,plain,
( equalish(u7r2(X_72),u7r1(X_72))
| s1most(X_72)
| s2least(X_72) ),
inference(resolve,[$cnf( s(X_72,u7r2(X_72)) )],[refute_0_8,refute_0_12]) ).
cnf(refute_0_14,plain,
( equalish(u7r2(X_74),u7r1(X_74))
| s1most(X_74)
| s2least(X_74) ),
inference(subst,[],[refute_0_13:[bind(X_72,$fot(X_74))]]) ).
cnf(refute_0_15,plain,
( s1most(X_74)
| s2least(X_74) ),
inference(resolve,[$cnf( equalish(u7r2(X_74),u7r1(X_74)) )],[refute_0_14,refute_0_7]) ).
cnf(refute_0_16,plain,
( s1most(u6r1(X_43))
| s2least(u6r1(X_43)) ),
inference(subst,[],[refute_0_15:[bind(X_74,$fot(u6r1(X_43)))]]) ).
cnf(refute_0_17,plain,
( ~ e(X_43)
| c(u6r1(X_43))
| f(X_43)
| s1most(u6r1(X_43)) ),
inference(resolve,[$cnf( s2least(u6r1(X_43)) )],[refute_0_16,refute_0_6]) ).
cnf(refute_0_18,plain,
( ~ e(exist)
| c(u6r1(exist))
| f(exist)
| s1most(u6r1(exist)) ),
inference(subst,[],[refute_0_17:[bind(X_43,$fot(exist))]]) ).
cnf(refute_0_19,plain,
( c(u6r1(exist))
| f(exist)
| s1most(u6r1(exist)) ),
inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_18]) ).
cnf(refute_0_20,plain,
( c(u6r1(exist))
| s1most(u6r1(exist)) ),
inference(resolve,[$cnf( f(exist) )],[refute_0_19,clause_2]) ).
cnf(refute_0_21,plain,
( c(u6r1(exist))
| f(exist) ),
inference(resolve,[$cnf( s1most(u6r1(exist)) )],[refute_0_20,refute_0_3]) ).
cnf(refute_0_22,plain,
c(u6r1(exist)),
inference(resolve,[$cnf( f(exist) )],[refute_0_21,clause_2]) ).
cnf(refute_0_23,plain,
t2least(u6r1(exist)),
inference(resolve,[$cnf( c(u6r1(exist)) )],[refute_0_22,refute_0_2]) ).
cnf(refute_0_24,plain,
t(u6r1(exist),u1r2(u6r1(exist))),
inference(resolve,[$cnf( t2least(u6r1(exist)) )],[refute_0_23,refute_0_1]) ).
cnf(refute_0_25,plain,
( ~ t(u6r1(exist),X3)
| ~ t(u6r1(exist),u1r1(u6r1(exist)))
| ~ t1most(u6r1(exist))
| equalish(X3,u1r1(u6r1(exist))) ),
inference(subst,[],[clause_11:[bind(X1,$fot(u6r1(exist))),bind(X2,$fot(u1r1(u6r1(exist))))]]) ).
cnf(refute_0_26,plain,
( ~ t2least(u6r1(exist))
| t(u6r1(exist),u1r1(u6r1(exist))) ),
inference(subst,[],[clause_6:[bind(X1,$fot(u6r1(exist)))]]) ).
cnf(refute_0_27,plain,
t(u6r1(exist),u1r1(u6r1(exist))),
inference(resolve,[$cnf( t2least(u6r1(exist)) )],[refute_0_23,refute_0_26]) ).
cnf(refute_0_28,plain,
( ~ t(u6r1(exist),X3)
| ~ t1most(u6r1(exist))
| equalish(X3,u1r1(u6r1(exist))) ),
inference(resolve,[$cnf( t(u6r1(exist),u1r1(u6r1(exist))) )],[refute_0_27,refute_0_25]) ).
cnf(refute_0_29,plain,
( ~ d(u6r1(exist))
| t1most(u6r1(exist)) ),
inference(subst,[],[clause_9:[bind(X1,$fot(u6r1(exist)))]]) ).
cnf(refute_0_30,plain,
( f(X_24)
| r(X_24,u6r1(X_24)) ),
inference(subst,[],[clause_29:[bind(X1,$fot(X_24))]]) ).
cnf(refute_0_31,plain,
( ~ e(X_24)
| ~ r(X_24,u6r1(X_24))
| d(u6r1(X_24)) ),
inference(subst,[],[clause_15:[bind(X1,$fot(X_24)),bind(X3,$fot(u6r1(X_24)))]]) ).
cnf(refute_0_32,plain,
( ~ e(X_24)
| d(u6r1(X_24))
| f(X_24) ),
inference(resolve,[$cnf( r(X_24,u6r1(X_24)) )],[refute_0_30,refute_0_31]) ).
cnf(refute_0_33,plain,
( ~ e(exist)
| d(u6r1(exist))
| f(exist) ),
inference(subst,[],[refute_0_32:[bind(X_24,$fot(exist))]]) ).
cnf(refute_0_34,plain,
( d(u6r1(exist))
| f(exist) ),
inference(resolve,[$cnf( e(exist) )],[clause_1,refute_0_33]) ).
cnf(refute_0_35,plain,
d(u6r1(exist)),
inference(resolve,[$cnf( f(exist) )],[refute_0_34,clause_2]) ).
cnf(refute_0_36,plain,
t1most(u6r1(exist)),
inference(resolve,[$cnf( d(u6r1(exist)) )],[refute_0_35,refute_0_29]) ).
cnf(refute_0_37,plain,
( ~ t(u6r1(exist),X3)
| equalish(X3,u1r1(u6r1(exist))) ),
inference(resolve,[$cnf( t1most(u6r1(exist)) )],[refute_0_36,refute_0_28]) ).
cnf(refute_0_38,plain,
( ~ t(u6r1(exist),u1r2(u6r1(exist)))
| equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))) ),
inference(subst,[],[refute_0_37:[bind(X3,$fot(u1r2(u6r1(exist))))]]) ).
cnf(refute_0_39,plain,
equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))),
inference(resolve,[$cnf( t(u6r1(exist),u1r2(u6r1(exist))) )],[refute_0_24,refute_0_38]) ).
cnf(refute_0_40,plain,
~ t2least(u6r1(exist)),
inference(resolve,[$cnf( equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))) )],[refute_0_39,refute_0_0]) ).
cnf(refute_0_41,plain,
$false,
inference(resolve,[$cnf( t2least(u6r1(exist)) )],[refute_0_23,refute_0_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : metis --show proof --show saturation %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 17:16:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.36
% 0.12/0.36 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.37
%------------------------------------------------------------------------------