TSTP Solution File: KRS012-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KRS012-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 : 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 : 300s
% DateTime : Thu Aug 31 05:39:58 EDT 2023
% Result : Unsatisfiable 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 34 ( 17 ~; 17 |; 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 : 9 ( 8 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
exists: $i ).
tff(decl_23,type,
c: $i > $o ).
tff(decl_24,type,
f: $i > $o ).
tff(decl_25,type,
e: $i > $o ).
tff(decl_26,type,
r: ( $i * $i ) > $o ).
tff(decl_27,type,
d: $i > $o ).
tff(decl_28,type,
u0r1: $i > $i ).
tff(decl_29,type,
u0r2: $i > $i ).
tff(decl_30,type,
u1r1: $i > $i ).
cnf(clause_3,axiom,
( e(X1)
| ~ c(X2)
| ~ r(X2,X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
( d(X1)
| ~ c(X2)
| ~ r(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_13,axiom,
( f(X1)
| r(X1,u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_12,axiom,
( f(X1)
| ~ e(u1r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_2,negated_conjecture,
~ f(exists),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
c(exists),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_6,axiom,
( e(X1)
| ~ c(X2)
| ~ r(X2,X1)
| ~ d(X1) ),
clause_3 ).
cnf(c_0_7,axiom,
( d(X1)
| ~ c(X2)
| ~ r(X2,X1) ),
clause_4 ).
cnf(c_0_8,plain,
( e(X1)
| ~ r(X2,X1)
| ~ c(X2) ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
( f(X1)
| r(X1,u1r1(X1)) ),
clause_13 ).
cnf(c_0_10,axiom,
( f(X1)
| ~ e(u1r1(X1)) ),
clause_12 ).
cnf(c_0_11,negated_conjecture,
~ f(exists),
clause_2 ).
cnf(c_0_12,plain,
( f(X1)
| ~ c(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
c(exists),
clause_1 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS012-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 : n029.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:37:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.57 % Version : CSE_E---1.5
% 0.20/0.57 % Problem : theBenchmark.p
% 0.20/0.57 % Proof found
% 0.20/0.57 % SZS status Theorem for theBenchmark.p
% 0.20/0.57 % SZS output start Proof
% See solution above
% 0.20/0.57 % Total time : 0.004000 s
% 0.20/0.57 % SZS output end Proof
% 0.20/0.57 % Total time : 0.006000 s
%------------------------------------------------------------------------------