TSTP Solution File: SYN982-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN982-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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 : Fri Sep 1 02:00:27 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 42
% Syntax : Number of formulae : 74 ( 16 unt; 26 typ; 0 def)
% Number of atoms : 103 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 115 ( 60 ~; 55 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 20 >; 10 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-1 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 69 ( 15 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
na: $i ).
tff(decl_23,type,
ssNonce: $i > $o ).
tff(decl_24,type,
t: $i ).
tff(decl_25,type,
ssP: $i > $o ).
tff(decl_26,type,
ssBf: $i > $o ).
tff(decl_27,type,
b: $i ).
tff(decl_28,type,
a: $i ).
tff(decl_29,type,
nb: $i > $i ).
tff(decl_30,type,
tb: $i > $i ).
tff(decl_31,type,
kt: $i > $i ).
tff(decl_32,type,
bt: $i ).
tff(decl_33,type,
key: ( $i * $i ) > $i ).
tff(decl_34,type,
ssTk: $i > $o ).
tff(decl_35,type,
at: $i ).
tff(decl_36,type,
ssBk: $i > $o ).
tff(decl_37,type,
pair: ( $i * $i ) > $i ).
tff(decl_38,type,
ssSa: $i > $o ).
tff(decl_39,type,
ssAk: $i > $o ).
tff(decl_40,type,
ssIm: $i > $o ).
tff(decl_41,type,
sent: ( $i * $i * $i ) > $i ).
tff(decl_42,type,
ssM: $i > $o ).
tff(decl_43,type,
triple: ( $i * $i * $i ) > $i ).
tff(decl_44,type,
quadr: ( $i * $i * $i * $i ) > $i ).
tff(decl_45,type,
ssIk: $i > $o ).
tff(decl_46,type,
encr: ( $i * $i ) > $i ).
tff(decl_47,type,
ssSb: $i > $o ).
cnf(clause30,axiom,
( ssSb(pair(X1,X2))
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ~ ssBf(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause16,axiom,
ssM(sent(a,b,pair(a,na))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).
cnf(clause3,axiom,
ssBf(na),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause34,axiom,
( ssBk(key(X2,X1))
| ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
| ~ ssSb(pair(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).
cnf(clause27,axiom,
( ssM(sent(X2,X3,X1))
| ~ ssIm(X1)
| ~ ssP(X2)
| ~ ssP(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).
cnf(clause4,axiom,
ssP(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(clause5,axiom,
ssP(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
cnf(clause29,axiom,
( ssIm(encr(X1,X2))
| ~ ssIm(X1)
| ~ ssIk(key(X2,X3))
| ~ ssP(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).
cnf(clause25,axiom,
( ssIk(key(X1,X2))
| ~ ssIm(X1)
| ~ ssP(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).
cnf(clause33,axiom,
( ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt))))
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ~ ssBf(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).
cnf(clause26,axiom,
( ssIm(pair(X1,X2))
| ~ ssIm(X1)
| ~ ssIm(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).
cnf(clause37,negated_conjecture,
( ~ ssIk(key(X1,b))
| ~ ssBk(key(X1,a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause37) ).
cnf(clause20,axiom,
( ssIm(X3)
| ~ ssM(sent(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).
cnf(clause18,axiom,
( ssIm(X2)
| ~ ssIm(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).
cnf(clause17,axiom,
( ssIm(X3)
| ~ ssIm(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).
cnf(clause14,axiom,
( ssIm(X2)
| ~ ssIm(pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).
cnf(c_0_16,axiom,
( ssSb(pair(X1,X2))
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ~ ssBf(X2) ),
clause30 ).
cnf(c_0_17,axiom,
ssM(sent(a,b,pair(a,na))),
clause16 ).
cnf(c_0_18,axiom,
ssBf(na),
clause3 ).
cnf(c_0_19,axiom,
( ssBk(key(X2,X1))
| ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
| ~ ssSb(pair(X1,X3)) ),
clause34 ).
cnf(c_0_20,plain,
ssSb(pair(a,na)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ssBk(key(X1,a))
| ~ ssM(sent(a,b,pair(encr(triple(a,X1,tb(na)),bt),encr(nb(na),X1)))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
( ssM(sent(X2,X3,X1))
| ~ ssIm(X1)
| ~ ssP(X2)
| ~ ssP(X3) ),
clause27 ).
cnf(c_0_23,axiom,
ssP(b),
clause4 ).
cnf(c_0_24,axiom,
ssP(a),
clause5 ).
cnf(c_0_25,axiom,
( ssIm(encr(X1,X2))
| ~ ssIm(X1)
| ~ ssIk(key(X2,X3))
| ~ ssP(X3) ),
clause29 ).
cnf(c_0_26,axiom,
( ssIk(key(X1,X2))
| ~ ssIm(X1)
| ~ ssP(X2) ),
clause25 ).
cnf(c_0_27,axiom,
( ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt))))
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ~ ssBf(X2) ),
clause33 ).
cnf(c_0_28,plain,
( ssBk(key(X1,a))
| ~ ssIm(pair(encr(triple(a,X1,tb(na)),bt),encr(nb(na),X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_29,axiom,
( ssIm(pair(X1,X2))
| ~ ssIm(X1)
| ~ ssIm(X2) ),
clause26 ).
cnf(c_0_30,plain,
( ssIm(encr(X1,X2))
| ~ ssIm(X1)
| ~ ssIm(X2)
| ~ ssP(X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssIk(key(X1,b))
| ~ ssBk(key(X1,a)) ),
clause37 ).
cnf(c_0_32,axiom,
( ssIm(X3)
| ~ ssM(sent(X1,X2,X3)) ),
clause20 ).
cnf(c_0_33,plain,
ssM(sent(b,t,triple(b,nb(na),encr(triple(a,na,tb(na)),bt)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_18])]) ).
cnf(c_0_34,plain,
( ssBk(key(X1,a))
| ~ ssIm(encr(triple(a,X1,tb(na)),bt))
| ~ ssIm(encr(nb(na),X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ssIm(encr(X1,X2))
| ~ ssIm(X1)
| ~ ssIm(X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssIm(X1)
| ~ ssBk(key(X1,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_23])]) ).
cnf(c_0_37,axiom,
( ssIm(X2)
| ~ ssIm(triple(X1,X2,X3)) ),
clause18 ).
cnf(c_0_38,plain,
ssIm(triple(b,nb(na),encr(triple(a,na,tb(na)),bt))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( ~ ssIm(encr(triple(a,X1,tb(na)),bt))
| ~ ssIm(nb(na))
| ~ ssIm(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
ssIm(nb(na)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,axiom,
( ssIm(X3)
| ~ ssIm(triple(X1,X2,X3)) ),
clause17 ).
cnf(c_0_42,axiom,
( ssIm(X2)
| ~ ssIm(pair(X1,X2)) ),
clause14 ).
cnf(c_0_43,plain,
ssIm(pair(a,na)),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_44,plain,
( ~ ssIm(encr(triple(a,X1,tb(na)),bt))
| ~ ssIm(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_45,plain,
ssIm(encr(triple(a,na,tb(na)),bt)),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_46,plain,
ssIm(na),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN982-1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n015.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 : Sat Aug 26 20:59:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.007000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.010000 s
%------------------------------------------------------------------------------