TSTP Solution File: SWW951+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW951+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 : n025.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:23 EDT 2023
% Result : Theorem 3.93s 2.10s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 29
% Syntax : Number of formulae : 52 ( 19 unt; 21 typ; 0 def)
% Number of atoms : 45 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 8 |; 1 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 10 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pred_mess > pred_equal > pred_attacker > constr_xor > #nlpp > tuple_T_out_4 > tuple_T_out_2 > tuple_T_in_3 > tuple_T_in_1 > name_new0x2Dname > constr_h > tuple_true > tuple_false > name_objective > name_k > name_c > constr_ZERO > constr_CONST_4 > constr_CONST_3 > constr_CONST_2 > constr_CONST_1 > constr_CONST_0x30
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(tuple_T_in_3,type,
tuple_T_in_3: $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(tuple_T_in_1,type,
tuple_T_in_1: $i > $i ).
tff(name_objective,type,
name_objective: $i ).
tff(constr_h,type,
constr_h: $i > $i ).
tff(constr_CONST_2,type,
constr_CONST_2: $i ).
tff(tuple_T_out_4,type,
tuple_T_out_4: $i > $i ).
tff(pred_attacker,type,
pred_attacker: $i > $o ).
tff(tuple_false,type,
tuple_false: $i ).
tff(constr_ZERO,type,
constr_ZERO: $i ).
tff(constr_CONST_4,type,
constr_CONST_4: $i ).
tff(name_k,type,
name_k: $i ).
tff(tuple_T_out_2,type,
tuple_T_out_2: $i > $i ).
tff(constr_CONST_0x30,type,
constr_CONST_0x30: $i ).
tff(constr_CONST_3,type,
constr_CONST_3: $i ).
tff(constr_CONST_1,type,
constr_CONST_1: $i ).
tff(constr_xor,type,
constr_xor: ( $i * $i ) > $i ).
tff(name_new0x2Dname,type,
name_new0x2Dname: $i > $i ).
tff(tuple_true,type,
tuple_true: $i ).
tff(f_188,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
tff(f_186,axiom,
! [VAR_K_XOR_K1_10X305,VAR_R1_10X306] :
( ( pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305))
& pred_attacker(tuple_T_in_1(VAR_R1_10X306)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax64) ).
tff(f_142,axiom,
! [VAR_V_44] :
( pred_attacker(VAR_V_44)
=> pred_attacker(tuple_T_in_3(VAR_V_44)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
tff(f_122,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax44) ).
tff(f_150,axiom,
! [VAR_V_50X30] :
( pred_attacker(VAR_V_50X30)
=> pred_attacker(tuple_T_in_1(VAR_V_50X30)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
tff(f_105,axiom,
! [VAR_X_9] : ( constr_xor(VAR_X_9,constr_ZERO) = VAR_X_9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).
tff(f_180,axiom,
! [VAR_R1_85] :
( pred_attacker(tuple_T_in_1(VAR_R1_85))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,VAR_R1_85)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax63) ).
tff(f_130,axiom,
! [VAR_V_35] :
( pred_attacker(tuple_T_out_4(VAR_V_35))
=> pred_attacker(VAR_V_35) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
tff(c_132,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_130,plain,
! [VAR_R1_10X306_27,VAR_K_XOR_K1_10X305_26] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(VAR_R1_10X306_27))
| ~ pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305_26)) ),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_375,plain,
! [VAR_K_XOR_K1_10X305_26] : ~ pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305_26)),
inference(splitLeft,[status(thm)],[c_130]) ).
tff(c_100,plain,
! [VAR_V_44_15] :
( pred_attacker(tuple_T_in_3(VAR_V_44_15))
| ~ pred_attacker(VAR_V_44_15) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_376,plain,
! [VAR_V_44_15] : ~ pred_attacker(VAR_V_44_15),
inference(negUnitSimplification,[status(thm)],[c_375,c_100]) ).
tff(c_90,plain,
pred_attacker(constr_ZERO),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_104,plain,
! [VAR_V_50X30_17] :
( pred_attacker(tuple_T_in_1(VAR_V_50X30_17))
| ~ pred_attacker(VAR_V_50X30_17) ),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_76,plain,
! [VAR_X_9_2] : ( constr_xor(VAR_X_9_2,constr_ZERO) = VAR_X_9_2 ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_310,plain,
! [VAR_R1_85_50] :
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,VAR_R1_85_50))))
| ~ pred_attacker(tuple_T_in_1(VAR_R1_85_50)) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_325,plain,
( pred_attacker(tuple_T_out_2(constr_h(name_k)))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(superposition,[status(thm),theory(equality)],[c_76,c_310]) ).
tff(c_331,plain,
~ pred_attacker(tuple_T_in_1(constr_ZERO)),
inference(splitLeft,[status(thm)],[c_325]) ).
tff(c_359,plain,
~ pred_attacker(constr_ZERO),
inference(resolution,[status(thm)],[c_104,c_331]) ).
tff(c_363,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_90,c_359]) ).
tff(c_364,plain,
pred_attacker(tuple_T_out_2(constr_h(name_k))),
inference(splitRight,[status(thm)],[c_325]) ).
tff(c_400,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_376,c_364]) ).
tff(c_401,plain,
! [VAR_R1_10X306_27] :
( ~ pred_attacker(tuple_T_in_1(VAR_R1_10X306_27))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(splitRight,[status(thm)],[c_130]) ).
tff(c_472,plain,
! [VAR_R1_10X306_27] : ~ pred_attacker(tuple_T_in_1(VAR_R1_10X306_27)),
inference(splitLeft,[status(thm)],[c_401]) ).
tff(c_365,plain,
pred_attacker(tuple_T_in_1(constr_ZERO)),
inference(splitRight,[status(thm)],[c_325]) ).
tff(c_475,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_472,c_365]) ).
tff(c_476,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(splitRight,[status(thm)],[c_401]) ).
tff(c_94,plain,
! [VAR_V_35_12] :
( pred_attacker(VAR_V_35_12)
| ~ pred_attacker(tuple_T_out_4(VAR_V_35_12)) ),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_479,plain,
pred_attacker(name_objective),
inference(resolution,[status(thm)],[c_476,c_94]) ).
tff(c_483,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_132,c_479]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWW951+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 19:43:34 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.93/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.93/2.10
% 3.93/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.36/2.13
% 4.36/2.13 Inference rules
% 4.36/2.13 ----------------------
% 4.36/2.13 #Ref : 0
% 4.36/2.13 #Sup : 65
% 4.36/2.13 #Fact : 0
% 4.36/2.13 #Define : 0
% 4.36/2.13 #Split : 4
% 4.36/2.13 #Chain : 0
% 4.36/2.13 #Close : 0
% 4.36/2.13
% 4.36/2.13 Ordering : KBO
% 4.36/2.13
% 4.36/2.13 Simplification rules
% 4.36/2.13 ----------------------
% 4.36/2.13 #Subsume : 32
% 4.36/2.13 #Demod : 23
% 4.36/2.13 #Tautology : 44
% 4.36/2.13 #SimpNegUnit : 47
% 4.36/2.13 #BackRed : 26
% 4.36/2.13
% 4.36/2.13 #Partial instantiations: 0
% 4.36/2.13 #Strategies tried : 1
% 4.36/2.13
% 4.36/2.13 Timing (in seconds)
% 4.36/2.13 ----------------------
% 4.36/2.14 Preprocessing : 0.55
% 4.36/2.14 Parsing : 0.30
% 4.36/2.14 CNF conversion : 0.03
% 4.36/2.14 Main loop : 0.42
% 4.36/2.14 Inferencing : 0.14
% 4.36/2.14 Reduction : 0.14
% 4.36/2.14 Demodulation : 0.09
% 4.36/2.14 BG Simplification : 0.02
% 4.36/2.14 Subsumption : 0.09
% 4.36/2.14 Abstraction : 0.01
% 4.36/2.14 MUC search : 0.00
% 4.36/2.14 Cooper : 0.00
% 4.36/2.14 Total : 1.02
% 4.36/2.14 Index Insertion : 0.00
% 4.36/2.14 Index Deletion : 0.00
% 4.36/2.14 Index Matching : 0.00
% 4.36/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------