TSTP Solution File: KRS013-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS013-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n006.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 : 300s
% DateTime : Thu Aug 31 05:39:58 EDT 2023
% Result : Unsatisfiable 0.17s 0.58s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 40
% Syntax : Number of formulae : 67 ( 5 unt; 24 typ; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 116 ( 53 ~; 63 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 23 >; 4 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-1 aty)
% Number of variables : 52 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
exist: $i ).
tff(decl_23,type,
e: $i > $o ).
tff(decl_24,type,
f: $i > $o ).
tff(decl_25,type,
t2least: $i > $o ).
tff(decl_26,type,
c: $i > $o ).
tff(decl_27,type,
u1r2: $i > $i ).
tff(decl_28,type,
u1r1: $i > $i ).
tff(decl_29,type,
equalish: ( $i * $i ) > $o ).
tff(decl_30,type,
t: ( $i * $i ) > $o ).
tff(decl_31,type,
t1most: $i > $o ).
tff(decl_32,type,
d: $i > $o ).
tff(decl_33,type,
u3r2: $i > $i ).
tff(decl_34,type,
u3r1: $i > $i ).
tff(decl_35,type,
r: ( $i * $i ) > $o ).
tff(decl_36,type,
s2least: $i > $o ).
tff(decl_37,type,
u4r1: $i > $i ).
tff(decl_38,type,
u4r2: $i > $i ).
tff(decl_39,type,
u5r2: $i > $i ).
tff(decl_40,type,
u5r1: $i > $i ).
tff(decl_41,type,
s: ( $i * $i ) > $o ).
tff(decl_42,type,
s1most: $i > $o ).
tff(decl_43,type,
u6r1: $i > $i ).
tff(decl_44,type,
u7r2: $i > $i ).
tff(decl_45,type,
u7r1: $i > $i ).
cnf(clause_11,axiom,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_6,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_16,axiom,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_29,axiom,
( f(X1)
| r(X1,u6r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_29) ).
cnf(clause_15,axiom,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_5,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_7,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,axiom,
( t2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_9,axiom,
( t1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_26,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_32,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_32) ).
cnf(clause_31,axiom,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_33,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_33) ).
cnf(clause_28,axiom,
( f(X1)
| ~ s1most(u6r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_28) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_16,axiom,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
clause_11 ).
cnf(c_0_17,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
clause_6 ).
cnf(c_0_18,axiom,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
clause_16 ).
cnf(c_0_19,axiom,
( f(X1)
| r(X1,u6r1(X1)) ),
clause_29 ).
cnf(c_0_20,axiom,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
clause_15 ).
cnf(c_0_21,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
clause_5 ).
cnf(c_0_22,plain,
( equalish(X1,u1r1(X2))
| ~ t1most(X2)
| ~ t(X2,X1)
| ~ t2least(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
clause_7 ).
cnf(c_0_24,axiom,
( t2least(X1)
| ~ c(X1) ),
clause_3 ).
cnf(c_0_25,plain,
( c(u6r1(X1))
| f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,axiom,
( t1most(X1)
| ~ d(X1) ),
clause_9 ).
cnf(c_0_27,plain,
( d(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
clause_26 ).
cnf(c_0_29,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ),
clause_32 ).
cnf(c_0_30,plain,
( ~ t1most(X1)
| ~ t2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_31,plain,
( t2least(u6r1(X1))
| f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( t1most(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,axiom,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
clause_31 ).
cnf(c_0_34,plain,
( s1most(X1)
| s2least(X1)
| equalish(X2,u7r1(X1))
| ~ s(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ),
clause_33 ).
cnf(c_0_36,plain,
( f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
( s1most(X1)
| s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,axiom,
( f(X1)
| ~ s1most(u6r1(X1)) ),
clause_28 ).
cnf(c_0_39,negated_conjecture,
~ f(exist),
clause_2 ).
cnf(c_0_40,plain,
( f(X1)
| ~ e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS013-1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Aug 28 02:05:36 EDT 2023
% 0.17/0.32 % CPUTime :
% 0.17/0.57 start to proof: theBenchmark
% 0.17/0.58 % Version : CSE_E---1.5
% 0.17/0.58 % Problem : theBenchmark.p
% 0.17/0.58 % Proof found
% 0.17/0.58 % SZS status Theorem for theBenchmark.p
% 0.17/0.58 % SZS output start Proof
% See solution above
% 0.17/0.59 % Total time : 0.007000 s
% 0.17/0.59 % SZS output end Proof
% 0.17/0.59 % Total time : 0.009000 s
%------------------------------------------------------------------------------