TSTP Solution File: SWV011+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV011+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %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 : Tue Aug 22 11:02:39 EDT 2023
% Result : Theorem 2.68s 1.71s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 26
% Syntax : Number of formulae : 31 ( 6 unt; 23 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 17 >; 10 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-1 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ t_holds > party_of_protocol > message > fresh_to_b > b_stored > b_holds > a_stored > a_holds > quadruple > triple > sent > pair > key > encrypt > #nlpp > generate_key > generate_expiration_time > generate_b_nonce > t > bt > b > at > an_a_nonce > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sent,type,
sent: ( $i * $i * $i ) > $i ).
tff(b_stored,type,
b_stored: $i > $o ).
tff(fresh_to_b,type,
fresh_to_b: $i > $o ).
tff(a,type,
a: $i ).
tff(t,type,
t: $i ).
tff(encrypt,type,
encrypt: ( $i * $i ) > $i ).
tff(key,type,
key: ( $i * $i ) > $i ).
tff(b_holds,type,
b_holds: $i > $o ).
tff(an_a_nonce,type,
an_a_nonce: $i ).
tff(a_holds,type,
a_holds: $i > $o ).
tff(b,type,
b: $i ).
tff(at,type,
at: $i ).
tff(t_holds,type,
t_holds: $i > $o ).
tff(message,type,
message: $i > $o ).
tff(generate_key,type,
generate_key: $i > $i ).
tff(a_stored,type,
a_stored: $i > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(party_of_protocol,type,
party_of_protocol: $i > $o ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(generate_b_nonce,type,
generate_b_nonce: $i > $i ).
tff(quadruple,type,
quadruple: ( $i * $i * $i * $i ) > $i ).
tff(bt,type,
bt: $i ).
tff(generate_expiration_time,type,
generate_expiration_time: $i > $i ).
tff(f_38,axiom,
a_holds(key(generate_key(an_a_nonce),b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff(f_36,axiom,
b_holds(key(generate_key(an_a_nonce),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f_46,negated_conjecture,
~ ? [U] :
( a_holds(key(U,b))
& b_holds(key(U,a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_26,plain,
a_holds(key(generate_key(an_a_nonce),b)),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_22,plain,
b_holds(key(generate_key(an_a_nonce),a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_34,plain,
! [U_1] :
( ~ b_holds(key(U_1,a))
| ~ a_holds(key(U_1,b)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_39,plain,
~ a_holds(key(generate_key(an_a_nonce),b)),
inference(resolution,[status(thm)],[c_22,c_34]) ).
tff(c_41,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV011+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:43:48 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.68/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.71
% 2.68/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.89/1.74
% 2.89/1.74 Inference rules
% 2.89/1.74 ----------------------
% 2.89/1.74 #Ref : 0
% 2.89/1.74 #Sup : 1
% 2.89/1.74 #Fact : 0
% 2.89/1.74 #Define : 0
% 2.89/1.74 #Split : 0
% 2.89/1.74 #Chain : 0
% 2.89/1.74 #Close : 0
% 2.89/1.74
% 2.89/1.74 Ordering : KBO
% 2.89/1.74
% 2.89/1.74 Simplification rules
% 2.89/1.74 ----------------------
% 2.89/1.74 #Subsume : 0
% 2.89/1.74 #Demod : 1
% 2.89/1.74 #Tautology : 0
% 2.89/1.74 #SimpNegUnit : 0
% 2.89/1.74 #BackRed : 0
% 2.89/1.74
% 2.89/1.74 #Partial instantiations: 0
% 2.89/1.74 #Strategies tried : 1
% 2.89/1.74
% 2.89/1.74 Timing (in seconds)
% 2.89/1.74 ----------------------
% 2.89/1.74 Preprocessing : 0.44
% 2.89/1.74 Parsing : 0.24
% 2.89/1.74 CNF conversion : 0.02
% 2.89/1.74 Main loop : 0.18
% 2.89/1.74 Inferencing : 0.07
% 2.89/1.74 Reduction : 0.05
% 2.89/1.74 Demodulation : 0.04
% 2.89/1.74 BG Simplification : 0.01
% 2.89/1.74 Subsumption : 0.04
% 2.89/1.74 Abstraction : 0.01
% 2.89/1.74 MUC search : 0.00
% 2.89/1.74 Cooper : 0.00
% 2.89/1.74 Total : 0.66
% 2.89/1.74 Index Insertion : 0.00
% 2.89/1.74 Index Deletion : 0.00
% 2.89/1.74 Index Matching : 0.00
% 2.89/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------