0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n005.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Aug 9 03:17:04 EDT 2022 0.13/0.35 % CPUTime : 0.20/0.49 Running first-order on 8 cores theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.50 # Version: 3.0pre003 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN. 0.20/0.53 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 600s (5) cores 0.20/0.53 # Starting new_bool_3 with 120s (1) cores 0.20/0.53 # Starting new_bool_1 with 120s (1) cores 0.20/0.53 # Starting sh5l with 120s (1) cores 0.20/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8562 completed with status 0 0.20/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN. 0.20/0.53 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 600s (5) cores 0.20/0.53 # No SInE strategy applied 0.20/0.53 # Search class: FGUSM-FFMM21-DFFFFFNN 0.20/0.53 # partial match(1): FGUSM-FFMF21-DFFFFFNN 0.20/0.53 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 270s (1) cores 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 61s (1) cores 0.20/0.53 # Starting new_bool_3 with 68s (1) cores 0.20/0.53 # Starting new_bool_1 with 68s (1) cores 0.20/0.53 # Starting sh5l with 68s (1) cores 0.20/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8573 completed with status 0 0.20/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN. 0.20/0.53 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 600s (5) cores 0.20/0.53 # No SInE strategy applied 0.20/0.53 # Search class: FGUSM-FFMM21-DFFFFFNN 0.20/0.53 # partial match(1): FGUSM-FFMF21-DFFFFFNN 0.20/0.53 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 270s (1) cores 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 61s (1) cores 0.20/0.53 # Preprocessing time : 0.003 s 0.20/0.53 # Presaturation interreduction done 0.20/0.53 0.20/0.53 # Proof found! 0.20/0.53 # SZS status Theorem 0.20/0.53 # SZS output start CNFRefutation 0.20/0.53 tff(decl_22, type, tuple_key_register_server_in_1: ($i * $i) > $i). 0.20/0.53 tff(decl_23, type, pred_attacker: $i > $o). 0.20/0.53 tff(decl_24, type, name_B: $i). 0.20/0.53 tff(decl_25, type, name_skB: $i). 0.20/0.53 tff(decl_26, type, constr_pkey: $i > $i). 0.20/0.53 tff(decl_27, type, tuple_keys: ($i * $i) > $i). 0.20/0.53 tff(decl_28, type, pred_table: $i > $o). 0.20/0.53 tff(decl_29, type, tuple_2: ($i * $i) > $i). 0.20/0.53 tff(decl_30, type, constr_tuple_2_get_0x30: $i > $i). 0.20/0.53 tff(decl_31, type, name_c: $i). 0.20/0.53 tff(decl_32, type, constr_ZERO: $i). 0.20/0.53 tff(decl_33, type, constr_CONST_3: $i). 0.20/0.53 tff(decl_34, type, name_A: $i). 0.20/0.53 tff(decl_35, type, name_skA: $i). 0.20/0.53 tff(decl_36, type, name_I: $i). 0.20/0.53 tff(decl_37, type, tuple_out_3: $i > $i). 0.20/0.53 tff(decl_38, type, constr_CONST_0x30: $i). 0.20/0.53 tff(decl_39, type, constr_CONST_1: $i). 0.20/0.53 tff(decl_40, type, constr_CONST_2: $i). 0.20/0.53 tff(decl_41, type, constr_CONST_4: $i). 0.20/0.53 tff(decl_42, type, name_skS: $i). 0.20/0.53 tff(decl_43, type, constr_sign: ($i * $i) > $i). 0.20/0.53 tff(decl_44, type, tuple_key_retrieval_server_out_2: $i > $i). 0.20/0.53 tff(decl_45, type, tuple_key_retrieval_server_in_1: ($i * $i) > $i). 0.20/0.53 tff(decl_46, type, name_objective: $i). 0.20/0.53 tff(decl_47, type, tuple_client_B_out_1: ($i * $i) > $i). 0.20/0.53 tff(decl_48, type, tuple_client_A_in_2: $i > $i). 0.20/0.53 tff(decl_49, type, name_Na: $i > $i). 0.20/0.53 tff(decl_50, type, constr_checksign: ($i * $i) > $i). 0.20/0.53 tff(decl_51, type, constr_tuple_2_get_1_bitstring: $i > $i). 0.20/0.53 tff(decl_52, type, constr_aenc: ($i * $i) > $i). 0.20/0.53 tff(decl_53, type, tuple_client_A_out_3: $i > $i). 0.20/0.53 tff(decl_54, type, pred_eq_bitstring_bitstring: ($i * $i) > $o). 0.20/0.53 tff(decl_55, type, tuple_client_A_in_4: $i > $i). 0.20/0.53 tff(decl_56, type, constr_adec: ($i * $i) > $i). 0.20/0.53 tff(decl_57, type, constr_tuple_2_get_0x30_bitstring: $i > $i). 0.20/0.53 tff(decl_58, type, constr_xor: ($i * $i) > $i). 0.20/0.53 tff(decl_59, type, tuple_client_A_out_5: $i > $i). 0.20/0.53 tff(decl_60, type, tuple_client_B_in_2: $i > $i). 0.20/0.53 tff(decl_61, type, constr_tuple_2_get_1: $i > $i). 0.20/0.53 tff(decl_62, type, tuple_client_A_out_1: ($i * $i) > $i). 0.20/0.53 tff(decl_63, type, tuple_out_1: $i > $i). 0.20/0.53 tff(decl_64, type, tuple_client_B_in_3: $i > $i). 0.20/0.53 tff(decl_65, type, tuple_false: $i). 0.20/0.53 tff(decl_66, type, tuple_client_B_in_5: $i > $i). 0.20/0.53 tff(decl_67, type, pred_mess: ($i * $i) > $o). 0.20/0.53 tff(decl_68, type, tuple_client_B_out_4: $i > $i). 0.20/0.53 tff(decl_69, type, tuple_client_B_out_6: $i > $i). 0.20/0.53 tff(decl_70, type, tuple_out_2: $i > $i). 0.20/0.53 tff(decl_71, type, constr_enc: ($i * $i) > $i). 0.20/0.53 tff(decl_72, type, constr_dec: ($i * $i) > $i). 0.20/0.53 tff(decl_73, type, constr_getmess: $i > $i). 0.20/0.53 tff(decl_74, type, name_new0x2Dname: $i > $i). 0.20/0.53 tff(decl_75, type, pred_equal: ($i * $i) > $o). 0.20/0.53 tff(decl_76, type, name_Nb: $i > $i). 0.20/0.53 tff(decl_77, type, tuple_true: $i). 0.20/0.53 fof(ax184, axiom, ![X117, X118, X119, X120]:((pred_attacker(tuple_client_B_out_6(name_objective))<=(((((pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X120,constr_pkey(name_skS))))&pred_attacker(tuple_client_B_in_2(X120)))&pred_attacker(tuple_client_B_in_3(X118)))&pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X118,name_skB))))&pred_attacker(tuple_client_B_in_5(X119)))&pred_eq_bitstring_bitstring(name_Nb(X117),constr_adec(X119,name_skB))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax184)). 0.20/0.53 fof(ax103, axiom, ![X49, X50]:(pred_eq_bitstring_bitstring(X49,X50)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax103)). 0.20/0.53 fof(ax141, axiom, ![X104]:((pred_attacker(X104)=>pred_attacker(tuple_client_B_in_2(X104)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax141)). 0.20/0.53 fof(ax139, axiom, ![X114]:((pred_attacker(X114)=>pred_attacker(tuple_client_B_in_3(X114)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax139)). 0.20/0.53 fof(ax137, axiom, ![X47]:((pred_attacker(tuple_client_B_in_5(X47))<=pred_attacker(X47))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax137)). 0.20/0.53 fof(ax109, axiom, pred_attacker(tuple_true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax109)). 0.20/0.53 fof(ax131, axiom, ![X103]:((pred_attacker(tuple_client_B_out_6(X103))=>pred_attacker(X103))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax131)). 0.20/0.53 fof(co0, conjecture, pred_attacker(name_objective), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co0)). 0.20/0.53 fof(c_0_8, plain, ![X117, X118, X119, X120]:(((((((pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X120,constr_pkey(name_skS))))&pred_attacker(tuple_client_B_in_2(X120)))&pred_attacker(tuple_client_B_in_3(X118)))&pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X118,name_skB))))&pred_attacker(tuple_client_B_in_5(X119)))&pred_eq_bitstring_bitstring(name_Nb(X117),constr_adec(X119,name_skB)))=>pred_attacker(tuple_client_B_out_6(name_objective)))), inference(fof_simplification,[status(thm)],[ax184])). 0.20/0.53 fof(c_0_9, plain, ![X241, X242, X243, X244]:((~pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X244,constr_pkey(name_skS))))|~pred_attacker(tuple_client_B_in_2(X244))|~pred_attacker(tuple_client_B_in_3(X242))|~pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X242,name_skB)))|~pred_attacker(tuple_client_B_in_5(X243))|~pred_eq_bitstring_bitstring(name_Nb(X241),constr_adec(X243,name_skB))|pred_attacker(tuple_client_B_out_6(name_objective)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])). 0.20/0.53 fof(c_0_10, plain, ![X173, X174]:(pred_eq_bitstring_bitstring(X173,X174)), inference(variable_rename,[status(thm)],[ax103])). 0.20/0.53 cnf(c_0_11, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X1,constr_pkey(name_skS))))|~pred_attacker(tuple_client_B_in_2(X1))|~pred_attacker(tuple_client_B_in_3(X2))|~pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X2,name_skB)))|~pred_attacker(tuple_client_B_in_5(X3))|~pred_eq_bitstring_bitstring(name_Nb(X4),constr_adec(X3,name_skB))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.53 cnf(c_0_12, plain, (pred_eq_bitstring_bitstring(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.20/0.53 fof(c_0_13, plain, ![X228]:((~pred_attacker(X228)|pred_attacker(tuple_client_B_in_2(X228)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])])). 0.20/0.53 cnf(c_0_14, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_attacker(tuple_client_B_in_2(X1))|~pred_attacker(tuple_client_B_in_3(X2))|~pred_attacker(tuple_client_B_in_5(X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12]), c_0_12]), c_0_12])])). 0.20/0.53 cnf(c_0_15, plain, (pred_attacker(tuple_client_B_in_2(X1))|~pred_attacker(X1)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.53 fof(c_0_16, plain, ![X238]:((~pred_attacker(X238)|pred_attacker(tuple_client_B_in_3(X238)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])])). 0.20/0.53 fof(c_0_17, plain, ![X47]:((pred_attacker(X47)=>pred_attacker(tuple_client_B_in_5(X47)))), inference(fof_simplification,[status(thm)],[ax137])). 0.20/0.53 cnf(c_0_18, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_attacker(tuple_client_B_in_3(X1))|~pred_attacker(tuple_client_B_in_5(X2))|~pred_attacker(X3)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.20/0.53 cnf(c_0_19, plain, (pred_attacker(tuple_client_B_in_3(X1))|~pred_attacker(X1)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.20/0.53 fof(c_0_20, plain, ![X171]:((~pred_attacker(X171)|pred_attacker(tuple_client_B_in_5(X171)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])). 0.20/0.53 cnf(c_0_21, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_attacker(tuple_client_B_in_5(X1))|~pred_attacker(X2)|~pred_attacker(X3)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.20/0.53 cnf(c_0_22, plain, (pred_attacker(tuple_client_B_in_5(X1))|~pred_attacker(X1)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.20/0.53 cnf(c_0_23, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_attacker(X1)|~pred_attacker(X2)|~pred_attacker(X3)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.20/0.53 cnf(c_0_24, plain, (pred_attacker(tuple_true)), inference(split_conjunct,[status(thm)],[ax109])). 0.20/0.53 cnf(c_0_25, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_attacker(X1)|~pred_attacker(X2)), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.20/0.53 fof(c_0_26, plain, ![X227]:((~pred_attacker(tuple_client_B_out_6(X227))|pred_attacker(X227))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])])). 0.20/0.53 cnf(c_0_27, plain, (pred_attacker(tuple_client_B_out_6(name_objective))|~pred_attacker(X1)), inference(spm,[status(thm)],[c_0_25, c_0_24])). 0.20/0.53 fof(c_0_28, negated_conjecture, ~pred_attacker(name_objective), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])])). 0.20/0.53 cnf(c_0_29, plain, (pred_attacker(X1)|~pred_attacker(tuple_client_B_out_6(X1))), inference(split_conjunct,[status(thm)],[c_0_26])). 0.20/0.53 cnf(c_0_30, plain, (pred_attacker(tuple_client_B_out_6(name_objective))), inference(spm,[status(thm)],[c_0_27, c_0_24])). 0.20/0.53 cnf(c_0_31, negated_conjecture, (~pred_attacker(name_objective)), inference(split_conjunct,[status(thm)],[c_0_28])). 0.20/0.53 cnf(c_0_32, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31]), ['proof']). 0.20/0.53 # SZS output end CNFRefutation 0.20/0.53 # Parsed axioms : 188 0.20/0.53 # Removed by relevancy pruning/SinE : 0 0.20/0.53 # Initial clauses : 188 0.20/0.53 # Removed in clause preprocessing : 1 0.20/0.53 # Initial clauses in saturation : 187 0.20/0.53 # Processed clauses : 408 0.20/0.53 # ...of these trivial : 2 0.20/0.53 # ...subsumed : 16 0.20/0.53 # ...remaining for further processing : 390 0.20/0.53 # Other redundant clauses eliminated : 0 0.20/0.53 # Clauses deleted for lack of memory : 0 0.20/0.53 # Backward-subsumed : 5 0.20/0.53 # Backward-rewritten : 1 0.20/0.53 # Generated clauses : 282 0.20/0.53 # ...of the previous two non-redundant : 219 0.20/0.53 # ...aggressively subsumed : 0 0.20/0.53 # Contextual simplify-reflections : 0 0.20/0.53 # Paramodulations : 282 0.20/0.53 # Factorizations : 0 0.20/0.53 # NegExts : 0 0.20/0.53 # Equation resolutions : 0 0.20/0.53 # Propositional unsat checks : 0 0.20/0.53 # Propositional check models : 0 0.20/0.53 # Propositional check unsatisfiable : 0 0.20/0.53 # Propositional clauses : 0 0.20/0.53 # Propositional clauses after purity: 0 0.20/0.53 # Propositional unsat core size : 0 0.20/0.53 # Propositional preprocessing time : 0.000 0.20/0.53 # Propositional encoding time : 0.000 0.20/0.53 # Propositional solver time : 0.000 0.20/0.53 # Success case prop preproc time : 0.000 0.20/0.53 # Success case prop encoding time : 0.000 0.20/0.53 # Success case prop solver time : 0.000 0.20/0.53 # Current number of processed clauses : 197 0.20/0.53 # Positive orientable unit clauses : 39 0.20/0.53 # Positive unorientable unit clauses: 1 0.20/0.53 # Negative unit clauses : 92 0.20/0.53 # Non-unit-clauses : 65 0.20/0.53 # Current number of unprocessed clauses: 165 0.20/0.53 # ...number of literals in the above : 478 0.20/0.53 # Current number of archived formulas : 0 0.20/0.53 # Current number of archived clauses : 194 0.20/0.53 # Clause-clause subsumption calls (NU) : 6096 0.20/0.53 # Rec. Clause-clause subsumption calls : 5759 0.20/0.53 # Non-unit clause-clause subsumptions : 21 0.20/0.53 # Unit Clause-clause subsumption calls : 1476 0.20/0.53 # Rewrite failures with RHS unbound : 0 0.20/0.53 # BW rewrite match attempts : 14 0.20/0.53 # BW rewrite match successes : 9 0.20/0.53 # Condensation attempts : 0 0.20/0.53 # Condensation successes : 0 0.20/0.53 # Termbank termtop insertions : 9623 0.20/0.53 0.20/0.53 # ------------------------------------------------- 0.20/0.53 # User time : 0.021 s 0.20/0.53 # System time : 0.004 s 0.20/0.53 # Total time : 0.026 s 0.20/0.53 # Maximum resident set size: 2344 pages 0.20/0.53 0.20/0.53 # ------------------------------------------------- 0.20/0.53 # User time : 0.091 s 0.20/0.53 # System time : 0.012 s 0.20/0.53 # Total time : 0.102 s 0.20/0.53 # Maximum resident set size: 1912 pages 0.20/0.53 EOF