TSTP Solution File: SWW955+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW955+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n028.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:08:24 EDT 2023
% Result : Theorem 4.58s 2.01s
% Output : CNFRefutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 38
% Syntax : Number of formulae : 63 ( 17 unt; 27 typ; 0 def)
% Number of atoms : 58 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 14 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 15 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 12 con; 0-2 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pred_mess > pred_equal > pred_attacker > constr_enc > constr_dec > constr_comm_enc > constr_comm_dec > #nlpp > tuple_B_out_2 > tuple_B_in_3 > tuple_B_in_1 > tuple_A_out_4 > tuple_A_out_3 > tuple_A_out_1 > tuple_A_in_2 > name_new0x2Dname > tuple_true > tuple_false > name_objective > name_m_9 > name_c > name_Kb > name_Ka > constr_CONST_4 > constr_CONST_3 > constr_CONST_2 > constr_CONST_1 > constr_CONST_0x30
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(constr_dec,type,
constr_dec: ( $i * $i ) > $i ).
tff(pred_mess,type,
pred_mess: ( $i * $i ) > $o ).
tff(name_c,type,
name_c: $i ).
tff(pred_equal,type,
pred_equal: ( $i * $i ) > $o ).
tff(name_objective,type,
name_objective: $i ).
tff(tuple_A_in_2,type,
tuple_A_in_2: $i > $i ).
tff(name_m_9,type,
name_m_9: $i ).
tff(constr_CONST_2,type,
constr_CONST_2: $i ).
tff(pred_attacker,type,
pred_attacker: $i > $o ).
tff(tuple_false,type,
tuple_false: $i ).
tff(tuple_B_in_3,type,
tuple_B_in_3: $i > $i ).
tff(tuple_A_out_1,type,
tuple_A_out_1: $i > $i ).
tff(constr_comm_dec,type,
constr_comm_dec: ( $i * $i ) > $i ).
tff(tuple_A_out_4,type,
tuple_A_out_4: $i > $i ).
tff(constr_CONST_4,type,
constr_CONST_4: $i ).
tff(tuple_A_out_3,type,
tuple_A_out_3: $i > $i ).
tff(name_Ka,type,
name_Ka: $i ).
tff(name_Kb,type,
name_Kb: $i ).
tff(tuple_B_out_2,type,
tuple_B_out_2: $i > $i ).
tff(constr_CONST_0x30,type,
constr_CONST_0x30: $i ).
tff(constr_CONST_3,type,
constr_CONST_3: $i ).
tff(constr_comm_enc,type,
constr_comm_enc: ( $i * $i ) > $i ).
tff(constr_CONST_1,type,
constr_CONST_1: $i ).
tff(name_new0x2Dname,type,
name_new0x2Dname: $i > $i ).
tff(constr_enc,type,
constr_enc: ( $i * $i ) > $i ).
tff(tuple_true,type,
tuple_true: $i ).
tff(tuple_B_in_1,type,
tuple_B_in_1: $i > $i ).
tff(f_241,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
tff(f_227,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax77) ).
tff(f_201,axiom,
! [VAR_V_77] :
( pred_attacker(tuple_A_out_1(VAR_V_77))
=> pred_attacker(VAR_V_77) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
tff(f_205,axiom,
! [VAR_V_80X30] :
( pred_attacker(VAR_V_80X30)
=> pred_attacker(tuple_A_in_2(VAR_V_80X30)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
tff(f_122,axiom,
! [VAR_K_0X30,VAR_M_0X30] : ( constr_comm_dec(constr_comm_enc(VAR_M_0X30,VAR_K_0X30),VAR_K_0X30) = VAR_M_0X30 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
tff(f_231,axiom,
! [VAR_MSG1_128] :
( pred_attacker(tuple_A_in_2(VAR_MSG1_128))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(VAR_MSG1_128,name_Ka))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
tff(f_193,axiom,
! [VAR_V_71] :
( pred_attacker(tuple_A_out_3(VAR_V_71))
=> pred_attacker(VAR_V_71) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
tff(f_235,axiom,
! [VAR_MSG1_142] :
( pred_attacker(tuple_A_in_2(VAR_MSG1_142))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
tff(f_185,axiom,
! [VAR_V_65] :
( pred_attacker(tuple_A_out_4(VAR_V_65))
=> pred_attacker(VAR_V_65) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
tff(f_120,axiom,
! [VAR_K_8,VAR_M_7] : ( constr_dec(constr_enc(VAR_M_7,VAR_K_8),VAR_K_8) = VAR_M_7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
tff(f_136,axiom,
! [VAR_V_33,VAR_V_34] :
( ( pred_attacker(VAR_V_33)
& pred_attacker(VAR_V_34) )
=> pred_attacker(constr_dec(VAR_V_33,VAR_V_34)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax50) ).
tff(c_164,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_156,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_140,plain,
! [VAR_V_77_24] :
( pred_attacker(VAR_V_77_24)
| ~ pred_attacker(tuple_A_out_1(VAR_V_77_24)) ),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_190,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(resolution,[status(thm)],[c_156,c_140]) ).
tff(c_142,plain,
! [VAR_V_80X30_25] :
( pred_attacker(tuple_A_in_2(VAR_V_80X30_25))
| ~ pred_attacker(VAR_V_80X30_25) ),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_94,plain,
! [VAR_M_0X30_4,VAR_K_0X30_3] : ( constr_comm_dec(constr_comm_enc(VAR_M_0X30_4,VAR_K_0X30_3),VAR_K_0X30_3) = VAR_M_0X30_4 ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_242,plain,
! [VAR_MSG1_128_64] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(VAR_MSG1_128_64,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(VAR_MSG1_128_64)) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_136,plain,
! [VAR_V_71_22] :
( pred_attacker(VAR_V_71_22)
| ~ pred_attacker(tuple_A_out_3(VAR_V_71_22)) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_255,plain,
! [VAR_MSG1_128_67] :
( pred_attacker(constr_comm_dec(VAR_MSG1_128_67,name_Ka))
| ~ pred_attacker(tuple_A_in_2(VAR_MSG1_128_67)) ),
inference(resolution,[status(thm)],[c_242,c_136]) ).
tff(c_260,plain,
! [VAR_M_0X30_68] :
( pred_attacker(VAR_M_0X30_68)
| ~ pred_attacker(tuple_A_in_2(constr_comm_enc(VAR_M_0X30_68,name_Ka))) ),
inference(superposition,[status(thm),theory(equality)],[c_94,c_255]) ).
tff(c_265,plain,
! [VAR_M_0X30_69] :
( pred_attacker(VAR_M_0X30_69)
| ~ pred_attacker(constr_comm_enc(VAR_M_0X30_69,name_Ka)) ),
inference(resolution,[status(thm)],[c_142,c_260]) ).
tff(c_269,plain,
pred_attacker(name_m_9),
inference(resolution,[status(thm)],[c_190,c_265]) ).
tff(c_160,plain,
! [VAR_MSG1_142_34] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(VAR_MSG1_142_34)) ),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_282,plain,
! [VAR_MSG1_142_34] : ~ pred_attacker(tuple_A_in_2(VAR_MSG1_142_34)),
inference(splitLeft,[status(thm)],[c_160]) ).
tff(c_283,plain,
! [VAR_V_80X30_25] : ~ pred_attacker(VAR_V_80X30_25),
inference(negUnitSimplification,[status(thm)],[c_282,c_142]) ).
tff(c_317,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_283,c_269]) ).
tff(c_318,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(splitRight,[status(thm)],[c_160]) ).
tff(c_132,plain,
! [VAR_V_65_20] :
( pred_attacker(VAR_V_65_20)
| ~ pred_attacker(tuple_A_out_4(VAR_V_65_20)) ),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_322,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(resolution,[status(thm)],[c_318,c_132]) ).
tff(c_92,plain,
! [VAR_M_7_2,VAR_K_8_1] : ( constr_dec(constr_enc(VAR_M_7_2,VAR_K_8_1),VAR_K_8_1) = VAR_M_7_2 ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_251,plain,
! [VAR_V_33_65,VAR_V_34_66] :
( pred_attacker(constr_dec(VAR_V_33_65,VAR_V_34_66))
| ~ pred_attacker(VAR_V_34_66)
| ~ pred_attacker(VAR_V_33_65) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_323,plain,
! [VAR_M_7_75,VAR_K_8_76] :
( pred_attacker(VAR_M_7_75)
| ~ pred_attacker(VAR_K_8_76)
| ~ pred_attacker(constr_enc(VAR_M_7_75,VAR_K_8_76)) ),
inference(superposition,[status(thm),theory(equality)],[c_92,c_251]) ).
tff(c_326,plain,
( pred_attacker(name_objective)
| ~ pred_attacker(name_m_9) ),
inference(resolution,[status(thm)],[c_322,c_323]) ).
tff(c_332,plain,
pred_attacker(name_objective),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_326]) ).
tff(c_334,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_164,c_332]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW955+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n028.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 19:48:09 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.58/2.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.58/2.02
% 4.58/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.58/2.05
% 4.58/2.05 Inference rules
% 4.58/2.05 ----------------------
% 4.58/2.05 #Ref : 0
% 4.58/2.05 #Sup : 25
% 4.58/2.05 #Fact : 0
% 4.58/2.05 #Define : 0
% 4.58/2.05 #Split : 1
% 4.58/2.05 #Chain : 0
% 4.58/2.05 #Close : 0
% 4.58/2.05
% 4.58/2.05 Ordering : KBO
% 4.58/2.05
% 4.58/2.05 Simplification rules
% 4.58/2.05 ----------------------
% 4.58/2.05 #Subsume : 27
% 4.58/2.05 #Demod : 1
% 4.58/2.05 #Tautology : 13
% 4.58/2.05 #SimpNegUnit : 34
% 4.58/2.05 #BackRed : 13
% 4.58/2.05
% 4.58/2.05 #Partial instantiations: 0
% 4.58/2.05 #Strategies tried : 1
% 4.58/2.05
% 4.58/2.05 Timing (in seconds)
% 4.58/2.05 ----------------------
% 4.58/2.05 Preprocessing : 0.58
% 4.58/2.05 Parsing : 0.32
% 4.58/2.05 CNF conversion : 0.04
% 4.58/2.05 Main loop : 0.40
% 4.58/2.05 Inferencing : 0.14
% 4.58/2.05 Reduction : 0.13
% 4.58/2.05 Demodulation : 0.08
% 4.58/2.05 BG Simplification : 0.02
% 4.58/2.05 Subsumption : 0.08
% 4.58/2.05 Abstraction : 0.01
% 4.58/2.05 MUC search : 0.00
% 4.58/2.05 Cooper : 0.00
% 4.58/2.05 Total : 1.04
% 4.58/2.05 Index Insertion : 0.00
% 4.58/2.05 Index Deletion : 0.00
% 4.58/2.05 Index Matching : 0.00
% 4.58/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------