TSTP Solution File: SWW956+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW956+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 : n011.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.69s 2.15s
% Output : CNFRefutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 38
% Syntax : Number of formulae : 57 ( 13 unt; 28 typ; 0 def)
% Number of atoms : 49 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 13 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 15 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 13 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pred_mess > pred_equal > pred_attacker > tuple_B_in_1 > tuple_A_out_1 > constr_mod > constr_exp > constr_enc > constr_dec > #nlpp > tuple_B_out_3 > tuple_B_in_2 > tuple_A_out_4 > tuple_A_out_2 > tuple_A_in_3 > name_new0x2Dname > tuple_true > tuple_false > name_objective > name_c > name_P_7 > name_Nb > name_Na > name_G_8 > 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(constr_mod,type,
constr_mod: ( $i * $i ) > $i ).
tff(constr_CONST_2,type,
constr_CONST_2: $i ).
tff(name_P_7,type,
name_P_7: $i ).
tff(tuple_A_out_2,type,
tuple_A_out_2: $i > $i ).
tff(pred_attacker,type,
pred_attacker: $i > $o ).
tff(constr_exp,type,
constr_exp: ( $i * $i ) > $i ).
tff(tuple_false,type,
tuple_false: $i ).
tff(tuple_B_in_2,type,
tuple_B_in_2: $i > $i ).
tff(tuple_A_out_4,type,
tuple_A_out_4: $i > $i ).
tff(name_Nb,type,
name_Nb: $i ).
tff(constr_CONST_4,type,
constr_CONST_4: $i ).
tff(name_Na,type,
name_Na: $i ).
tff(tuple_B_in_1,type,
tuple_B_in_1: ( $i * $i ) > $i ).
tff(constr_CONST_0x30,type,
constr_CONST_0x30: $i ).
tff(tuple_A_in_3,type,
tuple_A_in_3: $i > $i ).
tff(constr_CONST_3,type,
constr_CONST_3: $i ).
tff(constr_CONST_1,type,
constr_CONST_1: $i ).
tff(name_G_8,type,
name_G_8: $i ).
tff(name_new0x2Dname,type,
name_new0x2Dname: $i > $i ).
tff(tuple_B_out_3,type,
tuple_B_out_3: $i > $i ).
tff(tuple_A_out_1,type,
tuple_A_out_1: ( $i * $i ) > $i ).
tff(constr_enc,type,
constr_enc: ( $i * $i ) > $i ).
tff(tuple_true,type,
tuple_true: $i ).
tff(f_259,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax89) ).
tff(f_233,axiom,
! [VAR_V_97,VAR_V_98] :
( pred_attacker(tuple_A_out_1(VAR_V_97,VAR_V_98))
=> pred_attacker(VAR_V_98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
tff(f_237,axiom,
! [VAR_V_10X301] :
( pred_attacker(VAR_V_10X301)
=> pred_attacker(tuple_A_in_3(VAR_V_10X301)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
tff(f_260,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
tff(f_219,axiom,
! [VAR_V_82] :
( pred_attacker(tuple_A_out_2(VAR_V_82))
=> pred_attacker(VAR_V_82) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
tff(f_272,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
tff(f_264,axiom,
! [VAR_B_186] :
( pred_attacker(tuple_A_in_3(VAR_B_186))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(VAR_B_186,name_Na),name_P_7)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax91) ).
tff(f_211,axiom,
! [VAR_V_76] :
( pred_attacker(tuple_A_out_4(VAR_V_76))
=> pred_attacker(VAR_V_76) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
tff(f_140,axiom,
! [VAR_K_0X30,VAR_M_0X30] : ( constr_dec(constr_enc(VAR_M_0X30,VAR_K_0X30),VAR_K_0X30) = VAR_M_0X30 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
tff(f_168,axiom,
! [VAR_V_42,VAR_V_43] :
( ( pred_attacker(VAR_V_42)
& pred_attacker(VAR_V_43) )
=> pred_attacker(constr_dec(VAR_V_42,VAR_V_43)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax62) ).
tff(c_180,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_237,plain,
! [VAR_V_98_67,VAR_V_97_68] :
( pred_attacker(VAR_V_98_67)
| ~ pred_attacker(tuple_A_out_1(VAR_V_97_68,VAR_V_98_67)) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_241,plain,
pred_attacker(name_G_8),
inference(resolution,[status(thm)],[c_180,c_237]) ).
tff(c_166,plain,
! [VAR_V_10X301_35] :
( pred_attacker(tuple_A_in_3(VAR_V_10X301_35))
| ~ pred_attacker(VAR_V_10X301_35) ),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_182,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(cnfTransformation,[status(thm)],[f_260]) ).
tff(c_158,plain,
! [VAR_V_82_28] :
( pred_attacker(VAR_V_82_28)
| ~ pred_attacker(tuple_A_out_2(VAR_V_82_28)) ),
inference(cnfTransformation,[status(thm)],[f_219]) ).
tff(c_251,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(resolution,[status(thm)],[c_182,c_158]) ).
tff(c_188,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_282,plain,
! [VAR_B_186_87] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(VAR_B_186_87,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(VAR_B_186_87)) ),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_154,plain,
! [VAR_V_76_26] :
( pred_attacker(VAR_V_76_26)
| ~ pred_attacker(tuple_A_out_4(VAR_V_76_26)) ),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_287,plain,
! [VAR_B_186_88] :
( pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(VAR_B_186_88,name_Na),name_P_7)))
| ~ pred_attacker(tuple_A_in_3(VAR_B_186_88)) ),
inference(resolution,[status(thm)],[c_282,c_154]) ).
tff(c_112,plain,
! [VAR_M_0X30_2,VAR_K_0X30_1] : ( constr_dec(constr_enc(VAR_M_0X30_2,VAR_K_0X30_1),VAR_K_0X30_1) = VAR_M_0X30_2 ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_273,plain,
! [VAR_V_42_83,VAR_V_43_84] :
( pred_attacker(constr_dec(VAR_V_42_83,VAR_V_43_84))
| ~ pred_attacker(VAR_V_43_84)
| ~ pred_attacker(VAR_V_42_83) ),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_276,plain,
! [VAR_M_0X30_2,VAR_K_0X30_1] :
( pred_attacker(VAR_M_0X30_2)
| ~ pred_attacker(VAR_K_0X30_1)
| ~ pred_attacker(constr_enc(VAR_M_0X30_2,VAR_K_0X30_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_112,c_273]) ).
tff(c_290,plain,
! [VAR_B_186_88] :
( pred_attacker(name_objective)
| ~ pred_attacker(constr_mod(constr_exp(VAR_B_186_88,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(VAR_B_186_88)) ),
inference(resolution,[status(thm)],[c_287,c_276]) ).
tff(c_294,plain,
! [VAR_B_186_89] :
( ~ pred_attacker(constr_mod(constr_exp(VAR_B_186_89,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(VAR_B_186_89)) ),
inference(negUnitSimplification,[status(thm)],[c_188,c_290]) ).
tff(c_304,plain,
~ pred_attacker(tuple_A_in_3(name_G_8)),
inference(resolution,[status(thm)],[c_251,c_294]) ).
tff(c_307,plain,
~ pred_attacker(name_G_8),
inference(resolution,[status(thm)],[c_166,c_304]) ).
tff(c_311,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_241,c_307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW956+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.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:11:51 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.69/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.69/2.15
% 4.69/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.69/2.19
% 4.69/2.19 Inference rules
% 4.69/2.19 ----------------------
% 4.69/2.19 #Ref : 0
% 4.69/2.19 #Sup : 22
% 4.69/2.19 #Fact : 0
% 4.69/2.19 #Define : 0
% 4.69/2.19 #Split : 0
% 4.69/2.19 #Chain : 0
% 4.69/2.19 #Close : 0
% 4.69/2.19
% 4.69/2.19 Ordering : KBO
% 4.69/2.19
% 4.69/2.19 Simplification rules
% 4.69/2.19 ----------------------
% 4.69/2.19 #Subsume : 0
% 4.69/2.19 #Demod : 2
% 4.69/2.19 #Tautology : 13
% 4.69/2.19 #SimpNegUnit : 1
% 4.69/2.19 #BackRed : 0
% 4.69/2.19
% 4.69/2.19 #Partial instantiations: 0
% 4.69/2.19 #Strategies tried : 1
% 4.69/2.19
% 4.69/2.19 Timing (in seconds)
% 4.69/2.19 ----------------------
% 4.69/2.19 Preprocessing : 0.63
% 4.69/2.19 Parsing : 0.35
% 4.69/2.19 CNF conversion : 0.04
% 4.69/2.19 Main loop : 0.48
% 4.69/2.19 Inferencing : 0.18
% 4.69/2.19 Reduction : 0.15
% 4.69/2.19 Demodulation : 0.10
% 4.69/2.19 BG Simplification : 0.03
% 4.69/2.19 Subsumption : 0.08
% 4.69/2.19 Abstraction : 0.01
% 4.69/2.19 MUC search : 0.00
% 4.69/2.19 Cooper : 0.00
% 4.69/2.19 Total : 1.17
% 4.69/2.19 Index Insertion : 0.00
% 4.69/2.19 Index Deletion : 0.00
% 4.69/2.19 Index Matching : 0.00
% 4.69/2.19 BG Taut test : 0.00
%------------------------------------------------------------------------------