TSTP Solution File: SWW950+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW950+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/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 : n027.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 4.77s 2.23s
% Output : CNFRefutation 5.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 33
% Syntax : Number of formulae : 63 ( 26 unt; 22 typ; 0 def)
% Number of atoms : 60 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 11 |; 2 &)
% ( 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 : 14 ( 10 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 29 (; 29 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pred_mess > pred_equal > pred_attacker > tuple_T_in_3 > constr_xor > #nlpp > tuple_T_out_4 > tuple_T_out_2 > tuple_T_in_1 > name_new0x2Dname > constr_h > tuple_true > tuple_false > name_objective > name_ki > name_k0x30 > 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(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(tuple_T_in_3,type,
tuple_T_in_3: ( $i * $i ) > $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_ki,type,
name_ki: $i ).
tff(tuple_T_out_2,type,
tuple_T_out_2: $i > $i ).
tff(constr_CONST_0x30,type,
constr_CONST_0x30: $i ).
tff(name_k0x30,type,
name_k0x30: $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_212,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
tff(f_140,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax53) ).
tff(f_162,axiom,
! [VAR_V_48,VAR_V_49] :
( ( pred_attacker(VAR_V_48)
& pred_attacker(VAR_V_49) )
=> pred_attacker(tuple_T_in_3(VAR_V_48,VAR_V_49)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
tff(f_123,axiom,
! [VAR_X_9] : ( constr_xor(VAR_X_9,constr_ZERO) = VAR_X_9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
tff(f_125,axiom,
! [VAR_X_7,VAR_Y_8] : ( constr_xor(VAR_X_7,VAR_Y_8) = constr_xor(VAR_Y_8,VAR_X_7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
tff(f_210,axiom,
! [VAR_A_143,VAR_R_144] :
( ( pred_attacker(tuple_T_in_3(VAR_A_143,constr_h(constr_xor(VAR_A_143,constr_xor(name_k0x30,name_ki)))))
& pred_attacker(tuple_T_in_1(VAR_R_144)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
tff(f_174,axiom,
! [VAR_V_63] :
( pred_attacker(VAR_V_63)
=> pred_attacker(tuple_T_in_1(VAR_V_63)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax61) ).
tff(f_204,axiom,
! [VAR_R_10X308] :
( pred_attacker(tuple_T_in_1(VAR_R_10X308))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(VAR_R_10X308,constr_xor(name_k0x30,name_ki))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax73) ).
tff(f_156,axiom,
! [VAR_V_44] :
( pred_attacker(tuple_T_out_2(VAR_V_44))
=> pred_attacker(VAR_V_44) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
tff(f_200,axiom,
! [VAR_V_78] : pred_attacker(name_new0x2Dname(VAR_V_78)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax72) ).
tff(f_148,axiom,
! [VAR_V_38] :
( pred_attacker(tuple_T_out_4(VAR_V_38))
=> pred_attacker(VAR_V_38) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
tff(c_152,plain,
~ pred_attacker(name_objective),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_108,plain,
pred_attacker(constr_ZERO),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_118,plain,
! [VAR_V_48_15,VAR_V_49_16] :
( pred_attacker(tuple_T_in_3(VAR_V_48_15,VAR_V_49_16))
| ~ pred_attacker(VAR_V_49_16)
| ~ pred_attacker(VAR_V_48_15) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_94,plain,
! [VAR_X_9_2] : ( constr_xor(VAR_X_9_2,constr_ZERO) = VAR_X_9_2 ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_202,plain,
! [VAR_Y_8_47,VAR_X_7_48] : ( constr_xor(VAR_Y_8_47,VAR_X_7_48) = constr_xor(VAR_X_7_48,VAR_Y_8_47) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_237,plain,
! [VAR_X_9_2] : ( constr_xor(constr_ZERO,VAR_X_9_2) = VAR_X_9_2 ),
inference(superposition,[status(thm),theory(equality)],[c_94,c_202]) ).
tff(c_150,plain,
! [VAR_R_144_31,VAR_A_143_30] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(VAR_R_144_31))
| ~ pred_attacker(tuple_T_in_3(VAR_A_143_30,constr_h(constr_xor(VAR_A_143_30,constr_xor(name_k0x30,name_ki))))) ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_819,plain,
! [VAR_A_143_70] : ~ pred_attacker(tuple_T_in_3(VAR_A_143_70,constr_h(constr_xor(VAR_A_143_70,constr_xor(name_k0x30,name_ki))))),
inference(splitLeft,[status(thm)],[c_150]) ).
tff(c_847,plain,
~ pred_attacker(tuple_T_in_3(constr_ZERO,constr_h(constr_xor(name_k0x30,name_ki)))),
inference(superposition,[status(thm),theory(equality)],[c_237,c_819]) ).
tff(c_883,plain,
( ~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(constr_ZERO) ),
inference(resolution,[status(thm)],[c_118,c_847]) ).
tff(c_886,plain,
~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki))),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_883]) ).
tff(c_124,plain,
! [VAR_V_63_21] :
( pred_attacker(tuple_T_in_1(VAR_V_63_21))
| ~ pred_attacker(VAR_V_63_21) ),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_470,plain,
! [VAR_R_10X308_63] :
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(VAR_R_10X308_63,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(VAR_R_10X308_63)) ),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_485,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(superposition,[status(thm),theory(equality)],[c_237,c_470]) ).
tff(c_1371,plain,
~ pred_attacker(tuple_T_in_1(constr_ZERO)),
inference(splitLeft,[status(thm)],[c_485]) ).
tff(c_1553,plain,
~ pred_attacker(constr_ZERO),
inference(resolution,[status(thm)],[c_124,c_1371]) ).
tff(c_1557,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_108,c_1553]) ).
tff(c_1558,plain,
pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k0x30,name_ki)))),
inference(splitRight,[status(thm)],[c_485]) ).
tff(c_116,plain,
! [VAR_V_44_14] :
( pred_attacker(VAR_V_44_14)
| ~ pred_attacker(tuple_T_out_2(VAR_V_44_14)) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_1567,plain,
pred_attacker(constr_h(constr_xor(name_k0x30,name_ki))),
inference(resolution,[status(thm)],[c_1558,c_116]) ).
tff(c_1571,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_886,c_1567]) ).
tff(c_1572,plain,
! [VAR_R_144_31] :
( ~ pred_attacker(tuple_T_in_1(VAR_R_144_31))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(splitRight,[status(thm)],[c_150]) ).
tff(c_1573,plain,
! [VAR_R_144_31] : ~ pred_attacker(tuple_T_in_1(VAR_R_144_31)),
inference(splitLeft,[status(thm)],[c_1572]) ).
tff(c_1574,plain,
! [VAR_V_63_21] : ~ pred_attacker(VAR_V_63_21),
inference(negUnitSimplification,[status(thm)],[c_1573,c_124]) ).
tff(c_146,plain,
! [VAR_V_78_28] : pred_attacker(name_new0x2Dname(VAR_V_78_28)),
inference(cnfTransformation,[status(thm)],[f_200]) ).
tff(c_1596,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1574,c_146]) ).
tff(c_1597,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(splitRight,[status(thm)],[c_1572]) ).
tff(c_112,plain,
! [VAR_V_38_12] :
( pred_attacker(VAR_V_38_12)
| ~ pred_attacker(tuple_T_out_4(VAR_V_38_12)) ),
inference(cnfTransformation,[status(thm)],[f_148]) ).
tff(c_1600,plain,
pred_attacker(name_objective),
inference(resolution,[status(thm)],[c_1597,c_112]) ).
tff(c_1604,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_152,c_1600]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW950+1 : TPTP v8.1.2. Released v7.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.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 19:35:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.77/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.77/2.24
% 4.77/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.71/2.27
% 5.71/2.27 Inference rules
% 5.71/2.27 ----------------------
% 5.71/2.27 #Ref : 0
% 5.71/2.27 #Sup : 333
% 5.71/2.27 #Fact : 0
% 5.71/2.27 #Define : 0
% 5.71/2.27 #Split : 7
% 5.71/2.27 #Chain : 0
% 5.71/2.27 #Close : 0
% 5.71/2.27
% 5.71/2.27 Ordering : KBO
% 5.71/2.27
% 5.71/2.27 Simplification rules
% 5.71/2.27 ----------------------
% 5.71/2.27 #Subsume : 110
% 5.71/2.27 #Demod : 154
% 5.71/2.27 #Tautology : 137
% 5.71/2.27 #SimpNegUnit : 23
% 5.71/2.27 #BackRed : 11
% 5.71/2.27
% 5.71/2.27 #Partial instantiations: 0
% 5.71/2.27 #Strategies tried : 1
% 5.71/2.27
% 5.71/2.27 Timing (in seconds)
% 5.71/2.27 ----------------------
% 5.71/2.27 Preprocessing : 0.56
% 5.71/2.27 Parsing : 0.30
% 5.71/2.27 CNF conversion : 0.04
% 5.71/2.27 Main loop : 0.66
% 5.71/2.27 Inferencing : 0.21
% 5.71/2.27 Reduction : 0.24
% 5.71/2.27 Demodulation : 0.18
% 5.71/2.27 BG Simplification : 0.03
% 5.71/2.28 Subsumption : 0.13
% 5.71/2.28 Abstraction : 0.02
% 5.71/2.28 MUC search : 0.00
% 5.71/2.28 Cooper : 0.00
% 5.71/2.28 Total : 1.27
% 5.71/2.28 Index Insertion : 0.00
% 5.71/2.28 Index Deletion : 0.00
% 5.71/2.28 Index Matching : 0.00
% 5.71/2.28 BG Taut test : 0.00
%------------------------------------------------------------------------------