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 : n022.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 : Unsatisfiable 2.01s 1.52s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 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 : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 2 (; 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ b_holds > a_holds > key > #nlpp > generate_key > b > an_a_nonce > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $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(generate_key,type,
generate_key: $i > $i ).
tff(f_24,axiom,
a_holds(key(generate_key(an_a_nonce),b)),
file(unknown,unknown) ).
tff(f_23,axiom,
b_holds(key(generate_key(an_a_nonce),a)),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A] :
( ~ a_holds(key(A,b))
| ~ b_holds(key(A,a)) ),
file(unknown,unknown) ).
tff(c_4,plain,
a_holds(key(generate_key(an_a_nonce),b)),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_2,plain,
b_holds(key(generate_key(an_a_nonce),a)),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_7,plain,
! [A_2] :
( ~ b_holds(key(A_2,a))
| ~ a_holds(key(A_2,b)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
~ a_holds(key(generate_key(an_a_nonce),b)),
inference(resolution,[status(thm)],[c_2,c_7]) ).
tff(c_14,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_10]) ).
%------------------------------------------------------------------------------
%----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.12/0.35 % Computer : n022.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Thu Aug 3 23:01:33 EDT 2023
% 0.12/0.35 % CPUTime :
% 2.01/1.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.01/1.52
% 2.01/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.36/1.55
% 2.36/1.55 Inference rules
% 2.36/1.55 ----------------------
% 2.36/1.55 #Ref : 0
% 2.36/1.55 #Sup : 1
% 2.36/1.55 #Fact : 0
% 2.36/1.55 #Define : 0
% 2.36/1.55 #Split : 0
% 2.36/1.55 #Chain : 0
% 2.36/1.55 #Close : 0
% 2.36/1.55
% 2.36/1.55 Ordering : KBO
% 2.36/1.55
% 2.36/1.55 Simplification rules
% 2.36/1.55 ----------------------
% 2.36/1.55 #Subsume : 0
% 2.36/1.55 #Demod : 1
% 2.36/1.55 #Tautology : 0
% 2.36/1.55 #SimpNegUnit : 0
% 2.36/1.55 #BackRed : 0
% 2.36/1.55
% 2.36/1.55 #Partial instantiations: 0
% 2.36/1.55 #Strategies tried : 1
% 2.36/1.55
% 2.36/1.55 Timing (in seconds)
% 2.36/1.55 ----------------------
% 2.36/1.55 Preprocessing : 0.37
% 2.36/1.55 Parsing : 0.21
% 2.36/1.55 CNF conversion : 0.02
% 2.36/1.55 Main loop : 0.13
% 2.36/1.55 Inferencing : 0.07
% 2.36/1.55 Reduction : 0.02
% 2.36/1.55 Demodulation : 0.02
% 2.36/1.55 BG Simplification : 0.01
% 2.36/1.55 Subsumption : 0.02
% 2.36/1.55 Abstraction : 0.00
% 2.36/1.55 MUC search : 0.00
% 2.36/1.55 Cooper : 0.00
% 2.36/1.55 Total : 0.54
% 2.36/1.55 Index Insertion : 0.00
% 2.36/1.55 Index Deletion : 0.00
% 2.36/1.55 Index Matching : 0.00
% 2.36/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------