TSTP Solution File: KRS001-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS001-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 : n014.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:55 EDT 2023
% Result : Unsatisfiable 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 21
% Syntax : Number of formulae : 37 ( 5 unt; 12 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 29 ~; 26 |; 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 : 13 ( 11 >; 2 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 25 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
exist: $i ).
tff(decl_23,type,
e: $i > $o ).
tff(decl_24,type,
r2least: $i > $o ).
tff(decl_25,type,
c: $i > $o ).
tff(decl_26,type,
u1r2: $i > $i ).
tff(decl_27,type,
u1r1: $i > $i ).
tff(decl_28,type,
equalish: ( $i * $i ) > $o ).
tff(decl_29,type,
r: ( $i * $i ) > $o ).
tff(decl_30,type,
r1most: $i > $o ).
tff(decl_31,type,
d: $i > $o ).
tff(decl_32,type,
u3r2: $i > $i ).
tff(decl_33,type,
u3r1: $i > $i ).
cnf(clause_10,axiom,
( equalish(X1,X2)
| ~ r1most(X3)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_5,axiom,
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_2,axiom,
( r2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_15,axiom,
( c(X1)
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_8,axiom,
( r1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_14,axiom,
( d(X1)
| ~ e(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_4,axiom,
( ~ r2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,axiom,
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_9,axiom,
( equalish(X1,X2)
| ~ r1most(X3)
| ~ r(X3,X1)
| ~ r(X3,X2) ),
clause_10 ).
cnf(c_0_10,axiom,
( r(X1,u1r1(X1))
| ~ r2least(X1) ),
clause_5 ).
cnf(c_0_11,axiom,
( r2least(X1)
| ~ c(X1) ),
clause_2 ).
cnf(c_0_12,axiom,
( c(X1)
| ~ e(X1) ),
clause_15 ).
cnf(c_0_13,axiom,
( r1most(X1)
| ~ d(X1) ),
clause_8 ).
cnf(c_0_14,axiom,
( d(X1)
| ~ e(X1) ),
clause_14 ).
cnf(c_0_15,axiom,
( ~ r2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
clause_4 ).
cnf(c_0_16,plain,
( equalish(X1,u1r1(X2))
| ~ r1most(X2)
| ~ r(X2,X1)
| ~ r2least(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,axiom,
( r(X1,u1r2(X1))
| ~ r2least(X1) ),
clause_6 ).
cnf(c_0_18,plain,
( r2least(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_20,plain,
( r1most(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ r1most(X1)
| ~ r2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
r2least(exist),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
r1most(exist),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS001-1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 01:56:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.59 % Version : CSE_E---1.5
% 0.19/0.59 % Problem : theBenchmark.p
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark.p
% 0.19/0.59 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.005000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.008000 s
%------------------------------------------------------------------------------