0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.34 Computer : n012.cluster.edu 0.13/0.34 Model : x86_64 x86_64 0.13/0.34 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 RAMPerCPU : 8042.1875MB 0.13/0.34 OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 05:20:29 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.37 # No SInE strategy applied 0.19/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN 0.19/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. 0.19/0.37 # 0.19/0.37 # Number of axioms: 28 Number of unprocessed: 28 0.19/0.37 # Tableaux proof search. 0.19/0.37 # APR header successfully linked. 0.19/0.37 # Hello from C++ 0.19/0.50 # The folding up rule is enabled... 0.19/0.50 # Local unification is enabled... 0.19/0.50 # Any saturation attempts will use folding labels... 0.19/0.50 # 28 beginning clauses after preprocessing and clausification 0.19/0.50 # Creating start rules for all 1 conjectures. 0.19/0.50 # There are 1 start rule candidates: 0.19/0.50 # Found 10 unit axioms. 0.19/0.50 # 1 start rule tableaux created. 0.19/0.50 # 18 extension rule candidate clauses 0.19/0.50 # 10 unit axiom clauses 0.19/0.50 0.19/0.50 # Requested 8, 32 cores available to the main process. 0.19/0.50 # There are not enough tableaux to fork, creating more from the initial 1 0.19/0.50 # There were 1 total branch saturation attempts. 0.19/0.50 # There were 0 of these attempts blocked. 0.19/0.50 # There were 0 deferred branch saturation attempts. 0.19/0.50 # There were 0 free duplicated saturations. 0.19/0.50 # There were 1 total successful branch saturations. 0.19/0.50 # There were 0 successful branch saturations in interreduction. 0.19/0.50 # There were 0 successful branch saturations on the branch. 0.19/0.50 # There were 1 successful branch saturations after the branch. 0.19/0.50 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.50 # Begin clausification derivation 0.19/0.50 0.19/0.50 # End clausification derivation 0.19/0.50 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.50 cnf(i_0_8, plain, (knows(k_ca))). 0.19/0.50 cnf(i_0_6, plain, (knows(k_a))). 0.19/0.50 cnf(i_0_3, negated_conjecture, (~knows(secret))). 0.19/0.50 cnf(i_0_7, plain, (knows(inverse(k_a)))). 0.19/0.50 cnf(i_0_28, plain, (knows(head(X1))|~knows(X1))). 0.19/0.50 cnf(i_0_26, plain, (knows(tail(X1))|~knows(X1))). 0.19/0.50 cnf(i_0_27, plain, (knows(hash(X1))|~knows(X1))). 0.19/0.50 cnf(i_0_5, plain, (head(concatenate(X1,X2))=X1)). 0.19/0.50 cnf(i_0_9, plain, (tail(concatenate(X1,X2))=X2)). 0.19/0.50 cnf(i_0_11, plain, (symmetric_decrypt(symmetric_encrypt(X1,X2),X2)=X1)). 0.19/0.50 cnf(i_0_20, plain, (knows(encrypt(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_17, plain, (knows(sign(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_16, plain, (knows(extract(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_4, plain, (knows(mac(X2,X1))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_21, plain, (knows(concatenate(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_19, plain, (knows(symmetric_encrypt(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_18, plain, (knows(symmetric_decrypt(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_15, plain, (knows(decrypt(X1,X2))|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_25, plain, (decrypt(encrypt(X1,X2),inverse(X2))=X1)). 0.19/0.50 cnf(i_0_14, plain, (knows(X1)|~knows(concatenate(X2,X1)))). 0.19/0.50 cnf(i_0_13, plain, (knows(X1)|~knows(concatenate(X1,X2)))). 0.19/0.50 cnf(i_0_2, plain, (extract(sign(X1,inverse(X2)),X2)=X1)). 0.19/0.50 cnf(i_0_10, plain, (knows(X1)|~knows(X2)|~knows(symmetric_encrypt(X1,X2)))). 0.19/0.50 cnf(i_0_1, plain, (knows(X1)|~knows(inverse(X2))|~knows(encrypt(X1,X2)))). 0.19/0.50 cnf(i_0_31, plain, (knows(X2)|~knows(X1)|~knows(sign(X2,inverse(X1))))). 0.19/0.50 cnf(i_0_22, plain, (knows(concatenate(n,concatenate(k_c,sign(concatenate(c,concatenate(k_c,eol)),inverse(k_c))))))). 0.19/0.50 cnf(i_0_24, plain, (knows(concatenate(encrypt(sign(concatenate(kgen(X2),concatenate(X1,eol)),inverse(k_s)),X2),sign(concatenate(s,concatenate(k_s,eol)),inverse(k_ca))))|head(tail(extract(X3,X2)))!=X2|~knows(X3)|~knows(X2)|~knows(X1))). 0.19/0.50 cnf(i_0_23, plain, (knows(symmetric_encrypt(secret,head(extract(decrypt(X1,inverse(k_c)),head(tail(extract(X2,k_ca)))))))|head(extract(X2,k_ca))!=s|head(tail(extract(decrypt(X1,inverse(k_c)),head(tail(extract(X2,k_ca))))))!=n|~knows(X2)|~knows(X1))). 0.19/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.50 # Begin printing tableau 0.19/0.50 # Found 5 steps 0.19/0.50 cnf(i_0_3, negated_conjecture, (~knows(secret)), inference(start_rule)). 0.19/0.50 cnf(i_0_33, plain, (~knows(secret)), inference(extension_rule, [i_0_31])). 0.19/0.50 cnf(i_0_75, plain, (~knows(k_ca)), inference(closure_rule, [i_0_8])). 0.19/0.50 cnf(i_0_76, plain, (~knows(sign(secret,inverse(k_ca)))), inference(extension_rule, [i_0_14])). 0.19/0.50 cnf(i_0_118, plain, (~knows(concatenate(X4,sign(secret,inverse(k_ca))))), inference(etableau_closure_rule, [i_0_118, ...])). 0.19/0.50 # End printing tableau 0.19/0.50 # SZS output end 0.19/0.50 # Branches closed with saturation will be marked with an "s" 0.19/0.50 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. 0.19/0.50 # We now have 5 tableaux to operate on 0.19/0.50 # Found closed tableau during pool population. 0.19/0.50 # Proof search is over... 0.19/0.50 # Freeing feature tree 0.19/0.50 EOF